401 - Palindromes
Time limit: 3.000 seconds
Palindromes
Palindromes |
A regular palindrome is a string of numbers or letters that is the same forward as backward. For example, the string "ABCDEDCBA" is apalindrome because it is the same when the string is read from left to right as when the string is read from right to left.
A mirrored string is a string for which when each of the elements of the string is changed to its reverse (if it has a reverse) and the string is read backwards the result is the same as the original string. For example, the string "3AIAE" is a mirrored string because "A"and "I" are their own reverses, and "3" and "E"are each others' reverses.
A mirrored palindrome is a string that meets the criteria of a regular palindrome and the criteria of a mirrored string. The string "ATOYOTA"is a mirrored palindrome because if the string is read backwards, the string is the same as the original and because if each of the characters is replaced by its reverse and the result is read backwards, the result is the same as the original string. Of course, "A", "T","O", and "Y" are all their own reverses.
A list of all valid characters and their reverses is as follows.
Character | Reverse | Character | Reverse | Character | Reverse |
A | A | M | M | Y | Y |
B | N | Z | 5 | ||
C | O | O | 1 | 1 | |
D | P | 2 | S | ||
E | 3 | Q | 3 | E | |
F | R | 4 | |||
G | S | 2 | 5 | Z | |
H | H | T | T | 6 | |
I | I | U | U | 7 | |
J | L | V | V | 8 | 8 |
K | W | W | 9 | ||
L | J | X | X |
Note that O (zero) and 0 (the letter) are considered the same character and therefore ONLY the letter "0" is a valid character.
Input
Input consists of strings (one per line) each of which will consist of one to twenty valid characters. There will be no invalid characters in any of the strings. Your program should read to the end of file.Output
For each input string, you should print the string starting in column 1 immediately followed by exactly one of the following strings.
STRING | CRITERIA |
" -- is not a palindrome." | if the string is not a palindrome and is not a mirrored string |
" -- is a regular palindrome." | if the string is a palindrome and is not a mirrored string |
" -- is a mirrored string." | if the string is not a palindrome and is a mirrored string |
" -- is a mirrored palindrome." | if the string is a palindrome and is a mirrored string |
Note that the output line is to include the -'s and spacing exactly as shown in the table above and demonstrated in the Sample Output below.
In addition, after each output line, you must print an empty line.
Sample Input
NOTAPALINDROME ISAPALINILAPASI 2A3MEAS ATOYOTA
Sample Output
NOTAPALINDROME -- is not a palindrome. ISAPALINILAPASI -- is a regular palindrome. 2A3MEAS -- is a mirrored string. ATOYOTA -- is a mirrored palindrome.
#include<stdio.h>
#include<string.h>
const int LEN=30;
int is_palindrome(char *s) //是回文就返回1,否则返回0
{
int len=strlen(s);
int temp=len/2;
//int tag=1;
for(int i=0;i<temp;++i)
{
if(s[i]!=s[len-i-1])
return 0;
}
return 1;
}
int main(){
char str[LEN],copy[LEN];
int len,i;
int rev[91]={0};
rev['A']='A';
rev['E']='3';
rev['3']='E';
rev['H']='H';
rev['I']='I';
rev['J']='L';
rev['L']='J';
rev['M']='M';
rev['O']='O';
rev['S']='2';
rev['2']='S';
rev['T']='T';
rev['U']='U';
rev['V']='V';
rev['W']='W';
rev['X']='X';
rev['Y']='Y';
rev['Z']='5';
rev['5']='Z';
rev['1']='1';
rev['8']='8';
while(scanf("%s",str)!=EOF){
strcpy(copy,str); //拷贝一份,用于输出
int len=strlen(str);
int temp=(len-1)/2;
int mir_tag=1;
int pal_tag=is_palindrome(str);
for(i=0;i<len;++i) //处理“0”
{
if(str[i]=='0')
str[i]='O';
}
for(i=0;i<=temp;++i) //判断是否是镜像
{
if(rev[str[i]]!=str[len-i-1])
{
mir_tag=0;
break;
}
}
if(pal_tag==0)
{
if(mir_tag==0)
printf("%s -- is not a palindrome.\n\n",copy);
else
printf("%s -- is a mirrored string.\n\n",copy);
}else{
if(mir_tag==0)
printf("%s -- is a regular palindrome.\n\n",copy);
else
printf("%s -- is a mirrored palindrome.\n\n",copy);
}
}
}