UVa401 - Palindromes

题目链接：https://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=342

题目大意：判断输入的字符串是否为回文串（字符串反转之后和原串相同，例如abba,madam）以及镜像串（A的镜像是A，E的镜像是3）。每个字符串的镜像如表所示.输出格式如样例所示。

#include<stdio.h>
#include<string.h>
#include<ctype.h>
const char* rev = "A  3 HIL JM O  2TUVWXY51SE Z 8 "; 
const char* msg[]={"not a palindrome","a regular palindrome","a mirrored string","a mirrored palindrome"};

char r(char ch){//获取ch的镜像字符串函数 
 if(isalpha(ch)) return rev[ch-'A'];
 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;
}