uva oj 401

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

char str[100];

int main()
{
    int i,j,flag1,flag2;
    while(scanf("%s",str)!=EOF)
    {
        printf("%s -- ",str);
        int len=strlen(str);
        flag1=1,flag2=1;
        for(i=0,j=len-1;i<=len/2;i++,j--) //写成i<len/2，wa了一次
        {
            if(str[i]!=str[j])
            {
                if(str[i]=='E'&&str[j]=='3' ||str[i]=='3'&&str[j]=='E'
                   ||str[i]=='J'&&str[j]=='L'||str[i]=='L'&&str[j]=='J'
                   ||str[i]=='S'&&str[j]=='2'||str[i]=='2'&&str[j]=='S'
                   ||str[i]=='Z'&&str[j]=='5'||str[i]=='5'&&str[j]=='Z')
                {
                    flag1=0;
                }
                else
                {
                    flag1=0;
                    flag2=0;
                    break;
                }
            }
            else
            {
                if(str[i]!='A' && str[i]!='H'&& str[i]!='I' &&str[i]!='M'&&
                   str[i]!='O' && str[i]!='T'&& str[i]!='U' &&str[i]!='V'&&
                   str[i]!='W'&& str[i]!='X' &&str[i]!='Y'  &&str[i]!='1'&&
                   str[i]!='8')
                    flag2=0;
            }
        }
        if(flag1==0 && flag2==0)
            printf("is not a palindrome.\n\n");
        else if(flag1==1 && flag2==1)
            printf("is a mirrored palindrome.\n\n");
        else if(flag1==1 && flag2==0)
            printf("is a regular palindrome.\n\n");
        else
            printf("is a mirrored string.\n\n");
        memset(str,0,sizeof(str));
    }
    return 0;
}

判断回文串和镜像串。