ZOJ Problem Set - 1240 IBM Minus One
2013-09-21 21:42
323 查看
水题不解释,就是注意下格式,没输出一行字符串记得加一个空白行
#include <stdio.h> #include <string.h> int main() { int n,i=1; char str[55]; scanf("%d",&n); while(i<=n) { scanf("%s",str); int len=strlen(str); for(int j=0;j<len;j++) { if(str[j]!='Z') str[j]+=1; else str[j]='A'; } printf("String #%d\n%s\n\n",i,str); i++; } return 0; }
相关文章推荐
- ZOJ Problem Set - 1240 IBM Minus One
- ZOJ Problem Set - 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 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 1240 IBM Minus One
- ZOJ 1240 IBM Minus One
- 1240_IBM Minus One
- Problem j-10 IBM Minus One
- zju1240 IBM减一 IBM Minus One
- One Person Game ZOJ Problem Set - 3329
- ZOJ Problem Set - 3655 Alice and Bob
- ZOJ Problem Set–1414 Number Steps
- ZOJ Problem Set–1188 DNA Sorting