hdoj1048 The Hardest Problem Ever(字符转换)
来源:互联网 发布:启用新域名 编辑:程序博客网 时间:2024/05/29 21:18
简单题。考察字符的转换
#include<stdio.h> #include<string>#include<string.h>using namespace std;char change(char c){if(c>='A'&&c<='E') return c+21;else if(c>'E'&&c<='Z')return c+21-26;else return c;}int main(){char a[10],b[10];char str[250];while(scanf("%s",a)){if(a[0]=='E')break;getchar();gets(str);scanf("%s",b);int len=strlen(str);for(int i=0;i<len;i++){str[i]=change(str[i]);}printf("%s\n",str);}return 0;}
阅读全文
0 0
- hdoj1048 The Hardest Problem Ever(字符转换)
- HDOJ1048 The Hardest Problem Ever
- HDOJ1048 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
- The Hardest Problem Ever
- The Hardest Problem Ever
- The Hardest Problem Ever
- The Hardest Problem Ever
- The Hardest Problem Ever
- The Hardest Problem Ever
- HDU1048 The Hardest Problem Ever
- 1048 The Hardest Problem Ever
- POJ1298 The Hardest Problem Ever
- js动态设置元素的宽高
- 生成一个固定长度的令牌token
- spring cloud笔记
- RESTful 架构风格概述
- yii2验证码
- hdoj1048 The Hardest Problem Ever(字符转换)
- 安装devtoolset来满足gcc不同版本的要求
- Translating Compressed Scan Patterns to Standard Scan Mode Patterns.
- 2、使用地址表实现如下功能:根据输入的数字1-7,分别显示相应的英文星期名,如果输入其他字符,则重新输入。
- SpringMVC之浅析组件初始化过程
- jre jdk,
- 鼠标移动,修改背景图片
- Dijkstra算法(迪杰斯特拉)
- ZJCOJ:qwb与神奇的序列(数论)