HDU 1544 Palindromes(判断是否为回文序列和镜像序列)
2014-08-04 15:43
423 查看
Palindromes
Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld
& %llu
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。
题目大意:
判断字符串是回文串还是反射串。
解题思路:
利用map。
代码:
Time Limit:3000MS Memory Limit:0KB 64bit IO Format:%lld
& %llu
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.
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 |
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 |
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。
题目大意:
判断字符串是回文串还是反射串。
解题思路:
利用map。
代码:
#include<iostream> #include<string> #include<cstdio> #include<map> using namespace std; map <char,char>mp; string str; void initial(){ mp['A']='A';mp['B']=' ';mp['C']=' ';mp['D']=' ';mp['E']='3';mp['F']=' ';mp['G']=' '; mp['H']='H';mp['I']='I';mp['J']='L';mp['K']=' ';mp['L']='J';mp['M']='M';mp['N']=' '; mp['O']='O';mp['P']=' ';mp['Q']=' ';mp['R']=' ';mp['S']='2';mp['T']='T';mp['U']='U'; mp['V']='V';mp['W']='W';mp['X']='X';mp['Y']='Y';mp['Z']='5';mp['1']='1';mp['2']='S'; mp['3']='E';mp['4']=' ';mp['5']='Z';mp['6']=' ';mp['7']=' ';mp['8']='8';mp['9']=' '; } void solve(){ int flag1=0,flag2=0; for(int i=0;i<=(str.length()+1)/2;i++){ if(str[i]==str[str.length()-i-1]){ flag1=1; } else if((str[i]=='O'||str[i]=='0')&&(str[str.length()-i-1]=='O'||str[str.length()-i-1]=='0')) flag1=1; else { flag1=0; break; } } for(int i=0;i<=(str.length()+1)/2;i++){ if(mp[str[i]]==str[str.length()-i-1]){ flag2=1; } else if((str[i]=='O'||str[i]=='0')&&(str[str.length()-i-1]=='O'||str[str.length()-i-1]=='0')) flag2=1; else { flag2=0; break; } } if(flag1!=1&&flag2!=1) cout<<str<<" -- is not a palindrome."<<endl<<endl; if(flag1==1&&flag2!=1) cout<<str<<" -- is a regular palindrome."<<endl<<endl; if(flag2==1&&flag1!=1) cout<<str<<" -- is a mirrored string."<<endl<<endl; if(flag1==1&&flag2==1) cout<<str<<" -- is a mirrored palindrome."<<endl<<endl; } int main(){ initial(); while(cin>>str){ solve(); } return 0; }
相关文章推荐
- 判断一个字符串是否能够通过添加一个字符变成回文序列的方法
- 【Leetcode】234. Palindrome Linked List -判断链表是否为回文序列
- HDU 1022 Train Problem I(判断出栈序列是否可行)
- 判断字符序列是否为回文
- HDU 1544Palindromes(求回文字符串)
- 编写判断一个字符序列是否为回文。回文是指一个字符序列以中间 字符为基准两边字符完全相同,即顺着看和倒着看是相同的字符序列。
- (hdu step 8.1.2)Train Problem I(站的基本应用——判断一个序列经过栈后是否能够得到第二个序列)
- HDOJ 2029 Palindromes _easy version 判断是否是回文
- 判断一个字符串是否为回文串和镜像串(Palindromes)
- HDU 5146 Sequence 判断序列不是回文 且奇数与偶数位的和不同
- 判断是否是简单密码,不能包含相同的字符(如aaa,111),递增序列(abc,123),递减序列(cda,321)
- 笔试面试之判断序列是否2叉查找树后序遍历
- 用栈和队列判断输入字符串是否是回文(回文具有两边对称的性质)
- hdu 3896 Greatest TC 判断从a到b是否必须经过某点或某边
- 谈谈如何判断一个Pop序列是否是一个Push序列的Pop顺序
- 每天一道算法题1 判断字符串是否是回文字符串或者是否含有回文字符子串
- 判断一个数是否是回文
- 判断一个数字是否是回文
- hdu 1086 判断两线段是否相交 (线段和直接是否相交)
- Train Problem——判断输出序列是否是输入序列的出栈顺序