401 - Palindromes

UVa OJ
Root :: AOAPC I: Beginning Algorithm Contests (Rujia Liu) :: Volume 1. Elementary Problem Solving :: String
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 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.
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.
INPUT

NOTAPALINDROME 
ISAPALINILAPASI 
2A3MEAS 
ATOYOTA

OUTPUT

NOTAPALINDROME -- is not a palindrome.
 
ISAPALINILAPASI -- is a regular palindrome.
 
2A3MEAS -- is a mirrored string.
 
ATOYOTA -- is a mirrored palindrome.

この問題は主に二つの部分に分かれている.
1つの部分は、文字列が返信文字列であるかどうかです.比較的簡単
もう1つの部分はmirrored stringかどうかを判断することです.これは実際に返事に基づいて新しい対称規則があります.
では、まず、その文字が対称な文字であるかどうかを判断し、対応する位置の文字がmirrored alphaであるかどうかを見ます.

#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
char str[30],
mirror[40][2]={'A','A','E','3','H','H','I','I','J','L','L','J','M','M',
               'O','O','S','2','T','T','U','U','V','V','W','W','X','X',
               'Y','Y','Z','5','1','1','2','S','3','E','5','Z','8','8'};
using namespace std;
int rev()
{
    int i,j,len;
    len=strlen(str);
    for (i=0,j=len-1; i<j; i++,j--)
        if (str[i]!=str[j])
            return 0;
    return 1;
}
int mirr()
{
    int i,j,len,k,p=0;
    len=strlen(str);
    for (i=0,j=len-1; i<=j; i++,j--) //i      j       mirror   ，      ，       
    {
        p=0;
        for (k=0; k<30; k++)
            if (str[i]==mirror[k][0])
            {
                p=1;
                if (str[j]!=mirror[k][1])
                    return 0;
            }
        if (p==0) return 0;
    }
    return 1;
}
int main ()
{
    int k,p;
    while(cin>>str)
    {
        k=rev();
        p=mirr();
        if (k==1 && p==1) cout<<str<<" -- is a mirrored palindrome."<<endl;
        if (k==1 && p!=1) cout<<str<<" -- is a regular palindrome."<<endl;
        if (k!=1 && p==1) cout<<str<<" -- is a mirrored string."<<endl;
        if (k!=1 && p!=1) cout<<str<<" -- is not a palindrome."<<endl;
        cout<<endl;
    }
    return 0;
}