杭电ACM 2029 Palindromes _easy version
2012-08-03 10:36
459 查看
http://acm.hdu.edu.cn/showproblem.php?pid=2029
#include<stdio.h> #include<stdlib.h> #include<string.h> int main(){ int n,cont; char ch1[100]; char ch2[100]; scanf("%d",&n); while(n--){ cont=0; scanf("%s",ch1); int len=strlen(ch1); for(int i=len-1;i>=0;i--) ch2[len-1-i]=ch1[i]; for(int i=0;i<len;i++) if(ch1[i]==ch2[i]) cont++; else break; if(cont==len) printf("yes\n"); else printf("no\n"); } }
相关文章推荐
- 杭电 acm 2029 Palindromes _easy version
- 杭电ACM 2029 Palindromes _easy version
- 杭电ACM 2029:Palindromes _easy version
- 杭电ACM 2029 Palindromes _easy version
- 杭电2029 Palindromes _easy version
- 【杭电】[2029]Palindromes _easy version
- 杭电 2029 Palindromes _easy version 回文串
- 杭电 2029 Palindromes _easy version
- 杭电Hd 2029 Palindromes _easy version
- Palindromes _easy version(杭电2029)
- HDU 2029 Palindromes _easy version
- 【杭电oj2029】Palindromes _easy version
- hdoj 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
- HDOJ 2029 Palindromes _easy version
- hduoj 2029 Palindromes _easy version
- 2029 Palindromes _easy version(回文数简单版)