HDU 2029 Palindromes _easy version
2012-01-05 13:11
465 查看
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2029
这题不用for循环判断,直接用strrev转置就行,水过。(不过用G++好像会编译错误,改C或C++就行)
代码:
这题不用for循环判断,直接用strrev转置就行,水过。(不过用G++好像会编译错误,改C或C++就行)
代码:
#include<stdio.h> #include<string.h> int main() { char str1[1001],str2[1001]; int s,i,len; scanf("%d",&s); getchar(); while(s--) { scanf("%s",str1); strcpy(str2,str1); strrev(str1);//**倒置字符串**// if(strcmp(str1,str2)==0) { printf("yes\n"); } else printf("no\n"); } 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
- 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(回文串)
- HDU 2029 Palindromes _easy version(字符串)
- hdu 2029 Palindromes _easy version(库函数 strrev)(备战LQB)