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




  • 相关阅读:
    在Ubuntu 桌面版 12.04 LTS安装并运行SSH
    将Tp-link无线路由器桥接到Dlink无线路由器上
    如何解决Win7将任务栏程序自动分组的困扰
    安装Ubuntu 桌面版 12.04 LTS 过程之记录
    #lspci | grep Eth
    做技术不能人云亦云
    如何使用FF的Firebug组件中的net工具查看页面元素加载消耗时间
    在Fedora8上安装使用ActiveMQ5.8
    多态继承中的内存图解 && 多态中的对象变化的内存图解
    孔子装爹案例_帮助理解多态的成员访问特点及转型
  • 原文地址:https://www.cnblogs.com/yjbjingcha/p/6783243.html
Copyright © 2011-2022 走看看