最新文章
这里会显示最新的几篇文章摘要。
记录生活,分享知识,与你一起成长。
这里会显示最新的几篇文章摘要。
#include<bits/stdc++.h>
/*
判断一个字符串是否是回文串,是否是镜像串
*/
using namespace std;
const char* rev = "A 3 HIL JM O 2TUVWXY51SE Z 8";//空格,为了确定相应位置
const char* msg[] = {" -- is not a palindrome."," -- is a regular palindrome."," -- is a mirrored string."," -- is a mirrored palindrome."};
char r(char ch)
{
if(isalpha(ch)) return rev[ch - 'A'];
return rev[ch - '0' + 25];
}
int main()
{
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
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%s\n\n", s, msg[m * 2 + p]);
}
return 0;
}