程序師世界是廣大編程愛好者互助、分享、學習的平台,程序師世界有你更精彩!
首頁
編程語言
C語言|JAVA編程
Python編程
網頁編程
ASP編程|PHP編程
JSP編程
數據庫知識
MYSQL數據庫|SqlServer數據庫
Oracle數據庫|DB2數據庫
 程式師世界 >> 編程語言 >> C語言 >> C++ >> C++入門知識 >> UVA 之401 - Palindromes

UVA 之401 - Palindromes

編輯:C++入門知識

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.

【注意】:

題目意思:

判斷輸入的字符串是否是回文串還是鏡面字符串。

回文串:從左到右讀和從右到左讀是一樣的。

鏡面字符串:如果某個字符有鏡面字符,轉換為相應的鏡面字符。轉換後從左到右讀和從右到左讀是一樣的。

數字0和字母O是等價的。

【代碼】:

[cpp] view plaincopy
  1. /*********************************
  2. * 日期:2013-4-22
  3. * 作者:SJF0115
  4. * 題號: 題目401 - Palindromes
  5. * 來源:http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=6&page=show_problem&problem=342
  6. * 結果:AC
  7. * 來源:UVA
  8. * 總結:
  9. **********************************/
  10. #include
  11. #include
  12. char MirroredStr[] = {'A',' ',' ',' ','3',' ',' ','H',
  13. 'I','L',' ','J','M',' ','O',' ',' ',' ','2','T','U','V','W','X','Y','5'};
  14. char MirroredNum[] = {'1','S','E',' ','Z',' ',' ','8',' '};
  15. //判斷是否是回文
  16. int IsPalindromes(char Str[]){
  17. int i,j;
  18. for(i = 0,j = strlen(Str)-1;i < j;i++,j--){
  19. //0 和 O等價
  20. if((Str[i] == '0' && Str[j] == 'O') || (Str[i] == 'O' && Str[j] == '0')){
  21. continue;
  22. }
  23. if(Str[i] != Str[j]){
  24. return 0;
  25. }
  26. }
  27. return 1;
  28. }
  29. //判斷是否是鏡像字符串
  30. int IsMirrored(char Str[]){
  31. char temp[21];
  32. int i,j,index;
  33. int len = strlen(Str);
  34. for(i = 0,j = len-1;i < len;i++,j--){
  35. if(Str[i] >= 'A' && Str[i] <= 'Z'){
  36. index = Str[i] - 'A';
  37. temp[i] = MirroredStr[index];
  38. }
  39. else{
  40. index = Str[i] - '1';
  41. temp[i] = MirroredNum[index];
  42. }
  43. //0 和 O等價
  44. if((temp[i] == '0' && Str[j] == 'O') || (temp[i] == 'O' && Str[j] == '0')){
  45. continue;
  46. }
  47. if(temp[i] != Str[j]){
  48. return 0;
  49. }
  50. }
  51. return 1;
  52. }
  53. int main (){
  54. char Str[21];
  55. int i,len,IsP,IsM;
  56. //freopen("C:\\Users\\XIAOSI\\Desktop\\acm.txt","r",stdin);
  57. while(scanf("%s",Str) != EOF){
  58. len = strlen(Str);
  59. printf("%s -- ",Str);
  60. //回文字符串
  61. IsP = IsPalindromes(Str);
  62. //鏡面字符串
  63. IsM = IsMirrored(Str);
  64. //輸出
  65. if(IsP == 0 && IsM == 0){
  66. printf("is not a palindrome.\n");
  67. }
  68. else if(IsP == 1 && IsM == 1){
  69. printf("is a mirrored palindrome.\n");
  70. }
  71. else if(IsP == 1 && IsM == 0){
  72. printf("is a regular palindrome.\n");
  73. }
  74. else if(IsP == 0 && IsM == 1){
  75. printf("is a mirrored string.\n");
  76. }
  77. printf("\n");
  78. }
  79. return 0;
  80. }
  1. 上一頁:
  2. 下一頁:
Copyright © 程式師世界 All Rights Reserved