uva 401(字符串)
来源:互联网 发布:13种网络钓鱼诈骗类型 编辑:程序博客网 时间:2024/05/22 10:57
题目:
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.
N
Z5C
OO11D
P
2SE3Q
3EF
R
4
G
S25ZHHTT6
IIUU7
JLVV88K
WW9
LJXX
Note that O (zero) and 0 (the letter) are considered the same character and thereforeONLY 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
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.
题解:回文是对称相同,镜像是上边的表格,4种不同的情况输出不同的后缀语句,输出每行后有空行。注意0和O等价。
#include <iostream>#include <cstdio>#include <string>#include <cstring>int main() {char rev[35] = {'A',' ',' ',' ','3',' ',' ','H','I','L',' ','J','M',' ','O',' ',' ',' ','2','T','U','V','W','X','Y','5','1','S','E',' ','Z',' ',' ','8',' '};char que[25];int flag1, flag2;while (~scanf("%s", que)){getchar();flag1 = 0;flag2 = 0;int i, j;int length = strlen(que);for (i = 0, j = length - 1; i < length / 2; i++, j--){if (que[i] == que[j])flag1++;if (que[i] >= 'A' && que[i] <= 'Z'){int a = que[i] - 'A';if (rev[a] == que[j])flag2++;}if (que[i] >= '1' && que[i] <= '9'){int b = que[i] - '1' + 26;if (rev[b] == que[j])flag2++;} if ((que[i] == '0' && que[j] == 'O') || (que[i] == 'O' && que[j] == '0')){ flag1++; flag2++; } if(que[i] == '0' && que[j] == '0') flag2++;}if (length % 2 != 0){int c = que[length / 2] - 'A';if (rev[c] == que[length / 2 ] || que[length / 2 ] == '1' || que[length / 2 ] == '8' || que[length / 2 ] == '0')flag2++;flag1++;if (length / 2 + 1 == flag1 && flag1 == flag2)printf("%s -- is a mirrored palindrome.\n\n", que);else if (flag2 == length / 2 + 1 )printf("%s -- is a mirrored string.\n\n", que);else if (flag1 == length / 2 + 1)printf("%s -- is a regular palindrome.\n\n", que);elseprintf("%s -- is not a palindrome.\n\n", que);}if (length % 2 == 0){if (length / 2 == flag1 && flag1 == flag2)printf("%s -- is a mirrored palindrome.\n\n", que);else if (flag2 == length / 2)printf("%s -- is a mirrored string.\n\n", que);else if (flag1 == length / 2)printf("%s -- is a regular palindrome.\n\n", que);elseprintf("%s -- is not a palindrome.\n\n", que);}}return 0;}
- uva 401 Palindromes //字符串
- UVA 401 Palindromes 字符串
- uva 401(字符串)
- uva 401 字符串
- UVA 401 - Palindromes(字符串)
- UVa OJ 401回文字符串
- UVa 401 Palindromes (字符串匹配)
- Palindromes - UVa 401 字符串处理
- UVa 401 Palindromes(字符串,回文)
- uva 401 Palindromes(字符串处理)
- uva 401 Palindromes(基本的字符串处理)
- UVA 401(palindorme)简单字符串处理
- uva 401 Palindromes(字符串回文处理)
- UVA 401 (暑假-字符串(1) -A - Palindromes)
- UVa 401 Palindromes(镜像回文字符串)
- 字符串训练 ------- UVA 题目401 - Palindromes
- UVa 401 Palindromes(简单字符串)
- 刘汝佳uva 字符串专题
- Android开发者必备的十大开发工具
- OCP 1Z0 053 117
- struts乱码问题
- 直方图结构体:CvHistogram
- 数据结构-递归遍历二叉树
- uva 401(字符串)
- mysql给root开启远程访问权限,修改root密码
- 外观模式 VS 中介者模式
- 第十九周周报
- 套接字选项getsockopt() 和 setsockopt()
- PHP使用P3P完成COOKIE跨域操作
- POJ 3484 Showstopper 二分
- camera
- 2014-7-8