Uva401Palindromes
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的更多相关文章
- [算法练习] UVA-401-Palindromes
UVA Online Judge 题目401 Palindromes 回文串 问题描述: 回文串(Palindromes)就是正着读和反着读完全一样的字符串,例如"ABCDEDCBA&qu ...
- UVa-401-Palindromes(回文)
这一题的话我们可以把映像字符的内容给放入一个字符串常量里面,然后开辟一个二维的字符串常量数组,里面放置答案. 对于回文实际上是很好求的,对于镜像的话,我们写一个返回char的函数,让它接收一个char ...
- UVA401-Palindromes(紫书例题3.3)
A regular palindrome is a string of numbers or letters that is the same forward as backward. For exa ...
随机推荐
- Git的一些实用操作
Ref:http://stackoverflow.com/questions/17195861/undo-git-update-index-assume-unchanged-file 1. 添加本地忽 ...
- Java使用JDBC连接MySQL数据库
1.引用 JDBC(Java Data Base Connectivity,java数据库连接)是一种用于执行SQL语句的Java API,可以为多种关系数据库提供统一访问,它由一组用Java语言编写 ...
- NYOJ题目893十字架
aaarticlea/png;base64,iVBORw0KGgoAAAANSUhEUgAAAsYAAAQRCAIAAACl4dlPAAAgAElEQVR4nO3dO1Ljyv834P8myFkIsR
- php 会话控制
会话控制 HTTP协议,在TCP协议基础上的HTTP协议称为无状态协议 SESSION COOKIE SESSION特点:1.存储在服务器.2.每个使用者都会生成一个SESSION.3.有默认的过期时 ...
- yum install 安装 下载好的rpm包 会并依赖包一起安装 zoom电话会议的安装
[root@ok-T Downloads]# rpm -ivh zoom_x86_64.rpm error: Failed dependencies: libxcb-image.so.()(64bit ...
- 《CLR via C#》读书笔记(1)CLR执行模型
1.1 释义 CLR 公共语音运行时 Common Language Runtime CTS 通用类型系统 Common Type System CTS.CLS是CLR的核心 CLS 通用语言规范 C ...
- 解析PHP处理换行符的问题 \r\n
一首先说说 \r 与\n的区别回车”(Carriage Return)和“换行”(Line Feed)这两个概念的来历和区别.在计算机还没有出现之前,有一种叫做电传打字机(Teletype Model ...
- JavaScript中判断对象类型方法大全2
在JavaScript中,有5种基本数据类型和1种复杂数据类型,基本数据类型有:Undefined, Null, Boolean, Number和String:复杂数据类型是Object,Object ...
- Tkprof工具详解一
注明:一些文章是从别人的博客中转载过来的,方便自己以后查阅:在数据库生成的oracle trace文件中,可读性是比较差的,此时可使用tkprof工具来格式化trace文件,tkprof是一个命令 ...
- [LeetCode] Happy Number
Happy Number Total Accepted: 35195 Total Submissions: 106936 Difficulty: Easy Write an algorithm to ...