UVA 401
2015-07-20 20:33
274 查看
Description
A regular palindrome is a string of numbers or letters that is the same forward as backward. For example, the string
"ABCDEDCBA" is a palindrome 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.
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.
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
Sample Output
Hint
use the C++'s class of string will be convenient, but not a must
题义
判断是否回文和镜像字符串
代码
A regular palindrome is a string of numbers or letters that is the same forward as backward. For example, the string
"ABCDEDCBA" is a palindrome 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 |
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 |
-'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.
Hint
use the C++'s class of string will be convenient, but not a must
题义
判断是否回文和镜像字符串
代码
#include<stdio.h> #include<string.h> char CH[] = {'A', ' ', ' ', ' ', '3', ' ', ' ', 'H', 'I', 'L', ' ', 'J', 'M', ' ', 'O', ' ', ' ', ' ', '2', 'T', 'U', 'V', 'W', 'X', 'Y', '5'}; char Num[] = {'1','S','E',' ','Z',' ',' ','8',' '}; ; int palin (char *str) { int i=0,j; int l = strlen(str); for (j = 0; j< l/2; j++) { if((str[j] == '0' && str[l-1-j] == 'O') || (str[j] == 'O' && str[l-1-j] == '0')) continue; if (str[j] != str[l-1-j]) break; } if (j == l/2) return 1; else return 0; } int mirror (char *str) { char str2[21]; int i,j,k; int l = strlen(str); for(i = 0,j = l-1;i < l;i++,j--){ if(str[i] >= 'A' && str[i] <= 'Z'){ k = str[i] - 'A'; str2[i] = CH[k]; } else{ k = str[i] - '1'; str2[i] = Num[k]; } if((str2[i] == '0' && str[j] == 'O') || (str2[i] == 'O' && str[j] == '0')){ continue; } if(str2[i] != str[j]){ return 0; } } return 1; } int main() { char str[20]; while (scanf("%s",&str) != EOF) { if (mirror(str) == 1 && palin(str) == 1) printf("%s -- is a mirrored palindrome.\n\n",str); if(mirror(str) == 1 && palin(str) != 1) printf("%s -- is a mirrored string.\n\n",str); if (mirror(str) != 1 && palin(str) == 1) printf("%s -- is a regular palindrome.\n\n",str); if (mirror(str) != 1 && palin(str) != 1) printf("%s -- is not a palindrome.\n\n",str); } return 0; }
相关文章推荐
- 欢迎使用CSDN-markdown编辑器
- 利用inotify+rsync实现linux文件批量更新
- c++string
- 黄金当真只是魔鬼的粪便?钻石星球亮瞎你的眼
- Remove Duplicates from Sorted Array
- (网络视频监控)面试题12
- 遍历二叉树
- POJ1107
- android学习路线
- (数字电视机顶盒)笔试题
- webstorm 快捷键持续更新中...
- java继承分析
- poj 3660 Cow Contest
- 3D数学 矩阵和线性变换之正交投影
- HDU3285——5285dfs——wyh2000 and pupil
- Android疑惑篇------------含有button按钮的ListView中,列表项无法获取焦点的问题
- 假定某系统提供硬件的访管指令(例如形式:“svc n”),为了实现系统调用,系统设计者应做哪些工作?用户又如如何请求操作系统服务?
- HDU 1260
- hdu 5281 Senior's Gun(贪心)
- Kettle Excel To JSON