Convert QWERTY to Dvorak ZOJ - 3878

暴力

//leehaoze
#include <iostream>
#include <deque>
#include <string>
#include <vector>
#include <queue>
#include <cstdio>
#include <stack>
#include <algorithm>
#include <cstring>
#include <cctype>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <map>

using namespace std;
const int INF = 1<<29;
#define INC_SAT( val ) (val = ((val)+1 > (val)) ? (val)+1 : (val))
#define ARR_SIZE( a ) ( sizeof( (a) ) / sizeof( (a[0]) ) )
#define ULL unsigned long long
map<char, char> dic;

void init() {
    dic['~'] = '~';
    dic['`'] = '`';
    dic['1'] = '1';
    dic['!'] = '!';
    dic['2'] = '2';
    dic['@'] = '@';
    dic['3'] = '3';
    dic['#'] = '#';
    dic['4'] = '4';
    dic['$'] = '$';
    dic['5'] = '5';
    dic['%'] = '%';
    dic['6'] = '6';
    dic['^'] = '^';
    dic['7'] = '7';
    dic['&'] = '&';
    dic['8'] = '8';
    dic['*'] = '*';
    dic['9'] = '9';
    dic['('] = '(';
    dic['0'] = '0';
    dic[')'] = ')';
    dic['_'] = '{';
    dic['-'] = '[';
    dic['+'] = '}';
    dic['='] = ']';
    dic['Q'] = '"';
    dic['q'] = '\'';

    dic['W'] = '<';
    dic['w'] = ',';
    dic['E'] = '>';
    dic['e'] = '.';
    dic['R'] = 'P';
    dic['r'] = 'p';
    dic['T'] = 'Y';
    dic['t'] = 'y';
    dic['Y'] = 'F';
    dic['y'] = 'f';
    dic['U'] = 'G';
    dic['u'] = 'g';
    dic['I'] = 'C';
    dic['i'] = 'c';
    dic['O'] = 'R';
    dic['o'] = 'r';
    dic['P'] = 'L';
    dic['p'] = 'l';
    dic['{'] = '?';
    dic['['] = '/';
    dic['}'] = '+';
    dic[']'] = '=';
    dic['|'] = '|';
    dic['\\'] = '\\';

    dic['A'] = 'A';
    dic['a'] = 'a';
    dic['S'] = 'O';
    dic['s'] = 'o';
    dic['D'] = 'E';
    dic['d'] = 'e';
    dic['F'] = 'U';
    dic['f'] = 'u';
    dic['G'] = 'I';
    dic['g'] = 'i';
    dic['H'] = 'D';
    dic['h'] = 'd';
    dic['J'] = 'H';
    dic['j'] = 'h';
    dic['K'] = 'T';
    dic['k'] = 't';
    dic['L'] = 'N';
    dic['l'] = 'n';
    dic[':'] = 'S';
    dic[';'] = 's';
    dic['"'] = '_';
    dic['\''] = '-';

    dic['Z'] = ':';
    dic['z'] = ';';
    dic['X'] = 'Q';
    dic['x'] = 'q';
    dic['C'] = 'J';
    dic['c'] = 'j';
    dic['V'] = 'K';
    dic['v'] = 'k';
    dic['B'] = 'X';
    dic['b'] = 'x';
    dic['N'] = 'B';
    dic['n'] = 'b';
    dic['M'] = 'M';
    dic['m'] = 'm';
    dic['<'] = 'W';
    dic[','] = 'w';
    dic['>'] = 'V';
    dic['.'] = 'v';
    dic['?'] = 'Z';
    dic['/'] = 'z';

    dic['\n'] = '\n';
    dic[' '] = ' ';
}

int main() {
//    freopen("IN.txt", "r", stdin);
    init();
    char s;
    while( (s = getchar()) != EOF){
        printf("%c",dic[s]);
    }
    return 0;
}
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值