codeforces 474A Keyboard

A. Keyboard
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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.

Examples
Input
R
s;;upimrrfod;pbr
Output
allyouneedislove





AC:

#include<bits/stdc++.h>
using namespace std;
int main()
{
    char a[]="qwertyuiop[]\\asdfghjkl;'zxcvbnm,./";
    char ch;             //|这儿对转义字符的注意要记住
    scanf("%c",&ch);
    char p[110];
    scanf("%s",p);
    if(ch=='R')
    {
        for(int j=0;j<strlen(p);j++)
        {
            for(int i=0;i<34;i++)
            {
                if(p[j]-a[i]==0)
                {
                    cout<<a[i-1];
                    break;
                }
            }
        }
    }
    if(ch=='L')
    {
        for(int j=0;j<strlen(p);j++)
        {
            for(int i=0;i<34;i++)
            {
                if(p[j]-a[i]==0)
                {
                    cout<<a[i+1];
                    break;
                }
            }
        }
    }
}


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值