#include<queue>
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cctype>
#include<algorithm>
using namespace std;
char s1[27]="A 3 HIL JM O 2TUVWXY5";
char s2[10]="1SE Z 8 ";
int is_pali(char* a)
{
int len=strlen(a);
for(int i=0;i<len/2;i++)
if(a[i]!=a[len-i-1]) return 0;
return 1;
}
int is_mirr(char* a)
{
int len=strlen(a);
for(int i=0;i<len/2+1;i++)
{
if(isdigit(a[i])&&s2[a[i]-'1']!=a[len-i-1]) return 0;
else if(isalpha(a[i])&&s1[a[i]-'A']!=a[len-i-1]) return 0;
}
return 1;
}
int main()
{
char s[22];
while(gets(s))
{
if(is_pali(s)&&is_mirr(s)) printf("%s -- is a mirrored palindrome.\n",s);
else if(is_pali(s))printf("%s -- is a regular palindrome.\n",s);
else if(is_mirr(s)) printf("%s -- is a mirrored string.\n",s);
else printf("%s -- is not a palindrome.\n",s);
printf("\n");
}
return 0;
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cctype>
#include<algorithm>
using namespace std;
char s1[27]="A 3 HIL JM O 2TUVWXY5";
char s2[10]="1SE Z 8 ";
int is_pali(char* a)
{
int len=strlen(a);
for(int i=0;i<len/2;i++)
if(a[i]!=a[len-i-1]) return 0;
return 1;
}
int is_mirr(char* a)
{
int len=strlen(a);
for(int i=0;i<len/2+1;i++)
{
if(isdigit(a[i])&&s2[a[i]-'1']!=a[len-i-1]) return 0;
else if(isalpha(a[i])&&s1[a[i]-'A']!=a[len-i-1]) return 0;
}
return 1;
}
int main()
{
char s[22];
while(gets(s))
{
if(is_pali(s)&&is_mirr(s)) printf("%s -- is a mirrored palindrome.\n",s);
else if(is_pali(s))printf("%s -- is a regular palindrome.\n",s);
else if(is_mirr(s)) printf("%s -- is a mirrored string.\n",s);
else printf("%s -- is not a palindrome.\n",s);
printf("\n");
}
return 0;
}
此题主要在于判断镜面映射时巧妙的映射,此题除了本代码这样映射外,还可以建立一个相互映射,然后求一下下标:
- char const *ch = "AEHIJLMOSTUVWXYZ12358";
- char const *re = "A3HILJMO2TUVWXY51SEZ8";
- 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(ch[j] == str[0])
- 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-i-1])
- return 0;
- }
- return 1;
- }