Codeforces Round #271 (Div. 2) A. Keyboard

標籤：des   style   blog   color   io   os   ar   for   sp   

Our good friend Mole is trying to code a big message. He is typing on an unusual keyboard with characters arranged in following way:

qwertyuiopasdfghjkl;zxcvbnm,./

Unfortunately Mole is blind, so sometimes it is problem for him to put his hands accurately. He accidentally moved both his hands with one position to the left or to the right. That means that now he presses not a button he wants, but one neighboring button (left or right, as specified in input).

We have a sequence of characters he has typed and we want to find the original message.

Input

First line of the input contains one letter describing direction of shifting (‘L‘ or ‘R‘ respectively for left or right).

Second line contains a sequence of characters written by Mole. The size of this sequence will be no more than 100. Sequence contains only symbols that appear on Mole‘s keyboard. It doesn‘t contain spaces as there is no space on Mole‘s keyboard.

It is guaranteed that even though Mole hands are moved, he is still pressing buttons on keyboard and not hitting outside it.

Output

Print a line that contains the original message.

Sample test(s)input

Rs;;upimrrfod;pbr

output

allyouneedislove

題意：求原串。

思路：類比。

#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>using namespace std;char str[123456];char dir[42];int main() {string w[3];w[0] = "qwertyuiop";w[1] = "asdfghjkl;";w[2] = "zxcvbnm,./";scanf("%s%s", dir, str);for (int i = 0; str[i]; i++) {for (int j = 0; j < 3; j++) {for (int k = 0; k < w[j].length(); k++) {if (w[j][k] == str[i]) {if (dir[0] == 'L')printf("%c", w[j][k+1]);else printf("%c", w[j][k-1]);}}}}printf("\n");return 0;}

Codeforces Round #271 (Div. 2) A. Keyboard