Codeforces Round #424 (Div. 2, rated, based on VK Cup Finals) - B

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

题意：给第2个26个字母并不重复的字符串(2个字符串对于一个映射)，第1个字符串为key集合，第2个字符串为对应的value集合。 然后给了一个字符串(包括小写字母和数字),按照映射规则输出结果(数字不变，字母则对照给定2个字符串的映射规则，大写字母先转换成对应小写字母然后映射完之后在转换成对应的大写字母)

思路：按照题目意思模拟即可。

#define _CRT_SECURE_NO_DEPRECATE
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<string>
#include<queue>
#include<vector>
#include<time.h>
#include<stack>
#include<cmath>
#include<functional>
#include<cstdlib>
using namespace std;
typedef long long int LL;
typedef unsigned long long int ULL;
const LL INF = 9223372036854775807L;
const int inf = 0x3f3f3f3f;
const int MAXN =  + ;
char str[MAXN],zd[MAXN];
char c1[MAXN], c2[MAXN];
int main(){
#ifdef kirito
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);
#endif
    int start = clock();
    while (~scanf("%s",c1)){
        scanf("%s", c2);
        scanf("%s", str);
        for (int i = ; i < ; i++){
            zd[c1[i] - 'a'] = c2[i];
        }
        for (int i = ; i < strlen(str); i++){
            if (str[i] >= ''&&str[i] <= ''){
                continue;
            }
            else if (str[i] >= 'A'&&str[i] <= 'Z'){
                str[i] = (zd[str[i] - 'A'] - 'a' + 'A');
            }
            else{
                str[i] = zd[str[i] - 'a'];
            }
        }
        printf("%s\n", str);
    }
#ifdef LOCAL_TIME
    cout << "[Finished in " << clock() - start << " ms]" << endl;
#endif
    return ;
}