uva 401 Palindromes //字符串
来源:互联网 发布:树莓派3 ubuntu mate 编辑:程序博客网 时间:2024/05/05 19:02
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.
//题目不是很难,在国内的OJ中应该算是比较复杂的字符串问题了,LRJ童鞋选的题还是挺好的
//不太了解UvaOJ的特性,所以一直在CE,后来换成了C++的编译就AC了 汗。。。ANSI C还是不选为妙。。
//还有就是一个比较绕的问题就是单个字母输入后的问题。一开始卡在那儿了。
#include<stdio.h>#include<string.h>const char one[]="ABCDEFGHIJKLMNOPQRSTUVWXYZ123456789";const char two[]="A 3 HIL JM O 2TUVWXY51SE Z 8 ";const long len=35;bool Palindrome(const char *s){ long begin=0,end=strlen(s)-1; while(begin<=end) { if(s[begin]==s[end]) { begin++; end--; } else return false; } return true;}long pos(char ch){ for(long i=0;i<len;i++) if(one[i]==ch) return i; return len;}bool Mirror(const char *s){ long begin=0,end=strlen(s)-1; while(begin<=end) { long tmp=pos(s[begin]); if(s[end]==two[tmp]) { begin++; end--; } else return false; } return true;}int main(){ char str[1000]; while(gets(str)!=0) { bool a=false,b=false; a=Palindrome(str); b=Mirror(str); if(a&&b) printf("%s -- is a mirrored palindrome.\n",str); else if(a) printf("%s -- is a regular palindrome.\n",str); else if(b) printf("%s -- is a mirrored string.\n",str); else printf("%s -- is not a palindrome.\n",str); putchar('\n'); }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
- C#progressBar控件
- C#Timer控件使用
- C#列举结束进程
- C# winform中ListView用法
- What is the difference between DHTML and the DOM?
- uva 401 Palindromes //字符串
- C#实现Cmd命令
- css特效
- provider: 命名管道提供程序, error: 40 - 无法打开到 SQL
- C#实现自启动及带附件形式的邮件发送
- c#关闭特定程序
- C#实现屏幕实时监控
- shell编程之基础
- C#发邮件与收邮件