Palindromes //简单字符串
来源:互联网 发布:网络机顶盒还原出厂 编辑:程序博客网 时间:2024/06/04 18:25
#include <stdio.h>#include <string.h>int main(){ int i, mid, len; char stdc[50]= {'A',0,0,0,'3',0,0,'H','I','L',0,'J','M',0,'O',0,0,0,'2','T','U','V','W','X','Y','5','1','S','E',0,'Z',0,0,'8',0};<span style="white-space:pre"></span> char ch[30]; bool isr, ism; while( scanf("%s", ch)!=-1 ) { isr = ism = true;len = strlen(ch); mid = len / 2 + (len%2==0? 0:1); for(i=0; i<mid; i++) { if(ch[i] != ch[len-i-1]) { isr = false; if(ch[i]>='A' && ch[i]<='Z') { if(ch[len-i-1] != stdc[ch[i]-'A'] ) ism = false; } else if(ch[i]>='0' && ch[i]<='9') { if(ch[len-i-1] != stdc[ch[i]-'0'+25] ) ism = false; } }else{if(ch[i]>='A' && ch[i]<='Z') { if(ch[len-i-1] != stdc[ch[i]-'A'] ) ism = false; } else if(ch[i]>='0' && ch[i]<='9') { if(ch[len-i-1] != stdc[ch[i]-'0'+25] ) ism = false; }}if(!isr && !ism)break; } printf("%s", ch); if(isr && ism) printf(" -- is a mirrored palindrome.\n"); else if(isr) printf(" -- is a regular palindrome.\n"); else if(ism) printf(" -- is a mirrored string.\n"); else printf(" -- is not a palindrome.\n");printf("\n"); } return 0;}
0 0
- Palindromes //简单字符串
- UVa 401 Palindromes(简单字符串)
- uva 401 Palindromes //字符串
- Palindromes UVa401 字符串
- UVA 401 Palindromes 字符串
- 字符串A - Palindromes
- uva401 Palindromes 字符串,模拟
- 字符串-401 - Palindromes
- UVA 401 - Palindromes(字符串)
- zoj2744 Palindromes 字符串的题
- UVa 401 Palindromes (字符串匹配)
- Palindromes - UVa 401 字符串处理
- UVa 401 Palindromes(字符串,回文)
- HDU - 1318 Palindromes(字符串)
- poj 1590Palindromes 简单模拟
- Palindromes
- Palindromes
- Palindromes
- [Android设计模式]Android退出应用程序终极方法
- OJ指针当形参
- SpringMVC数据类型转换—— 注解式控制器的数据验证、类型转换及格式化
- 小功能--画一个矩形框里面贴图片
- create shortcut in gnome3 and some settings-- lockscreen & arp_attack
- Palindromes //简单字符串
- C++读取配置文件
- 【原创】《Linux高级程序设计》杨宗德著 - TCP高级应用 - 多路复用
- haproxy+keepalived实现高可用负载均衡
- appframework学习--解决nav平板,pc等大屏上自动展开问题
- 【DP|01背包】AHU-603 LOL系列之蒙多的春天
- iPhone6/6 Plus适配详解
- 【Leetcode】Maximum Subarray
- android的消息处理机制(图文+源码分析)—Looper/Handler/Message