uva 401

题意：回文，镜像的判断，写成函数，便于后面的判断

nclude <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int MAXN = 1024 ;
char const *ch = "AEHIJLMOSTUVWXYZ12358";  
char const *re = "A3HILJMO2TUVWXY51SEZ8";  

int is_palindrome(char *str)
{
	int i,len = strlen(str);
	for(i = 0 ; i < len/2 ; i++)
	{
		if(str[i] != str[len-1-i])
			return 0;
	}
	return 1;
}

int is_mirrored(char *str)
{
	int table_len = strlen(ch);
	int i,j,len=strlen(str);
	if(len == 1)
	{
		for(j = 0 ; j < table_len ; j++)
		{
			if(str[0] == ch[j])
				break;
		}
		if(j == 21 || re[j] != str[0])
			return 0 ;
	}
	else if(len > 1 )
		for( i = 0 ; i < len/2 ; i++)
		{
			for(j = 0 ; j < table_len ; j++)
			{
				if(ch[j] == str[i])
					break;
			}
			if(j == 21 || re[j] != str[len-1-i])
				return 0;
		}
	return 1;
}
int main()
{
	char str[MAXN];
	while(scanf("%s",str) != EOF)
	{
		if(is_palindrome(str))  
        {  
            if(is_mirrored(str))  
                printf("%s -- is a mirrored palindrome.\n\n",str);  
            else  
                printf("%s -- is a regular palindrome.\n\n",str);  
        }  
        else  
        {  
            if(is_mirrored(str))  
                printf("%s -- is a mirrored string.\n\n",str);  
            else  
                printf("%s -- is not a palindrome.\n\n",str);  
        }  
	}
	return 0 ;

}