HDU 2029 Palindromes _easy version
2014-07-25 19:33
495 查看
Palindromes _easy version
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 21147 Accepted Submission(s): 13191
Problem Description
“回文串”是一个正读和反读都一样的字符串,比如“level”或者“noon”等等就是回文串。请写一个程序判断读入的字符串是否是“回文”。
Input
输入包含多个测试实例,输入数据的第一行是一个正整数n,表示测试实例的个数,后面紧跟着是n个字符串。
Output
如果一个字符串是回文串,则输出"yes",否则输出"no".
Sample Input
4 level abcde noon haha
Sample Output
yes no yes no
Author
lcy
Source
C语言程序设计练习(五)
Recommend
lcy | We have carefully selected several similar problems for you: 1040 1076 2501 1106 2123
Statistic | Submit | Discuss | Note
#include<iostream> #include<stdio.h> #include<string.h> using namespace std; int main() { int n; char a[1000]; while(cin>>n) { getchar(); for(int i=1;i<=n;i++) { gets(a); int t=0; for(int j=0;j<strlen(a);j++) { if(a[j]==a[strlen(a)-1-j]) t++; } if(t==strlen(a)) {cout<<"yes"<<endl;} else {cout<<"no"<<endl;} } } return 0; }
相关文章推荐
- hdu 2029 Palindromes _easy version(回文串)
- <HDU 2029> Palindromes _easy version
- HDU 2029 Palindromes _easy version
- HDU 2029 Palindromes _easy version
- HDU-2029 Palindromes _easy version
- [hdu 2029] Palindromes _easy version
- hdu 2029 Palindromes _easy version (java)
- HDU 2029 Palindromes _easy version
- Hdu 2029 Palindromes _easy version
- hdu 2029 Palindromes _easy version
- HDU 2029 Palindromes _easy version(字符串)
- HDU 2029 -- Palindromes _easy version
- hdu_2029_Palindromes _easy version
- hdu 2029 Palindromes _easy version
- HDU——2029 —— Palindromes _easy version
- hdu 2029 Palindromes _easy version
- hdu 2029 Palindromes _easy version
- hdu 2029 Palindromes _easy version(库函数 strrev)(备战LQB)
- HDU 2029 Palindromes _easy version
- HDU 2029 Palindromes _easy version(水~)