4.24
来源:互联网 发布:淘宝erp系统 编辑:程序博客网 时间:2024/06/05 07:54
Ancient Roman empire had a strong government system with various departments, including a secret service department. Important documents were sent between provinces and the capital in encrypted form to prevent eavesdropping. The most popular ciphers in those times were so calledsubstitution cipherandpermutation cipher.
Substitution cipher changes all occurrences of each letter to some other letter. Substitutes for all letters must be different. For some letters substitute letter may coincide with the original letter. For example, applying substitution cipher that changes all letters from ‘A’ to ‘Y’ to the next ones in the alphabet, and changes ‘Z’ to ‘A’, to the message “VICTORIOUS” one gets the message “WJDUPSJPVT”.
Permutation cipher applies some permutation to the letters of the message. For example, applying the permutation ⟨2,1,5,4,3,7,6,10,9,8⟩ to the message “VICTORIOUS” one gets the message
“IVOTCIRSUO”.
It was quickly noticed that being applied separately, both substitution cipher and permutation cipher were rather weak. But when being combined, they were strong enough for those times. Thus, the most important messages were first encrypted using substitution cipher, and then the result was encrypted using permutation cipher. Encrypting the message “VICTORIOUS” with the combination of the ciphers described above one gets the message “JWPUDJSTVP”.
Archeologists have recently found the message engraved on a stone plate. At the first glance it seemed completely meaningless, so it was suggested that the message was encrypted with some substitution and permutation ciphers. They have conjectured the possible text of the original message that was encrypted, and now they want to check their conjecture. They need a computer program to do it, so you have to write one.
Input
Input file contains several test cases. Each of them consists of two lines. The first line contains the message engraved on the plate. Before encrypting, all spaces and punctuation marks were removed, so the encrypted message contains only capital letters of the English alphabet. The second line contains the original message that is conjectured to be encrypted in the message on the first line. It also contains only capital letters of the English alphabet.
The lengths of both lines of the input file are equal and do not exceed 100.
Output
For each test case, print one output line. Output ‘YES’ if the message on the first line of the input file could be the result of encrypting the message on the second line, or ‘NO’ in the other case.
Sample Input
JWPUDJSTVP
VICTORIOUS
MAMA
ROME
HAHA
HEHE
AAA
AAA
NEERCISTHEBEST
SECRETMESSAGES
Sample Output
YES
NO
YES
YES
NO
加密的两种方法
一种是字母本身的变化,另一种是位置的变化
但无论怎么变化,相对的个数都是不会变的
#include <stdio.h>
#include <string>
#include <iostream>
#include <algorithm>
using namespace std;
int main()
{
string s;
int i;
while(cin>>s)
{
int a[26]={0},b[26]={0};
for(i=0;i<s.length();i++)
a[s[i]-'A']++;
cin>>s;
for(i=0;i<s.length();i++)
b[s[i]-'A']++;
sort(a,a+26);
sort(b,b+26);
for(i=0;i<26;i++)
{
if(a[i]!=b[i])
{
printf("NO\n");
break;
}
}
if(i>=26)
printf("YES\n");
}
}
- 4.24
- 4.24
- 4.24
- 4.24
- 4.24
- 4.24
- 4.24 周日
- day44(4.24)
- 4.24总结
- C++4.24
- 4.24sql学习
- 一天一点点。(4.24)
- LuaForS60 工程进度 4.16 --- 4.24.
- 传智播客学习笔记4.24
- C练习4.24
- 学习笔记4.24
- 4.24学习日记
- 工作日志4.24
- Android 发送无序广播
- 我的留言贴
- 初学webpack
- Android之用UncaughtExceptionHandler实现保存崩溃日志到sdcard目录下的文件夹
- HTML骨架结构
- 4.24
- [IMWeb训练营]-团队作业
- Linux学习第四单元-管理系统中的简单分区和文件系统
- 3_1决策树(Decision_Tree_ID3)——calcShannonEnt_3_1
- 浅析spring中的AOP(面向切面编程)
- Linq模糊查询
- HTML文档头部
- 题目1376:最近零子序列
- Android仿微信朋友圈,全文收起功能,附源码