白书 回文 镜像

不是很难的题，自己任性写了好多行，当然调式找错也是各种虐心，推荐其他写法，用一个数组，两个变量基本就可以解决，100行以内，本人写的比较粗俗，200行+，不推荐运用，请勿模仿。

Description

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.
#include <iostream>
#include <cstring>
#include <cstdio>
#include <algorithm>
using namespace std;
char a[10000];
char b[10000];
int f,w,k,i,h;
int main()
{
    while(scanf("%s",a)!=EOF)
    {
        int f=0,w=0,h=0;
        k=strlen(a);
        for(i=0;i<k;i++)
        {
            if(a[i]=='0')
            {
                a[i]='O';
            }
        }
        for(i=0;i<(k+1)/2;i++)   //注意是k+1;不是k！！！！！！！！！！！！！！！！！
            {
                if(a[i]==a[k-1-i])
                {
                    f=1;
                }
                else
                {
                    f=0;
                    break;
                }
            }
        for(i=0;i<k;i++)
        {
            if(a[i]=='A')
            {
                b[i]='A';
            }
            if(a[i]=='B')
            {
                b[i]='-';
            }
            if(a[i]=='C')
            {
                b[i]='-';
            }
            if(a[i]=='D')
            {
                b[i]='-';
            }
            if(a[i]=='E')
            {
                b[i]='3';
            }
            if(a[i]=='F')
            {
                b[i]='-';
            }
            if(a[i]=='G')
            {
                b[i]='-';
            }
            if(a[i]=='H')
            {
                b[i]='H';
            }
            if(a[i]=='I')
            {
                b[i]='I';
            }
            if(a[i]=='J')
            {
                b[i]='L';
            }
            if(a[i]=='K')
            {
                b[i]='-';
            }
            if(a[i]=='L')
            {
                b[i]='J';
            }
            if(a[i]=='M')
            {
                b[i]='M';
            }
            if(a[i]=='N')
            {
                b[i]='-';
            }
            if(a[i]=='O')
            {
                b[i]='O';
            }
            if(a[i]=='P')
            {
                b[i]='-';
            }
            if(a[i]=='Q')
            {
                b[i]='-';
            }
            if(a[i]=='R')
            {
                b[i]='-';
            }
            if(a[i]=='S')
            {
                b[i]='2';
            }
            if(a[i]=='T')
            {
                b[i]='T';
            }
            if(a[i]=='U')
            {
                b[i]='U';
            }
            if(a[i]=='V')
            {
                b[i]='V';
            }
            if(a[i]=='W')
            {
                b[i]='W';
            }
            if(a[i]=='X')
            {
                b[i]='X';
            }
            if(a[i]=='Y')
            {
                b[i]='Y';
            }
            if(a[i]=='Z')
            {
                b[i]='5';
            }
            if(a[i]=='1')
            {
                b[i]='1';
            }
            if(a[i]=='2')
            {
                b[i]='S';
            }
            if(a[i]=='3')
            {
                b[i]='E';
            }
            if(a[i]=='4')
            {
                b[i]='-';
            }
            if(a[i]=='5')
            {
                b[i]='Z';
            }
            if(a[i]=='6')
            {
                b[i]='-';
            }
            if(a[i]=='7')
            {
                b[i]='-';
            }
            if(a[i]=='8')
            {
                b[i]='8';
            }
            if(a[i]=='9')
            {
                b[i]='-';
            }
            if(a[i]=='0')
            {
                b[i]='O';
            }
        }
        for(i=0;i<k;i++)
        {
            if(!((a[i]>='A'&&a[i]<='Z')||(a[i]>='1'&&a[i]<='9')))
            {
                h=1;
                break;
            }
        }
        for(i=0;i<k;i++)
        {
            if(a[i]==b[k-i-1]&&b[i]!='-'&&h==0)
            {
                w=1;
            }
            else
           {
                w=0;
                break;
           }
        }
        printf("%s",a);
        printf(" -- ");
        if(f==1&&w==1)
        {
            printf("is a mirrored palindrome.\n\n");
        }
        if(f==0&&(w==0||h==1))
        {
            printf("is not a palindrome.\n\n");
        }
        if(f==1&&(w==0||h==1))
        {
            printf("is a regular palindrome.\n\n");
        }
        if(f==0&&w==1)
        {
            printf("is a mirrored string.\n\n");
        }
    }
    return 0;
}