UVa401 回文词

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.

Character	Reverse	Character	Reverse	Character	Reverse
A	A	M	M	Y	Y
B		N		Z	5
C		O	O	1	1
D		P		2	S
E	3	Q		3	E
F		R		4
G		S	2	5	Z
H	H	T	T	6
I	I	U	U	7
J	L	V	V	8	8
K		W	W	9
L	J	X	X

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.

STRING	CRITERIA
" -- is not a palindrome."	if the string is not a palindrome and is not a mirrored string
" -- is a regular palindrome."	if the string is a palindrome and is not a mirrored string
" -- is a mirrored string."	if the string is not a palindrome and is a mirrored string
" -- is a mirrored palindrome."	if the string is a palindrome and is a mirrored string

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.

输入样例：

NOTAPALINDROME
ISAPALINILAPASI
2A3MEAS
ATOYOTA

输出样例：

NOTAPALINDROME -- is not a palindrome.

ISAPALINILAPASI -- is a regular palindrome.

2A3MEAS -- is a mirrored string.

ATOYOTA -- is a mirrored palindrome.

大意就是判断一个输入的字符串是否为回文和镜像的，因此我写了两个函数。而对于题中表格的处理，本来开始打算用数组的，后来觉得不方便，改用switch语句了。

题目本来不难，注意特殊情况的处理，就是当字符串长度为1的时候。当n==1时，是回文的，当且仅当改字符和本身是镜像的时候，这个字符串是镜像的。

对了，还有很重要的一点就是每次输出后都要再输出一个空行，对于我们这种英语渣渣是怎么会注意到这种东西的。。

 #include <iostream>
 #include <cstring>
 using namespace std;

 const char* res[] = {" -- is not a palindrome.", " -- is a regular palindrome.",
                       " -- is a mirrored string.", " -- is a mirrored palindrome."};

 int main(void)
 {
     char Reverse(char c);
     bool Palindrome(char s[], int n);
     bool Mirrored(char s[], int n);
     char s[];
     int len;
     while(cin >> s)
     {
          len = strlen(s);
          bool flag1 = Palindrome(s, len);
          bool flag2 = Mirrored(s, len);
          cout << s;
          if(!flag1 && !flag2)
              cout << res[] << endl << endl;
          if(flag1 && !flag2)
              cout << res[] << endl << endl;
          if(!flag1 && flag2)
              cout << res[] << endl << endl;
          if(flag1 && flag2)
              cout << res[] << endl << endl;
     }
     return ;
 }
 char Reverse(char c)
 {
     switch (c)
     {
         case 'A':
         case 'H':
         case 'I':
         case 'M':
         case 'O':
         case 'T':
         case 'U':
         case 'V':
         case 'W':
         case 'X':
         case 'Y':
         case '':
         case '':
             return c;
         case 'E':
             return '';
         case 'J':
             return 'L';
         case 'L':
             return 'J';
         case 'S':
             return '';
         case 'Z':
             return '';
         case '':
             return 'S';
         case '':
             return 'E';
         case '':
             return 'Z';
         default:
             return ;
     }
 }
 //判断是否是回文字符串
 bool Palindrome(char s[], int n)
 {
     int i;
     if(n == )
         return true;
     for(i = ; i < n / ; ++i)
     {
         if(s[i] != s[n -  - i])
             return false;
     }
     return true;
 }
 //判断是否是镜像字符串
 bool Mirrored(char s[], int n)
 {
     int i;
     if(n == )
     {
         if(Reverse(s[]) == s[])
             return true;
         else
             return false;
     }
     for(i = ; i < n / ; ++i)
     {
         if(Reverse(s[i]) == )
             return false;
         if(Reverse(s[i]) != s[n -  - i])
             return false;
     }
     return true;
 }

代码君