programming-challenges WERTYU (110301) 题解

#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;
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值