UVa 401 Palindromes (字符串匹配)
来源:互联网 发布:电路图设计软件 编辑:程序博客网 时间:2024/05/21 14:27
401 - Palindromes
Time limit: 3.000 seconds
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=96&page=show_problem&problem=342
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.
完整代码:
/*0.015s*/#include<cstdio>#include<cstring>const char s1[25] = "AEHIJLMOSTUVWXYZ123458";const char s2[25] = "A3HILJMO2TUVWXY51SE4Z8";char s[25];inline bool palin(){int len = strlen(s);for (int i = 0; i < (len >> 1); ++i)if (s[i] != s[len - 1 - i]) return false;return true;}inline bool mirr(){int len = strlen(s);for (int i = 0; i <= (len >> 1); ++i)if (!strchr(s1, s[i]) || s[len - i - 1] != s2[strchr(s1, s[i]) - s1]) return false; ///前一个判断说明s根本"没机会"成为镜像字符串,后一个判断说明s[i]对称的位置s[len-i-1]不是s[i]的镜像字符return true;}int main(void){while (gets(s)){if (palin() && mirr())printf("%s -- is a mirrored palindrome.\n\n", s);else if (palin() && !mirr())printf("%s -- is a regular palindrome.\n\n", s);else if (!palin() && mirr())printf("%s -- is a mirrored string.\n\n", s);else //if (!palin(s) && !mirr(s))printf("%s -- is not a palindrome.\n\n", s);}return 0;}
- UVa 401 Palindromes (字符串匹配)
- uva 401 Palindromes //字符串
- UVA 401 Palindromes 字符串
- UVA 401 - Palindromes(字符串)
- Palindromes - UVa 401 字符串处理
- UVa 401 Palindromes(字符串,回文)
- uva 401 Palindromes(字符串处理)
- uva 401 Palindromes(基本的字符串处理)
- uva 401 Palindromes(字符串回文处理)
- UVA 401 (暑假-字符串(1) -A - Palindromes)
- UVa 401 Palindromes(镜像回文字符串)
- 字符串训练 ------- UVA 题目401 - Palindromes
- UVa 401 Palindromes(简单字符串)
- UVa 401 Palindromes
- UVa OJ 401-Palindromes
- UVa:401 - Palindromes
- uva 401 - Palindromes
- UVa 401 - Palindromes
- 【国庆节来临】送礼首选醉香芦
- Android Parcelable
- 模拟菜单
- 【书籍推荐】UNIX编程艺术 The Art of UNIX Programming
- POJ3650纯备忘
- UVa 401 Palindromes (字符串匹配)
- 获取图片缩略图和视频缩略图
- linux查找目录下的所有文件中是否含有某个字符串
- Core Animation学习之anchorPoint
- 用C语言给指定的内存地址赋值(通过指针)
- java大数
- Linux设备模型之platform总线
- java类反射机制
- TCP协议三次握手过程分析