UVa 401

对称串和回文串

#include <cstdio>
#include <iostream>
#include <cstring>
using namespace std;
const char s1[30]={'A',0,0,0,'3',0,0,'H','I','L',0,'J','M',0,'O',0,0,0,'2','T','U','V','W','X','Y','Z'};
const char s2[30]={'1','S','E',0,'Z',0,0,'8',0};
char s[100];
int len;
bool fr,fp;
int main()
{
    while(~scanf("%s",&s)){
        len=strlen(s);
        fr=fp=1;
        for(int i=0;i<=len/2;i++){
            if(s[i]!=s[len-i-1]) fp=0;
            if('0'<=s[i]&&s[i]<='9'){
                if(s2[s[i]-'1']!=s[len-i-1]) fr=0;
            } else {
                if(s1[s[i]-'A']!=s[len-i-1]) fr=0; 
            }
        }
        if(fr&&fp){
            printf("%s -- is a mirrored palindrome.
",s);
        } else if(fr){
            printf("%s -- is a mirrored string.
",s);
        } else if(fp){
            printf("%s -- is a regular palindrome.
",s);
        } else {
            printf("%s -- is not a palindrome.
",s);
        }
        puts("");
    } return 0;
}