zoukankan      html  css  js  c++  java
  • A. Keyboard Codeforces Round #271(div2)

    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>
    #include <algorithm>
    using namespace std;
    char s[100]={'q','w','e','r','t','y','u','i','o','p','a','s','d','f','g','h','j','k','l',';','z','x','c','v','b','n','m',',','.','/'};
    char s2[200];
    int main()
    {
        char d[10];
        scanf("%s",d);
        scanf("%s",s2);
        if(d[0]=='L')
        {
           int n=strlen(s2);
            for(int i=0;i<n;i++)
            {
                for(int j=0;j<30;j++)
                {
                    if(s2[i]==s[j])
                    {
                        printf("%c",s[j+1]);
                        break;
                    }
                }
            }
            printf("
    ");
        }
        else
        {
            int n=strlen(s2);
            for(int i=0;i<n;i++)
            {
                for(int j=0;j<30;j++)
                {
                    if(s2[i]==s[j])
                    {
                        printf("%c",s[j-1]);
                        break;
                    }
                }
            }
            printf("
    ");
        }
        return 0;
    }
    


    
    
  • 相关阅读:
    PHP curl_setopt函数用法介绍补充篇
    Javascript的setTimeOut和setInterval的定时器用法
    PHP curl_setopt函数用法介绍上篇
    开启PHP的伪静态
    关于MySQL的几个命令之load
    使用PHP生成和获取XML格式数据
    WEB开发中常用的正则表达式
    WEB开发中的页面跳转方法总结
    PHP的serialize序列化数据与JSON格式化数据
    PHP防止重复提交表单
  • 原文地址:https://www.cnblogs.com/yjbjingcha/p/6970621.html
Copyright © 2011-2022 走看看