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 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 |
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 Revilla 2001-04-16
回文字符串判别的加强版 对给出的字符串既要判断是否为回文,还要判断是否镜像 回文很好判断,就是把给定的字符串正序与逆序匹配,匹配成功则为回文,否则不是 对于镜像判别,要根据给出的条件,对字符串进行处理,之后再将原字符串正序与现字符串逆序进行匹配即可 代码如下:
#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <vector>
#include <map>
#define MAXN 100
#define INF 0x7FFFFFFF
#define ll long long
using namespace std;
string copy1 = ("ABCDEFGHIJKLMNOPQRSTUVWXYZ123456789");
string copy2 = ("A---3--HIL-JM-O---2TUVWXY51SE-Z--8-");
//判断回文
int palindrome(string str){
for(int i=0; i<str.size()/2; ++i){
if(str[i] != str[str.size()-i-1])
return 0;
}
return 1;
}
//判断镜像
int mirrored(string str1){
string str2 = str1;
for(int i=0; i<str1.size(); ++i){
for(int j=0; j<copy1.size(); ++j){
if(str1[i] == copy1[j]){
str2[str2.size()-i-1] = copy2[j];
}
}
}
if(str1 == str2)
return 1;
return 0;
}
int main(void){
string str;
while((cin >> str)){
cout << str << " -- ";
if(palindrome(str)){
if(mirrored(str))
cout << "is a mirrored palindrome." << endl;
else cout << "is a regular palindrome." << endl;
}
else{
if(mirrored(str))
cout << "is a mirrored string." << endl;
else cout << "is not a palindrome." << endl;
}
cout << endl;
}
return 0;
}