UVa11278 - One-Handed Typist(水题)
2014-08-03 22:58
260 查看
Problem A
ONE-HANDED TYPIST
Recently, a programming contest coach had a terrible accident and broke his left arm.It was then that he discovered how dificult it was to type with only one hand.He really needed to find a way to increase his typing speed,since he had to create problemsin a hurry for an upcoming programming contest.
His solution was to switch from the standard QWERTY keyboard layout to a right-handed Dvorak keyboard layout (see diagrams below). It is pretty easy on a modern machine to change the keyboard layout in software, so that striking a key on the standard keyboard
would give you the character at that position on the desired layout, whether or not it matches the physicallylabeled character.
The standard QWERTY keyboard layout, shift-modified on right.
The right-handed Dvorak keyboard layout, shift-modified on right.
One day, as the coach was typing out a problem statement with his right hand,he discovered that he had forgotten to change the keyboard layout from QWERTYto Dvorak on the machine! Naturally, all the text came out scrambled, because he had struck the keys
as if it were a right-handed Dvorak keyboard.Alas, it would take too much time to retype all the text with only one hand.
Can you write a program to help the coach salvage his text?
Input
The input file consists of several lines of text,representing the text typed by the coach on a QWERTY keyboardlayout when he thought he was using a right-handed Dvorak layout.Each line contains no more than 1000 alphanumeric characters,spaces, and punctuationfound on the keyboard.
Output
For each line in the input,your program should write the line of text that the coach had meant to type.In other words, output the text as if it had been keyed using a right-handed Dvorak layout.Sample Input
Hg66t Mty6k! Jhg 4ibl; pytmn 8tc 5i79urrr t,gy jhg 6fxo kt.r
Output for the Sample Input
Hello World! The quick brown fox jumps... over the lazy dog.
#include <cstdio>
#include <unordered_map>
#include <cstring>
using namespace std;
const int N = 1010;
char buf
;
unordered_map<char, char> charMap;
bool input()
{
return fgets(buf, N, stdin) != NULL;
}
void init()
{
charMap['`'] = '`';
charMap['1'] = '1';
charMap['2'] = '2';
charMap['3'] = '3';
charMap['4'] = 'q';
charMap['5'] = 'j';
charMap['6'] = 'l';
charMap['7'] = 'm';
charMap['8'] = 'f';
charMap['9'] = 'p';
charMap['0'] = '/';
charMap['-'] = '[';
charMap['='] = ']';
charMap['q'] = '4';
charMap['w'] = '5';
charMap['e'] = '6';
charMap['r'] = '.';
charMap['t'] = 'o';
charMap['y'] = 'r';
charMap['u'] = 's';
charMap['i'] = 'u';
charMap['o'] = 'y';
charMap['p'] = 'b';
charMap['['] = ';';
charMap[']'] = '=';
charMap['\\'] = '\\';
charMap['a'] = '7';
charMap['s'] = '8';
charMap['d'] = '9';
charMap['f'] = 'a';
charMap['g'] = 'e';
charMap['h'] = 'h';
charMap['j'] = 't';
charMap['k'] = 'd';
charMap['l'] = 'c';
charMap[';'] = 'k';
charMap['\''] = '-';
charMap['z'] = '0';
charMap['x'] = 'z';
charMap['c'] = 'x';
charMap['v'] = ',';
charMap['b'] = 'i';
charMap['n'] = 'n';
charMap['m'] = 'w';
charMap[','] = 'v';
charMap['.'] = 'g';
charMap['/'] = '\'';
charMap['~'] = '~';
charMap['!'] = '!';
charMap['@'] = '@';
charMap['#'] = '#';
charMap['$'] = 'Q';
charMap['%'] = 'J';
charMap['^'] = 'L';
charMap['&'] = 'M';
charMap['*'] = 'F';
charMap['('] = 'P';
charMap[')'] = '?';
charMap['_'] = '{';
charMap['+'] = '}';
charMap['Q'] = '$';
charMap['W'] = '%';
charMap['E'] = '^';
charMap['R'] = '>';
charMap['T'] = 'O';
charMap['Y'] = 'R';
charMap['U'] = 'S';
charMap['I'] = 'U';
charMap['O'] = 'Y';
charMap['P'] = 'B';
charMap['{'] = ':';
charMap['}'] = '+';
charMap['|'] = '|';
charMap['A'] = '&';
charMap['S'] = '*';
charMap['D'] = '(';
charMap['F'] = 'A';
charMap['G'] = 'E';
charMap['H'] = 'H';
charMap['J'] = 'T';
charMap['K'] = 'D';
charMap['L'] = 'C';
charMap[':'] = 'K';
charMap['"'] = '_';
charMap['Z'] = ')';
charMap['X'] = 'Z';
charMap['C'] = 'X';
charMap['V'] = '<';
charMap['B'] = 'I';
charMap['N'] = 'N';
charMap['M'] = 'W';
charMap['<'] = 'V';
charMap['>'] = 'G';
charMap['?'] = '"';
charMap[' '] = ' ';
}
void solve()
{
int len = strlen(buf);
buf[len - 1] = 0;
len--;
for (int i = 0; i < len; i++) {
printf("%c", charMap[buf[i]]);
}
printf("\n");
}
int main()
{
#ifndef ONLINE_JUDGE
freopen("d:\\OJ\\uva_in.txt", "r", stdin);
#endif
init();
while (input()) {
solve();
}
return 0;
}
相关文章推荐
- UVALive 2318 水题
- HOJ 10593 UVA 706 - LCD Display(水题)
- uva11292 Dragon of Loowater 水题
- UVALive 3027 Corporative Network 并查集水题
- UVA - 488 Triangle Wave(水题)
- uva 1523 - Helicopter(暴力水题)
- UVa(11292),贪心水题
- uva1584_水题(环状串的处理)
- UVa 10192 - Vacation(LCS水题)
- UVA-1310 - One-way traffic(图论找桥)
- UVA 11461 - Square Numbers 数学水题
- UVA - 725(水题)
- 水题(奶牛和轿车,uva 10491)
- uva 12726 One Friend at a Time bfs + 状态压缩
- Codeforces721 A. One-dimensional Japanese Crossword (水题)
- uva 340 Master-Mind Hints(水题)
- UVA 1339 Ancient Cipher(水题)
- 贪心水题。UVA 11636 Hello World,LA 3602 DNA Consensus String,UVA 10970 Big Chocolate,UVA 10340 All in All,UVA 11039 Building Designing
- UVa 1586 水题