Keyboard Layouts

题目链接http://codeforces.com/problemset/problem/831/B

B. Keyboard Layouts
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

There are two popular keyboard layouts in Berland, they differ only in letters positions. All the other keys are the same. In Berland they use alphabet with 26 letters which coincides with English alphabet.

You are given two strings consisting of 26 distinct letters each: all keys of the first and the second layouts in the same order.

You are also given some text consisting of small and capital English letters and digits. It is known that it was typed in the first layout, but the writer intended to type it in the second layout. Print the text if the same keys were pressed in the second layout.

Since all keys but letters are the same in both layouts, the capitalization of the letters should remain the same, as well as all other characters.

Input

The first line contains a string of length 26 consisting of distinct lowercase English letters. This is the first layout.

The second line contains a string of length 26 consisting of distinct lowercase English letters. This is the second layout.

The third line contains a non-empty string s consisting of lowercase and uppercase English letters and digits. This is the text typed in the first layout. The length of s does not exceed 1000.

Output

Print the text if the same keys were pressed in the second layout.

Examples
input
qwertyuiopasdfghjklzxcvbnm
veamhjsgqocnrbfxdtwkylupzi
TwccpQZAvb2017
output
HelloVKCup2017
input
mnbvcxzlkjhgfdsapoiuytrewq
asdfghjklqwertyuiopzxcvbnm
7abaCABAABAcaba7
output
7uduGUDUUDUgudu7

题目大意:

输入三个字符串,第一个字符串表示第一个键盘的布局,第二个字符串表示第二种键盘的布局,第三个字符串是 文本 。题目要求 按照第一种键盘输入文本,用第二种键盘输出文本(其中数字原样输出;如果源文本中为大写字母,则输出文本的也应该是大写字母;如果源文本中为小写字母,则输出文本也应该是小写字母)。

解题思路:

对源文本进行遍历,用一个变量标记源文本字母 对应于 第一种键盘出现的下标,然后根据源文本中字母的大小写,输出对应于第二种键盘输出的文本(也就是要输出的文本)。

代码:

#include<iostream>
#include<string>
using namespace std;
int main()
{
    string s1,s2,s3;
    int z;
    while(cin>>s1>>s2>>s3)
    {
        for(int i=0;i<=s3.size()-1;i++)               //对源文本进行遍历
        {
            if(s3[i]>='0' && s3[i]<='9')              //如果是数字,则直接输出
            {
                cout<<s3[i];
                continue;
            }
            for(int j=0;j<=s1.size()-1;j++)           //查找并标记源文本对应于第一种键盘出现的位置(也就是数组下标)
            {
                if(s1[j]==s3[i] || s3[i]+32==s1[j])
                {
                    z=j;
                    break;
                }
            }
            if(s3[i]>='a' && s3[i]<='z')            //如果源文本为小写字母
            {
                if(s2[z]>='a' && s2[z]<='z')
                    cout<<s2[z];
                else
                {
                    s2[z]=s2[z]+32;
                    cout<<s2[z];
                }
            }
            else                                   //如果源文本为大写字母
            {
                if(s2[z]>='A' && s2[z]<='Z')
                    cout<<s2[z];
                else
                {
                    s2[z]=s2[z]-32;
                    cout<<s2[z];
                }
            }
        }
        cout<<endl;
    }
    return 0;
}


  • 1
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值