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 <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int namx = ; bool is_mirrored(char a, char b)
{
if((a == 'E' && b == '') || (a == '' && b == 'E'))
return true;
else if((a == 'L' && b == 'J') || (a == 'J' && b == 'L'))
return true;
else if((a == 'S' && b == '') || (a == '' && b == 'S'))
return true;
else if((a == 'Z' && b == '') || (a == '' && b == 'Z'))
return true;
else if(a == b)
{
if(a == 'A' || a == 'H' || a == 'I' || a == 'M' || a == 'O'
|| a == 'T' || a == 'U' || a == 'V' || a == 'W' || a == 'X'
|| a == 'Y' || a == '' || a == '')
{
return true;
}
}
else
return false;
} int main()
{
char str[namx]; while(scanf("%s%*c", str) != EOF)
{
int len = strlen(str);
//printf("%d\n", len);
bool mark = true;
bool tag = true;
for(int i = ; i <= len / ; ++i)
{
if(str[i] != str[len-i-])
{
mark = false;
//printf("%c == %c %d\n", str[i], str[len-i-1], len-i-1);
break;
}
} for(int i = ; i <= len / ; ++i)
{
if(!is_mirrored(str[i], str[len-i-]))
{
tag = false;
//printf("%c == %c %d\n", str[i], str[len-i-1], len-i-1);
break;
}
}
if(mark == false && tag == false)
printf("%s -- is not a palindrome.\n", str); else if(mark == false && tag == true)
printf("%s -- is a mirrored string.\n", str); else if(mark == true && tag == false)
printf("%s -- is a regular palindrome.\n", str); else
printf("%s -- is a mirrored palindrome.\n", str);
printf("\n"); }
return ;
}

一个空格, PE一晚上,淡定淡定,不要太大压力

在14/11/2队内赛时的代码

 #include <iostream>
#include <cstdio>
#include <cstring> using namespace std;
const int MAXN = ;
char str[MAXN]; bool CharTest(char c)
{
if(c == 'A' || c == 'H' || c == 'I' || c == 'M' || c == 'O' || c == 'T' || c == 'U'
|| c == 'V' || c == 'W' || c == 'X' || c == 'Y' || c == '' || c == '')
{
return true;
}
return false;
} bool StrTest(char *s)
{
int sum = ;
int len = strlen(s);
for(int i = ; i < len; ++i)
{
sum += (CharTest(s[i]) == true) ? : ;
}
if(sum == len)
return true;
return false;
} char transfer(char s)
{
if(s == '')
return 'E';
else if(s == 'J')
return 'L';
else if(s == '')
return 'S';
else if(s == '')
return 'Z';
} int test(char *s, int len)
{
int sum = ;
for(int i = ; i < len/; ++i)
{
if(str[i] == str[len-i-])
{
sum++;
}
}
return sum;
} int main()
{
while(scanf("%s", str) != EOF)
{
int len = strlen(str); if(test(str, len) == len/)
{
if(StrTest(str))
{
printf("%s -- is a mirrored palindrome.\n\n", str);
}
else
{
printf("%s -- is a regular palindrome.\n\n", str);
}
}
else
{
char s1[];
for(int i = ; i < len; ++i)
{
s1[i] = str[i];
}
s1[len] = '\0';
for(int i = ; i < len; ++i)
{
if(str[i] == '' || str[i] == 'J' || str[i] == '' || str[i] == '')
{
str[i] = transfer(str[i]);
}
} if(test(str, len) == len/)
{
printf("%s -- is a mirrored string.\n\n", s1);
}
else
{
printf("%s -- is not a palindrome.\n\n", s1);
}
} }
return ;
}

Uva401Palindromes的更多相关文章

  1. [算法练习] UVA-401-Palindromes

    UVA Online Judge 题目401  Palindromes 回文串 问题描述: 回文串(Palindromes)就是正着读和反着读完全一样的字符串,例如"ABCDEDCBA&qu ...

  2. UVa-401-Palindromes(回文)

    这一题的话我们可以把映像字符的内容给放入一个字符串常量里面,然后开辟一个二维的字符串常量数组,里面放置答案. 对于回文实际上是很好求的,对于镜像的话,我们写一个返回char的函数,让它接收一个char ...

  3. UVA401-Palindromes(紫书例题3.3)

    A regular palindrome is a string of numbers or letters that is the same forward as backward. For exa ...

随机推荐

  1. Java动态代理一Proxy

    什么是动态代理? 动态代理可以提供对另一个对象的访问,同时隐藏实际对象的具体事实.代理一般会实现它所表示的实际对象的接口.代理可以访问实际对象,但是延迟实现实际对象的部分功能,实际对象实现系统的实际功 ...

  2. hadoop 2.5 hdfs namenode –format 出错Usage: java NameNode [-backup] |

    在 cd  /home/hadoop/hadoop-2.5.2/bin 下 执行的./hdfs namenode -format 报错[hadoop@node1 bin]$ ./hdfs nameno ...

  3. LR性能指标分析

    Memory: ·Available Mbytes 简述:可用物理内存数.如果Available Mbytes的值很小(4 MB或更小),则说明计算机上总的内存可能不足,或某程序没有释放内存. 参考值 ...

  4. js 闭包原理理解

    问题?什么是js(JavaScript)的闭包原理,有什么作用? 一.定义 官方解释:闭包是一个拥有许多变量和绑定了这些变量的环境的表达式(通常是一个函数),因而这些变量也是该表达式的一部分. 很显然 ...

  5. Spring+Maven+Dubbo+MyBatis+Linner+Handlebars—Web开发环境搭建

    本文主要分三部分,分别是:后台核心业务逻辑.桥梁辅助控制和前台显示页面. 本Web开发环境综合了多种工具,包括Maven包管理与编译工具.Dubbo分布式服务框架.MyBatis数据持久化工具.Lin ...

  6. JS中级 - 03:文档宽高及窗口事件(选)

    可视区尺寸 document.documentElement.clientWidth document.documentElement.clientHeight 滚动距离 document.body. ...

  7. linux清除当前屏幕

    linux清除当前屏幕:直接clear命令即可 而在windows下的话用cls命令

  8. Android消息推送怎么实现?

    在开发Android和iPhone应用程序时,我们往往需要从服务器不定的向手机客户端即时推送各种通知消息,iPhone上已经有了比较简单的和完美的推送通知解决方案,可是Android平台上实现起来却相 ...

  9. siblings 使用

    //$(object).siblings().each(function () { // $(this).find("img").attr("class", & ...

  10. xml解析方法总结

    ==========================================xml文件<?xml version=”1.0″ encoding=”GB2312″?> <RES ...