UVA 401 - Palindromes(字符串)
来源:互联网 发布:java 高性能框架 编辑:程序博客网 时间:2024/05/22 08:26
Palindromes
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
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 Revilla 2001-04-16
=================================
分别判断一下回文字符串和镜像字符串就行了
#include <iostream>#include <cstring>using namespace std;char let[30]={"A 3 HIL JM O 2TUVWXY5"};char num[10]={"1SE Z 8 "};char str[22];int main(){ while(cin>>str) { int pal=1,mir=1; int len=strlen(str); for(int i=0;i<=len/2;i++) { if(str[i]!=str[len-1-i]) { pal=0; break; } } for(int i=0;i<=len/2;i++) { if(str[i]>='A'&&str[i]<='Z') { if(let[str[i]-'A']!=str[len-1-i]) { mir=0; break; } } else { if(num[str[i]-'1']!=str[len-1-i]) { mir=0; break; } } } cout<<str; if(!pal&&!mir) cout<<" -- is not a palindrome."<<endl; if(pal&&!mir) cout<<" -- is a regular palindrome."<<endl; if(!pal&&mir) cout<<" -- is a mirrored string."<<endl; if(pal&&mir) cout<<" -- is a mirrored palindrome."<<endl; cout<<endl; } return 0;}
- UVA 401 - Palindromes(字符串)
- uva 401 Palindromes //字符串
- UVA 401 Palindromes 字符串
- uva 401 Palindromes(字符串处理)
- uva 401 Palindromes(字符串回文处理)
- UVa 401 Palindromes(简单字符串)
- UVa 401 Palindromes (字符串匹配)
- Palindromes - UVa 401 字符串处理
- UVa 401 Palindromes(字符串,回文)
- uva 401 Palindromes(基本的字符串处理)
- UVA 401 (暑假-字符串(1) -A - Palindromes)
- UVa 401 Palindromes(镜像回文字符串)
- 字符串训练 ------- UVA 题目401 - Palindromes
- UVa 401 Palindromes(回文词)
- UVA 401-- Palindromes(串处理)
- UVA - 401 Palindromes (回文串)
- 回文词(Palindromes, UVa 401)
- UVa 401 回文词(Palindromes)
- 在线HTML编辑器在IE下的奇怪现象
- C++---如何在类中声明一个常量?
- 最火的Android开源项目(二)
- hdu 4550 卡片游戏
- dynamic解析Http xml格式响应数据
- UVA 401 - Palindromes(字符串)
- 背包问题系列详解
- 7月23日
- hdu1864
- get请求表单的action属性后不能带参数
- 多校联合练习赛1 problem1009 I-number 信心题啊。。。
- 定时/计数器用于外部中断扩展的原理
- 关于JSONArray的使用
- 使用电话线,猫,路由器上网方法