programming-challenges WERTYU (110301) 题解
来源:互联网 发布:基金有什么软件 编辑:程序博客网 时间:2024/05/28 23:12
#include <iostream>#include <sstream>#include <fstream>#include <string>#include <vector>#include <queue>#include <map>#include <set>#include <stack>#include <assert.h>#include <algorithm>#include <math.h>#include <ctime>#include <functional>#include <string.h>#include <stdio.h>#include <numeric>#include <float.h>using namespace std;map<char, char> table; void buildTable() {table['='] = '-';table['-'] = '0';table['0'] = '9';table['9'] = '8';table['8'] = '7';table['7'] = '6';table['6'] = '5';table['5'] = '4';table['4'] = '3';table['3'] = '2';table['2'] = '1';table['1'] = '`';table['\\'] = ']';table[']'] = '[';table['['] = 'P';table['P'] = 'O';table['O'] = 'I';table['I'] = 'U';table['U'] = 'Y';table['Y'] = 'T';table['T'] = 'R';table['R'] = 'E';table['E'] = 'W';table['W'] = 'Q';table['\''] = ';';table[';'] = 'L';table['L'] = 'K';table['K'] = 'J';table['J'] = 'H';table['H'] = 'G';table['G'] = 'F';table['F'] = 'D';table['D'] = 'S';table['S'] = 'A';table['/'] = '.';table['.'] = ',';table[','] = 'M';table['M'] = 'N';table['N'] = 'B';table['B'] = 'V';table['V'] = 'C';table['C'] = 'X';table['X'] = 'Z';table[' '] = ' ';}int main() {buildTable();string s; while (getline(cin, s) && !s.empty()) {for (int i = 0; i < s.size(); i++) {cout << table[s[i]];}cout << endl; }return 0;}
0 0
- programming-challenges WERTYU (110301) 题解
- programming-challenges ShellSort (110407) 题解
- programming-challenges Ones (110504) 题解
- programming-challenges Chopsticks (111107) 题解
- programming-challenges Bicoloring (110901) 题解
- programming-challenges Crypt Kicker (110204) 题解
- programming-challenges Stack 'em Up (110205) 题解
- programming-challenges Poker Hands (110202) 题解
- programming-challenges Contest Scoreboard (110207) 题解
- programming-challenges Where's Waldorf? (110302) 题解
- programming-challenges Common Permutation (110303) 题解
- programming-challenges Crypt Kicker II (110304) 题解
- programming-challenges Automated Judge Script (110305) 题解
- programming-challenges File Fragmentation (110306) 题解
- programming-challenges Vito's Family (110401) 题解
- programming-challenges Stacks of Flapjacks (110402) 题解
- programming-challenges Longest Nap (110404) 题解
- programming-challenges Shoemaker's Problem (110405) 题解
- Leetcode#13:romanToInt 暑假训练第一弹
- APIO2009 抢掠计划
- GDI
- How Can I Create Histogram Projection In Opencv ?
- 学习如何从源代码分析Android Sdk--LinearLayout
- programming-challenges WERTYU (110301) 题解
- grails gsp 无法热部署(2.4)
- 正则表达式如何验证邮箱
- 如何用C设计和实现抽象数据类型(封装)
- 内存共享(Shared Memory)
- 史上最全最强SpringMVC详细示例实战教程
- 高并发量网站解决方案
- programming-challenges Where's Waldorf? (110302) 题解
- wds和extap作为cpe区别