Ancient Cipher
来源:互联网 发布:淘宝直播开蚌是真的吗 编辑:程序博客网 时间:2024/06/05 03:16
Description
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 called substitution cipher and permutation 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.
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 contains 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 are equal and do not exceed 100.
The lengths of both lines of the input are equal and do not exceed 100.
Output
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
Sample Output
YES
找规律就行了
#include <stdio.h>#include <string.h>#include <algorithm>int main() {char c1[105];char c2[105];int a1[28];int a2[28];int m1 , m2 , k;while(~scanf("%s",c1)) {k = 1;scanf("%s",c2);m1 = strlen(c1);m2 = strlen(c2);memset(a1 , 0 , sizeof(a1));memset(a2 , 0 , sizeof(a2));for(int i = 0; i < m1; i++) {a1[c1[i] - 'A']++ ;}for(int i = 0; i < m2; i++) {a2[c2[i] - 'A']++ ;}std::sort(a1 , a1 + 26);std::sort(a2 , a2 + 26);for(int i = 0; i < 26; i++) {if(a1[i] != a2[i]) {k = 0;break;}}if(k) printf("YES\n");else printf("NO\n");}return 0;}
阅读全文
0 0
- Ancient Cipher
- Ancient Cipher
- Ancient Cipher
- Ancient Cipher
- Ancient Cipher
- Ancient Cipher
- Ancient Cipher
- POJ2159 Ancient Cipher
- Ancient Cipher--POJ2159
- POJ 2159 Ancient Cipher
- poj 2159 : Ancient Cipher
- POJ 2159 Ancient Cipher
- POJ 2159 Ancient Cipher
- poj 2159 Ancient Cipher
- ZOJ 2658 Ancient Cipher
- POJ2159 Ancient Cipher
- POJ 2159 Ancient Cipher
- POJ2159 Ancient Cipher
- C模拟打开浏览器百度搜索词条单击结束浏览器进程
- nutch2.x在eclipse+windows环境下运行遇到的一些问题的解决方案
- seq命令,tr命令,sort命令,cut命令
- 半夜二更
- 8、自定义动画--动画篇
- Ancient Cipher
- C语言函数和主函数的调用
- 关于线性移位寄存器和快速相关攻击中的算法A和算法B详细分析解答
- linux INIT_WORK 创建工作队列
- Java(4-3)
- matlab imfilter
- python_机器学习(1)无监督学习
- 虚拟化之影子页表
- IDEA创建Maven web项目