【Gym 102222C --- Caesar Cipher】

题目来源：点击进入【Gym 102222C — Caesar Cipher】

Description

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:

The plaintext: A B C D E F G H I J K L M N O P Q R S T U V W X Y Z;
The ciphertext: T U V W X Y Z A B C D E F G H I J K L M N O P Q R S.

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

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 n and 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

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.

Sample Input

1
7 7
ACMICPC
CEOKERE
PKPIZKC

Sample Output

Case #1: NINGXIA

解题思路：

只需判断两个字符串中第一位即可，标记明文和密文之间间隔多少个，然后对应输出即可。

AC代码(C++)：

#include <iostream>
#include <algorithm>
#include <map>
#include <string>
using namespace std;
map<char,char> mp;
string s1,s2,s3;int main()
{int n,m,t,cas=1;cin >>t;while(t--){cin >> n >> m;cin >> s1 >> s2;int x = (s1[0]-s2[0]+26)%26;cin >> s3;cout << "Case #" << cas++ <<": ";for(int i=0;i<m;i++) cout << char((s3[i]-'A'+x)%26+'A');cout << endl;mp.clear();}return 0;
}

【Gym 102222C --- Caesar Cipher】相关推荐

Codeforces - 102222C - Caesar Cipher
https://codeforc.es/gym/102222/my 好像在哪里见过这个东西?字符的左右移还是小心,注意在mod26范围内. #include<bits/stdc++.h> ...
G - Caesar Cipher Gym - 102798G
G - Caesar Cipher Gym - 102798G 题意: 对于一个区间,有两种操作,一种是对区间每个数+1再mod65536,另一种则是判断两个区间的数是否相同题解: 参考题解: 很明 ...
【JS 逆向百例】webpack 改写实战，G 某游戏 RSA 加密
关注微信公众号:K哥爬虫,QQ交流群:808574309,持续分享爬虫进阶.JS/安卓逆向等技术干货! 声明本文章中所有内容仅供学习交流,抓包内容.敏感网址.数据接口均已做脱敏处理,严禁用于商业用途 ...
毕业准备：外企面试--基本涵盖了所有问题【附带有答案版本】
毕业准备:外企面试--基本涵盖了所有问题[附带有答案版本] 2011-03-06 00:03:57 1. So, tell me a little about yourself. You don't ...
【网络编程开发系列】好端端的MQTT-broker重新部署后居然出现TLS握手失败了
摘要:本文通过一次真实的现网案例复盘,深度还原TLS握手问题的排查思路和方法,希望对广大读者有所启发和帮助. 文章目录 1 写在前面 2 问题描述 2.1 项目背景 2.2 现场问题 3 场景复现 3 ...
【Wi-Fi 802.11协议】管理帧之 Beacon帧详解
Beacon帧简介信标帧,由AP以一定的时间间隔周期性发出,以此来告诉外界自己无线网络的存在. Beacon帧组成下图为Beacon帧的组成下图为抓包所得(AP为2.4g 11n模式),Pack ...
【一文弄懂】优先经验回放（PER）论文-算法-代码
[一文弄懂]优先经验回放(PER)论文-算法-代码文章目录 [一文弄懂]优先经验回放(PER)论文-算法-代码前言: 综合评价: 继续前言唠叨 per论文简述: 参考博客: 背景知识 A MOTI ...
【强化学习实战-04】DQN和Double DQN保姆级教程（2）：以MountainCar-v0
[强化学习实战-04]DQN和Double DQN保姆级教程(2):以MountainCar-v0 实战:用Double DQN求解MountainCar问题 MountainCar问题详解 Moun ...
【华为_数通】OSPF
OSPF OSPF基础 OSPF概述 OSPF区域 OSPF区域类型 OSPF路由器类型 OSPF工作流程 OSPF报文和状态 Router ID OSPF报文字段验证 Hello定时器 7种状态 ...

【Gym 102222C --- Caesar Cipher】

【Gym 102222C --- Caesar Cipher】

【Gym 102222C --- Caesar Cipher】相关推荐

最新文章

热门文章