【Codeforces Round 271 (Div 2)A】【水题】Keyboard 打字列偏移还原原始串

最新推荐文章于 2024-09-04 09:23:22 发布

snowy_smile

最新推荐文章于 2024-09-04 09:23:22 发布

阅读量353

点赞数

分类专栏：水题题库-CF CodeForces 文章标签：题库-CF CodeForces 水题

本文链接：https://blog.csdn.net/snowy_smile/article/details/50215107

版权

题库-CF CodeForces 同时被 2 个专栏收录

280 篇文章 2 订阅

订阅专栏

水题

99 篇文章 0 订阅

订阅专栏

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

qwertyuiop
asdfghjkl;
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 
        
R
s;;upimrrfod;pbr

          output 
        
allyouneedislove

#include<stdio.h>
#include<iostream>
#include<string.h>
#include<string>
#include<ctype.h>
#include<math.h>
#include<set>
#include<map>
#include<vector>
#include<queue>
#include<bitset>
#include<algorithm>
#include<time.h>
using namespace std;
void fre(){freopen("c://test//input.in","r",stdin);freopen("c://test//output.out","w",stdout);}
#define MS(x,y) memset(x,y,sizeof(x))
#define MC(x,y) memcpy(x,y,sizeof(x))
#define MP(x,y) make_pair(x,y)
#define ls o<<1
#define rs o<<1|1
typedef long long LL;
typedef unsigned long long UL;
typedef unsigned int UI;
template <class T1,class T2>inline void gmax(T1 &a,T2 b){if(b>a)a=b;}
template <class T1,class T2>inline void gmin(T1 &a,T2 b){if(b<a)a=b;}
const int N=0,M=0,Z=1e9+7,ms63=1061109567;
char a[3][12]=
{
"qwertyuiop",
"asdfghjkl;",
"zxcvbnm,./"
};
char s[105];
int main()
{
	char ch;
	while(~scanf(" %c%s",&ch,s))
	{
		for(int i=0;s[i];++i)
		{
			for(int j=0;j<3;++j)
			{
				for(int k=0;k<10;++k)
				{
					if(a[j][k]==s[i])
					{
						printf("%c",ch=='R'?a[j][k-1]:a[j][k+1]);
						break;
					}
				}
			}
		}
		puts("");
	}
	return 0;
}
/*
【题意】
给你一个键盘表，我们盲打。
告诉你是——偏右打了一列还是偏左打了一列，让你输出原始串。

【类型】
水题

【分析】
直接打下原始表，然后偏移输出就好啦。

*/