UVa401_Palindromes(小白书字符串专题)

Description

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.

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.

---

解题报告
回文字符串很容易理解，镜像字符串什么东西呀，网上查了一下意思，还是不怎么理解。 
A regular palindrome是一种字符串：回文字符串就是正向读和反向读字符完全相等，但不能全是像A这种镜像之后还为本身的字符串，“可以有不能全是”。
A mirrored string是一种字符串就是包括包括镜像字符的像3和E这种就称为影像后相等的，所以在这里：字符串可以出现像A这种以自身为镜像，但不能全部都是这种。所以判断时首先判断从前向后读和从后向前读必须镜像相等的而且不能全部都是字符串镜像为自己本身的字符串。
A mirrored palindrome是一种字符串，它里面全都是就是像Y、A、T、X、W等这种左右对称的字符，也就是说在字符串里必须首先像ATTA这种从前向后读和从后向前读都一样的，其次每一个字符的镜像之后是它本身的才行。
以上解释是网上大神的理解。
一开始写两个函数，一个判断回文，一个判断镜像，还有一个镜像表，题目要注意的一个是每次的空行，还有就是对一个字符的字符串的判断，白书上面讲的储存镜像表的数组不会用。。。

#include <stdio.h>
#include <stdlib.h>
#include<string.h>
 char re(char ch);
 int ispa(char s[],int len);
 int ismi(char s[],int len);
 int main()
 {
     char s[1000];
     int l;
     while(scanf("%s",s)!=EOF)
     {
         l=strlen(s);
         if(l==1)
         {
             if(s[0]!=re(s[0]))
             printf("%s -- is a regular palindrome.\n\n",s);
             else printf("%s -- is a mirrored palindrome.\n\n",s);
         }
         else if(ispa(s,l)&&ismi(s,l))
         {
             printf("%s -- is a mirrored palindrome.\n\n",s);
         }
         else if(ispa(s,l))
         {
             printf("%s -- is a regular palindrome.\n\n",s);
         }
         else if(ismi(s,l))
         {
             printf("%s -- is a mirrored string.\n\n",s);
         }
         else
         {
             printf("%s -- is not a palindrome.\n\n",s);
         }
     }
     return 0;
 }
 char re(char ch)
 {
     switch(ch)
     {
         case 'A':return 'A';
         case 'E':return '3';
         case 'H':return 'H';
         case 'I':return 'I';
         case 'J':return 'L';
         case 'L':return 'J';
         case 'M':return 'M';
         case 'O':return 'O';
         case 'S':return '2';
         case 'T':return 'T';
         case 'U':return 'U';
         case 'V':return 'V';
         case 'W':return 'W';
         case 'X':return 'X';
         case 'Y':return 'Y';
         case 'Z':return '5';
         case '1':return '1';
         case '2':return 'S';
         case '3':return 'E';
         case '5':return 'Z';
         case '8':return '8';
         default:return ' ';
     }
 }
 int ispa(char s[],int l)
 {
     int i;
     for(i=0;i<l/2;i++)
     {
         if(s[i]!=s[l-1-i])return 0;
     }
     return 1;
 }
 int ismi(char s[],int l)
 {
     int i;
     for(i=0;i<l/2;i++)
     {
         if(re(s[i])!=s[l-1-i])return 0;
     }
     return 1;
 }