2018 ACM-ICPC 宁夏 C.Caesar Cipher（模拟）

In cryptography, a Caesar cipher, also known as the shift cipher, is one of the most straightforward and most widely known encryption techniques.It is a type of substitution cipher in which each letter in the plaintext is replaced by a letter some fixed number of positions up (or down) the alphabet.

For example, with the right shift of 19, A would be replaced by T, B would be replaced by U, and so on.A full exhaustive list is as follows:

Now you have a plaintext and its ciphertext encrypted by a Caesar Cipher.You also have another ciphertext encrypted by the same method and are asked to decrypt it.

Input Format

The input contains several test cases, and the first line is a positive integer T indicating the number of test cases which is up to 50.

For each test case, the first line contains two integers nn and m~(1 \le n,m \le 50)m (1≤n,m≤50) indicating the length of the first two texts (a plaintext and its ciphertext) and the length of the third text which will be given.Each of the second line and the third line contains a string only with capital letters of length n, indicating a given plaintext and its ciphertext respectively.The fourth line gives another ciphertext only with capital letters of length m.

We guarantee that the pair of given plaintext (in the second line) and ciphertext (in the third line) is unambiguous with a certain Caesar Cipher.

Output Format

For each test case, output a line containing Case #x: T, where x is the test case number starting from 1, and T is the plaintext of the ciphertext given in the fourth line.

样例输入

ACMICPC
CEOKERE
PKPIZKC

样例输出

Case #: NINGXIA

挺简单的一道题，刚开始竟然wa了。。。太菜了

 #include <stdio.h>
 #include <string.h>
 #include <iostream>
 #include <string>
 #include <math.h>
 #include <algorithm>
 #include <vector>
 #include <queue>
 #include <set>
 #include <stack>
 #include <map>
 #include <math.h>
 const int INF=0x3f3f3f3f;
 typedef long long LL;
 const int mod=1e9+;
 const int maxn=1e5+;
 using namespace std;
 //ios::sync_with_stdio(false);
 //    cin.tie(NULL);

 int main()
 {
     int T;
     cin>>T;
     for(int k=;k<=T;k++)
     {
         int n,m;
         cin>>n>>m;
         string s1,s2,s3;
         cin>>s1>>s2;
         int p=s1[]-s2[];
         cin>>s3;
         cout<<"Case #"<<k<<": ";
         for(int i=;i<m;i++)
         {
             cout << char((s3[i]-'A'+p +)% + );
         }
         cout<<endl;
     }
     return ;
 }