zoj 1240 IBM Minus One
2013-02-10 21:58
435 查看
水题~~~~~
#include<stdio.h> #include<string.h> int main() { char s[55]; int i,l,t,ans=0; scanf("%d",&t); getchar(); while(t--) { gets(s); l=strlen(s); for(i=0;i<l;i++) if(s[i]=='z')s[i]='a'; else if(s[i]=='Z')s[i]='A'; else s[i]=s[i]+1; printf("String #%d\n",++ans); printf("%s\n\n",s); } return 0; }
相关文章推荐
- ZOJ 1240 IBM Minus One
- zoj 1240.IBM Minus One
- ZOJ 1240 IBM Minus One
- ZOJ_1240_IBM Minus One
- ZOJ 1240: IBM Minus One
- ZOJ Problem Set - 1240 IBM Minus One
- ZOJ 1240 IBM Minus One
- zoj 1240 IBM Minus One
- ZOJ Problem Set - 1240 IBM Minus One
- zoj 1240 IBM Minus One
- zoj 1240 IBM Minus One
- ZOJ Problem Set - 1240 IBM Minus One
- zoj 1240 IBM Minus One
- zju1240 IBM减一 IBM Minus One
- 1240_IBM Minus One
- HDOJ/HDU 1328 IBM Minus One(水题一个,试试手)
- Problem j-10 IBM Minus One
- HDU 1328 IBM Minus One (水)
- HDU 1328 IBM Minus One
- IBM Minus One