UVa OJ 回文词(401)
2012-04-13 17:36
363 查看
Palindromes |
"ABCDEDCBA" is apalindrome 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 |
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.
#include <stdio.h>
#include <stdlib.h>
#include<string.h>
char reback(char ch);
int ispa(char s[],int len);
int ismi(char s[],int len);
int main()
{
char s[1000];
int len;
while(scanf("%s",s)!=EOF)
{
len=strlen(s);
if(len==1)
{
if(s[0]!=reback(s[0]))
printf("%s -- is a regular palindrome.\n\n",s);
else printf("%s -- is a mirrored palindrome.\n\n",s);
}
else if(ispa(s,len)&&ismi(s,len))
{
printf("%s -- is a mirrored palindrome.\n\n",s);
}
else if(ispa(s,len))
{
printf("%s -- is a regular palindrome.\n\n",s);
}
else if(ismi(s,len))
{
printf("%s -- is a mirrored string.\n\n",s);
}
else
{
printf("%s -- is not a palindrome.\n\n",s);
}
}
return 0;
}
char reback(char ch)
{
switch(ch)
{
case 'A':return 'A';
case 'E':return '3';
case 'H':return 'H';
case 'I':return 'I';
case 'J':return 'L';
case 'L':return 'J';
case 'M':return 'M';
case 'O':return 'O';
case 'S':return '2';
case 'T':return 'T';
case 'U':return 'U';
case 'V':return 'V';
case 'W':return 'W';
case 'X':return 'X';
case 'Y':return 'Y';
case 'Z':return '5';
case '1':return '1';
case '2':return 'S';
case '3':return 'E';
case '5':return 'Z';
case '8':return '8';
default:return ' ';
}
}
int ispa(char s[],int len)
{
int i;
for(i=0;i<len/2;i++)
{
if(s[i]!=s[len-1-i])return 0;
}
return 1;
}
int ismi(char s[],int len)
{
int i;
for(i=0;i<len/2;i++)
{
if(reback(s[i])!=s[len-1-i])return 0;
}
return 1;
}
相关文章推荐
- uva 401(回文词)
- UVa 401 回文词
- UVA 题目401 - Palindromes(回文词)
- UVA 401 Palindromes 回文词
- 回文词(UVa401)
- UVa 401 Palindromes(回文词)
- UVa 401 Palindromes 回文词
- 回文词(Uva 401)
- UVa 401 回文词(Palindromes)
- UVA 401 Palindromes 回文词
- uva 401 Palindromes(字符串回文处理)
- 例题3_3 回文词(UVa401)
- 回文词 UVA401 面对多种文字输出的技巧
- UVa401-Palindromes-回文词-字符函数,常量数组
- uva oj 401
- uva 401(Palindromes)(回文字符串)
- 例题3-3 回文词 UVa401
- UVa 401 Palindromes(镜像回文字符串)
- UVa 401 Palindromes(字符串,回文)
- UVa401 回文词