回文词，镜像串的判定

#incldue<bits/stdc++.h>
using namespace std;
const char* rev = "A   3  HIL JM O   2TUVWXY51SE Z  8 "; // 其中 rev中存放镜像串 
const char* msg[] = {"not a palindrome", "a regular palindrome", "a mirrored string", "a mirrored palindrome"}; // 二维数组msg 
char r(char ch)
{
 if(isalpha(ch)) return rev[ch - 'A'];  // isalpha()函数判定是否为字母 isdigit()判定是否为数字 
 return rev[ch - '0' + 25];
}
int main()
{
	char s[30];
	 while(scanf("%s", s) == 1){
	  int len = strlen(s);
	  int p = 1, m = 1;
	  for(int i = 0; i < (len + 1) / 2; i++){
	   if(s[i] != s[len - 1 - i]) p = 0;
 	  if(r(s[i]) != s[len - 1 - i]) m= 0; 
 	 }
 	 printf("%s -- is %s.\n\n", s, msg[m*2+p]); 
	 } 
	return 0;
}