e-模拟
2016-03-17 19:08
337 查看
E - 模拟
Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld
& %llu
Submit Status Practice ZOJ
3878
Description
Edward, a poor copy typist, is a user of the Dvorak Layout. But now he has only a QWERTY Keyboard with a broken Caps
Lock key, so Edward never presses the broken Caps Lock key. Luckily, all the
other keys on the QWERTY keyboard work well. Every day, he has a lot of documents to type. Thus he needs a converter to translate QWERTY into Dvorak. Can you help him?
The QWERTY Layout and the Dvorak Layout are in the following:
Input
A QWERTY document Edward typed. The document has no more than 100 kibibytes. And there are no invalid characters in the document.
Output
The Dvorak document.
Sample Input
Sample Output
PS:模拟题,水题来的
代码:
Time Limit:2000MS Memory Limit:65536KB 64bit IO Format:%lld
& %llu
Submit Status Practice ZOJ
3878
Description
Edward, a poor copy typist, is a user of the Dvorak Layout. But now he has only a QWERTY Keyboard with a broken Caps
Lock key, so Edward never presses the broken Caps Lock key. Luckily, all the
other keys on the QWERTY keyboard work well. Every day, he has a lot of documents to type. Thus he needs a converter to translate QWERTY into Dvorak. Can you help him?
The QWERTY Layout and the Dvorak Layout are in the following:
The QWERTY Layout |
---|
The Dvorak Layout |
---|
A QWERTY document Edward typed. The document has no more than 100 kibibytes. And there are no invalid characters in the document.
Output
The Dvorak document.
Sample Input
Jgw Gqm Andpw a H.soav Patsfk f;doe Nfk Gq.d slpt a X,dokt vdtnsaohe Kjd yspps,glu pgld; aod yso kd;kgluZ 1234567890 `~!@#$%^&*()}"']_+-=ZQqWEwe{[\| ANIHDYf.,bt/ ABCDEFuvwxyz
Sample Output
Hi, I'm Abel, a Dvorak Layout user. But I've only a Qwerty keyboard. The following lines are for testing: 1234567890 `~!@#$%^&*()+_-={}[]:"'<>,.?/\| ABCDEFuvwxyz AXJE>Ugk,qf;
PS:模拟题,水题来的
代码:
#include<iostream> #include<stdio.h> #include<string> using namespace std; int main() { string s1 = "_-+=QqWwEeRrTtYyUuIiOoPp{[}]SsDdFfGgHhJjKkLl:;\"'ZzXxCcVvBbNnMm<,>.?/"; string s2 = "{[}]\"'<,>.PpYyFfGgCcRrLl?/+=OoEeUuIiDdHhTtNnSs_-:;QqJjKkXxBbMmWwVvZz"; char c; while (~scanf("%c", &c)) { int is = true; for (int i = 0; i < s1.length(); ++i) { if (c == s1[i]) { is = false; cout << s2[i]; break; } } if (is) { cout << c; } } return 0; }
相关文章推荐
- 读书笔记-泛型有限通配符
- IOS控件学习之UIScrollView(2)
- iOS开发之按照模型某一属性排序
- 第3周项目4-(3)年龄几何
- IOS 杂笔- 6(KVC-KVO)
- 读书笔记-类和类加载器
- POJ 2485
- c-二分
- addEventListener()、attachEvent()和removeEventListener()、detachEvent()的区别?
- Symfony 2.3 使用CDN加速静态文件
- 关于COOKIE学习的一二
- 复利计算3
- Android中Application是什么?
- Linux创建分区开机自动挂载
- IOS 杂笔-5(NSTimer极浅析)
- 项目: 推送水木文章到Kindle
- 复利计算程序猜测与现实
- Java Socket详解(一)
- 某不知名的题 - 概率DP
- 插入排序