Batman_的博客

10617 - Again Palindrome Again Palindromes Input: Standard Input Output: Standard Output Time Limit: 2 Seconds   A palindorme is a sequence of one or morecharacters that reads the same from the

Uva 458 the Decoder 2015.5.24 Source: Uva 458 the Decoder Category: String Abstract: Decode the permutation ciphertext with key = 7.    The Decoder  Write a complete programt

Uva 494 2015.5.24 Source: Uva 494 Kindergarten Counting Game Category: string Abstract: Count the number of words in eachline, the definition of word is only consisting the upper and lowercaselette

Uva 401 2015.5.25 Source: Uva 401 Palindromes Category: string Abstract: Input several lines of strings,then justify whether it is a mirrored string or palindrome. There is a mirroredletters table.

#include #include #include #define MAXW 90 #define MAXN 15 #define MAXL 400 char before[MAXN][MAXW]; char after[MAXN][MAXW]; int nrule; char text[MAXL],text1[MAXL],text2[MAXL]; int main() {

/*    Source: uva 673        ParenthesesBalance    Category: Stack    Abstract: check a bunch of strings of brackets, whether they are matched    Sample Input:        3        ([])        (([()

/*    Source: Uva 10050 Hartals    Category: 模拟    Abstract: 给定一个天数N，以及各个机构罢工的间隔Pi，求计算在这N天里面，有多少天是罢工天。               周五和周六不罢工。    Idea:        用一个bool数组Day来标记当天是否有人罢工，true表示没人罢工，false表示有人罢工