UVA 之401 - Palindromes

A regular palindrome is a string of numbers or letters that is the same forward as backward. For example, the string "ABCDEDCBA" is a palindrome because it is the same when the string is read from left to right as when the string is read from right
to left.

A mirrored string is a string for which when each of the elements of the string is changed to its reverse (if it has a reverse) and the string is read backwards the result is the same as the original string. For example, the string "3AIAE" is a mirrored
string because "A" and "I" are their own reverses, and "3" and "E"are each others' reverses.

A mirrored palindrome is a string that meets the criteria of a regular palindrome and the criteria of a mirrored string. The string "ATOYOTA" is a mirrored palindrome because if the string is read backwards, the string is the same as the original and
because if each of the characters is replaced by its reverse and the result is read backwards, the result is the same as the original string. Of course, "A", "T", "O", and "Y"are all their own reverses.

A list of all valid characters and their reverses is as follows.

Note that O (zero) and 0 (the letter) are considered the same character and therefore ONLY the letter "0" is a valid character.

Input 

Input consists of strings (one per line) each of which will consist of one to twenty valid characters. There will be no invalid characters in any of the strings. Your program should read to
the end of file.

Output 

For each input string, you should print the string starting in column 1 immediately followed by exactly one of the following strings.

Note that the output line is to include the -'s and spacing exactly as shown in the table above and demonstrated in the Sample Output below.

In addition, after each output line, you must print an empty line.

Sample
Input 

NOTAPALINDROME
ISAPALINILAPASI
2A3MEAS
ATOYOTA

Sample
Output 

NOTAPALINDROME -- is not a palindrome.

ISAPALINILAPASI -- is a regular palindrome.

2A3MEAS -- is a mirrored string.

ATOYOTA -- is a mirrored palindrome.

【注意】：

题目意思：

判断输入的字符串是否是回文串还是镜面字符串。

回文串：从左到右读和从右到左读是一样的。

镜面字符串：如果某个字符有镜面字符，转换为相应的镜面字符。转换后从左到右读和从右到左读是一样的。

数字0和字母O是等价的。

【代码】：

[cpp] view
plaincopy

1. /********************************* 
2. *   日期：2013-4-22 
3. *   作者：SJF0115 
4. *   题号: 题目401 - Palindromes 
5. *   来源：http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=6&page=show_problem&problem=342 
6. *   结果：AC 
7. *   来源：UVA 
8. *   总结： 
9. **********************************/  
10. #include<stdio.h>  
11. #include<string.h>  
12.   
13. char MirroredStr[] = {'A',' ',' ',' ','3',' ',' ','H',  
14. 'I','L',' ','J','M',' ','O',' ',' ',' ','2','T','U','V','W','X','Y','5'};  
15. char MirroredNum[] = {'1','S','E',' ','Z',' ',' ','8',' '};  
16. //判断是否是回文  
17. int IsPalindromes(char Str[]){  
18.     int i,j;  
19.     for(i = 0,j = strlen(Str)-1;i < j;i++,j--){  
20.         //0 和 O等价  
21.         if((Str[i] == '0' && Str[j] == 'O') || (Str[i] == 'O' && Str[j] == '0')){  
22.             continue;  
23.         }  
24.         if(Str[i] != Str[j]){  
25.             return 0;  
26.         }  
27.     }  
28.     return 1;  
29. }  
30. //判断是否是镜像字符串  
31. int IsMirrored(char Str[]){  
32.     char temp[21];  
33.     int i,j,index;  
34.     int len = strlen(Str);  
35.     for(i = 0,j = len-1;i < len;i++,j--){  
36.         if(Str[i] >= 'A' && Str[i] <= 'Z'){  
37.             index = Str[i] - 'A';  
38.             temp[i] = MirroredStr[index];  
39.         }  
40.         else{  
41.             index = Str[i] - '1';  
42.             temp[i] = MirroredNum[index];  
43.         }  
44.         //0 和 O等价  
45.         if((temp[i] == '0' && Str[j] == 'O') || (temp[i] == 'O' && Str[j] == '0')){  
46.             continue;  
47.         }  
48.         if(temp[i] != Str[j]){  
49.             return 0;  
50.         }  
51.     }  
52.     return 1;  
53. }  
54. int main (){  
55.     char Str[21];  
56.     int i,len,IsP,IsM;  
57.     //freopen("C:\\Users\\XIAOSI\\Desktop\\acm.txt","r",stdin);    
58.     while(scanf("%s",Str) != EOF){  
59.         len = strlen(Str);  
60.         printf("%s -- ",Str);  
61.         //回文字符串  
62.         IsP = IsPalindromes(Str);  
63.         //镜面字符串  
64.         IsM = IsMirrored(Str);  
65.         //输出  
66.         if(IsP == 0 && IsM == 0){  
67.             printf("is not a palindrome.\n");  
68.         }  
69.         else if(IsP == 1 && IsM == 1){  
70.             printf("is a mirrored palindrome.\n");  
71.         }  
72.         else if(IsP == 1 && IsM == 0){  
73.             printf("is a regular palindrome.\n");  
74.         }  
75.         else if(IsP == 0 && IsM == 1){  
76.             printf("is a mirrored string.\n");  
77.         }  
78.         printf("\n");  
79.     }  
80.     return 0;  
81. }  
82.   
83.