hdu-1048 The Hardest Problem Ever
来源:互联网 发布:unity3d培训 编辑:程序博客网 时间:2024/06/04 01:34
#include<stdio.h>#include<string.h>int main(){ int i,k; char str[1010],ch1[5],ch2[34]; 此处数组开小的话也不行,提交了好多次,我才发现数组开小了,一怒之下开到1000,哈哈 while(gets(ch2),ch2[0]!='E') { gets(str); gets(ch1); k=strlen(str); for(i=0;i<k;i++) { if(str[i]>='F'&&str[i]<='Z') str[i]-=5; else if(str[i]>='A'&&str[i]<='E') // 这个地方不理解为什么else那么重要,如果少了else就wrong了,费解啊。。。。 str[i]+=21; } puts(str); } return 0;}
0 0
- HDU 1048 The Hardest Problem Ever
- (hdu 1048)The Hardest Problem Ever
- HDU 1048 The Hardest Problem Ever
- HDU 1048 The Hardest Problem Ever
- HDU 1048 The Hardest Problem Ever
- HDU 1048 The Hardest Problem Ever
- HDU 1048 The Hardest Problem Ever
- hdu 1048 The Hardest Problem Ever
- HDU 1048 The Hardest Problem Ever
- HDU 1048 The Hardest Problem Ever
- HDU 1048 The Hardest Problem Ever
- hdu 1048 The Hardest Problem Ever
- hdu 1048 The Hardest Problem Ever
- hdu 1048 The Hardest Problem Ever(水题)
- HDU 1048 The Hardest Problem Ever
- HDU 1048 The Hardest Problem Ever
- HDU 1048 The Hardest Problem Ever
- HDU 1048 The Hardest Problem Ever
- 公约数数列
- iOS Block的使用
- hdu-1040 As Easy As A+B
- OpenCV2:Mat属性type,depth,step
- pdo预处理类
- hdu-1048 The Hardest Problem Ever
- poj 2385 Apple Catching 【暴力dp】
- centos中gcc升级,boost升级
- 菜鸟猿大战Java之集合框架系列(一)
- 最小生成树,克鲁斯卡尔算法(Python实现)
- NODE.JS入门示例
- hdu-1056 HangOver
- Jmeter之使用CSV Data Set Config实现参数化登录
- Java关键字