UVa 401 - Palindromes
2012-05-24 16:48
323 查看
这题是相当的纠结啊,WA了10+次。。。
AC代码:
AC代码:
#include<stdio.h> #include<string.h> char one[]="ABCDEFGHIJKLMNOPQRSTUVWXYZ123456789"; char two[]="A 3 HIL JM O 2TUVWXY51SE Z 8 "; int palin(char str[]) { int i, j; j=strlen(str)-1; for (i=0; i<=j; i++, j--) { if(str[i] != str[j]) { return 0; } } return 1; } int pos(char ch) { int len=35, i; for(i=0;i<len;i++) if(one[i]==ch) return i; return len; } int mirror(char str[]) { int i, t, k=strlen(str)-1; for (i=0; i<=k; i++, k--) { t=pos(str[i]); if (str[k] != two[t]) { return 0; } } return 1; } int main() { int n, m, i; char str[1000]; while(gets(str)) { /*for (i=0; i<strlen(str); i++) { if (str[i] == '0') str[i]='O'; }*/ n=palin(str); m=mirror(str); if (!n && !m) { printf("%s -- is not a palindrome.\n\n", str); continue; } if (n && !m) { printf("%s -- is a regular palindrome.\n\n", str); continue; } if (!n && m) { printf("%s -- is a mirrored string.\n\n",str); continue; } if (n && m) { printf("%s -- is a mirrored palindrome.\n\n", str); continue; } } return 0; }
相关文章推荐
- UVA401 - Palindromes
- uva 401 Palindromes(字符串回文处理)
- UVA-401 Palindromes
- UVA 401 Palindromes
- UVa401-Palindromes-回文词-字符函数,常量数组
- Problem 003——UVa401 - Palindromes
- uva-401 - Palindromes
- HDU1318 POJ1590 UVA401 ZOJ1325 Palindromes【回文+水题】
- UVa 401 回文词(Palindromes)
- [算法练习] UVA-401-Palindromes
- UVA401_Palindromes
- UVA - 401 Palindromes
- UVA 401-- Palindromes
- UVA 401 - Palindromes
- Uva 401 Palindromes
- Uva 401 Palindromes
- UVa 401 - Palindromes
- uva-401 Palindromes
- uva401 - Palindromes
- UVA 401 Palindromes