1928-JYB’s keyboard ZCMU

最新推荐文章于 2021-01-16 20:07:37 发布

原创最新推荐文章于 2021-01-16 20:07:37 发布 · 213 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#细节题

练习专栏收录该内容

160 篇文章

订阅专栏

本文介绍了一款实用工具——一个能够将QWERTY键盘输入的文档转换为Dvorak键盘布局的程序。该程序特别适用于那些习惯使用Dvorak布局但只能使用带有损坏Caps Lock键的QWERTY键盘的用户。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Description

Edward, a poor copy typist, is a user of the Dvorak Layout. But now he has only a QWERTY Keyboard with a broken Caps Lock key, so Edward never presses the broken Caps Lock key. Luckily, all the other keys on the QWERTY keyboard work well. Every day, he has a lot of documents to type. Thus he needs a converter to translate QWERTY into Dvorak. Can you help him?

The QWERTY Layout and the Dvorak Layout are in the following:

Input

A QWERTY document Edward typed. The document has no more than 100 kibibytes. And there are no invalid characters in the document.

Output

The Dvorak document.

Sample Input

Jgw Gqm Andpw a H.soav Patsfk f;doe

Nfk Gq.d slpt a X,dokt vdtnsaohe

Kjd yspps,glu pgld; aod yso kd;kgluZ

1234567890

`~!@#$%^&*()}"']_+-=ZQqWEwe{[\|

ANIHDYf.,bt/

ABCDEFuvwxyz

Sample Output

Hi, I'm Abfl, a Dvqrak Layqut usfr.

But I'vf qnly a Owfrty kfybqard.

Thf eqllqwing linfs arf eqr tfsting:

1234567890

`~!@#$%^&*()+_-={}[]:"'<>,.?/\|

ABCDFEuvwxyz

AXJF>Ugk,oe;

解析

按第一个键盘输入，按第二个键盘输出

代码

#include<bits/stdc++.h>
using namespace std;
int main()
{
    string s;
    char upper[26]={'A','X','J','F','>','U','I','D','C','H','T','N','M','B','R','L','"','P','Q','Y','G','K','<','O','E',':'};
    char lower[26]={'a','x','j','f','.','u','i','d','c','h','t','n','m','b','r','l','\'','p','q','y','g','k',',','o','e',';'};
    while(getline(cin,s))
    {
        int len=s.size();
        for(int i=0;i<len;i++)
        {
            if(s[i]>='0'&&s[i]<='9')
                cout<<s[i];
            else if(s[i]>='A'&&s[i]<='Z')
                cout<<upper[s[i]-'A'];
            else if(s[i]>='a'&&s[i]<='z')
                cout<<lower[s[i]-'a'];
            else
            {
                int flag=0;
                switch(s[i])
                {
                case '_':cout<<'{';flag=1;break;
                case '+':cout<<'}';flag=1;break;
                case '-':cout<<'[';flag=1;break;
                case '=':cout<<']';flag=1;break;
                case '{':cout<<'?';flag=1;break;
                case '}':cout<<'+';flag=1;break;
                case '[':cout<<'/';flag=1;break;
                case ']':cout<<'=';flag=1;break;
                case '<':cout<<'W';flag=1;break;
                case ',':cout<<'w';flag=1;break;
                case '>':cout<<'V';flag=1;break;
                case '.':cout<<'v';flag=1;break;
                case '?':cout<<'Z';flag=1;break;
                case '/':cout<<'z';flag=1;break;
                case ':':cout<<'S';flag=1;break;
                case ';':cout<<'s';flag=1;break;
                case '"':cout<<'_';flag=1;break;
                case '\'':cout<<'-';flag=1;break;
                }
                if(!flag)
                    cout<<s[i];
            }
        }
        printf("\n");
    }
    return 0;
}