zoukankan      html  css  js  c++  java
  • 【CODEFORCES】 A. 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.

    Sample test(s)
    input
    R
    s;;upimrrfod;pbr
    
    output
    allyouneedislove
    

    题解:水题,打两个表即可了。

    #include <iostream>
    #include <cstdio>
    #include <cstring>
    
    using namespace std;
    
    char c,s[150];
    int r[30]={97,'v','x','s','w','d','f','g','u','h','j','k','n','b','i','o',97,'e','a','r','y','c','q','z','t',97},
        l[30]={'s','n','v','f','r','g','h','j','o','k','l',';',',','m','p','[','w','t','d','y','i','b','e','c','u','x'};
    
    int main()
    {
        scanf("%c",&c);
        if (c=='R')
        {
            scanf("%s",s);
            for (int i=0;i<strlen(s);i++) if (s[i]=='[') cout <<"p";
            else if (s[i]==';') cout <<"l";
            else if (s[i]==',') cout <<"m";
            else if (s[i]=='.') cout <<",";
            else if (s[i]=='/') cout <<".";
            else printf("%c",r[s[i]-97]);
        }
        if (c=='L')
        {
            scanf("%s",s);
            for (int i=0;i<strlen(s);i++) if (s[i]=='.') cout <<"/";
            else if (s[i]==',') cout <<".";
            else printf("%c",l[s[i]-97]);
        }
        return 0;
    }




  • 相关阅读:
    java实现第五届蓝桥杯出栈次序
    java实现第五届蓝桥杯年龄巧合
    java实现第五届蓝桥杯年龄巧合
    java实现第五届蓝桥杯年龄巧合
    java实现第五届蓝桥杯年龄巧合
    java实现第五届蓝桥杯年龄巧合
    Java使用RandomAccessFile读写文件
    Java 实现文件随机读写-RandomAccessFile
    NIO 中文乱码自我解决的简单DEMO
    NIO 中文乱码问题的解决代码实现
  • 原文地址:https://www.cnblogs.com/yjbjingcha/p/6783243.html
Copyright © 2011-2022 走看看