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.
Miguel Revilla2001-04-16 这道题目拿到了4个WA
原本的设想是写两个函数分别判断回文和镜像,通过返回值判断结果。可是WA,修改以后还是WA。结果越修改越难理解。后来看了别人的AC代码才发现自己把问题想的太复杂。实际上可以在一个循环里面判断是否是回文和镜像。后来修改以后还是WA,原本以为是因为'0'(数字)的问题,后来对'0'特殊处理修改之后还是WA。最后才发现输出之后还需要输出一个空行,修改后AC了,然后试着将对'0'(数字)的特殊处理代码去掉也能AC,原来数据不会输入'0'(数字)。
AC代码如下:
#include <stdio.h>
#include <string.h>
#include <ctype.h>
#define MAXN 50
int main(void)
{
char str[MAXN];
int state_m, state_p;
int len, i, index, mid;
char c[] = "A 3 HIL JM O 2TUVWXY51SE Z 89";
while (scanf("%s", str) != EOF) {
len = strlen(str);
mid = (len+1) / 2;
state_p = state_m = 1;
for (i=0; i<mid; ++i) {
index = isdigit(str[i]) ? str[i] - 23 : str[i] - 'A';
if (str[len-1-i] != c[index])
state_m = 0;
if (str[i] != str[len-i-1])
state_p = 0;
}
printf("%s", str);
if (state_m && state_p)
printf(" -- is a mirrored palindrome.\n\n");
else if(state_m)
printf(" -- is a mirrored string.\n\n");
else if(state_p)
printf(" -- is a regular palindrome.\n\n");
else
printf(" -- is not a palindrome.\n\n");
}
return 0;
}