hdu1048 The Hardest Problem Ever
来源:互联网 发布:淘宝写手如何赚钱的 编辑:程序博客网 时间:2024/05/22 13:41
题目
#include<stdio.h>#include<string.h>int main() { int i;char en_s[]="START";char en_e[]="END";char end[]="ENDOFINPUT";char a[1000];for(;;){gets(a);if(strcmp(en_s,a)==0)continue;if(strcmp(en_e,a)==0)continue;if(strcmp(end,a)==0)break;for(i=0;a[i]!='\0';i++){if(a[i]>='A'&&a[i]<='E')a[i]=a[i]+21;else if(a[i]>='F'&&a[i]<='Z')a[i]=a[i]-5;}puts(a);} return 0; }
0 0
- HDU1048 The Hardest Problem Ever
- hdu1048 The Hardest Problem Ever
- HDU1048 The Hardest Problem Ever
- hdu1048 The Hardest Problem Ever
- HDU1048 The Hardest Problem Ever
- hdu1048 The Hardest Problem Ever
- hdu1048 The Hardest Problem Ever
- HDU1048——The Hardest Problem Ever
- The Hardest Problem Ever(hdu1048字符串水题)
- HDU1048 - The Hardest Problem Ever (简单题)
- hdu1048 The Hardest Problem Ever(C语言)
- The Hardest Problem Ever
- The Hardest Problem Ever
- The Hardest Problem Ever
- The Hardest Problem Ever
- The Hardest Problem Ever
- The Hardest Problem Ever
- The Hardest Problem Ever
- PHP 的 chunk_split() 函数
- [Android] Android开发优化之——对Bitmap的内存优化
- 实例分析 JavaScript 词法作用域
- LeetCode 561. Array Partition I
- 【01背包】洛谷 P2677 超级书架 2
- hdu1048 The Hardest Problem Ever
- apache的部署学习
- 基于qt和opencv3实现机器学习之:利用svm(支持向量机)分类
- OpenWrt路由器macvlan单线多拨的方法
- 二分贪心 E 找距离最大的最小值
- .Net 框架-----程序集的组成部分
- 命令模式
- 【矩阵快速幂】经典题 hdu2157 how many ways、woj642 Lost In WHU
- Bitmap排序