02159: Ancient Cipher

http://cs101.openjudge.cn/practice/02159/

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.

输入

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.

输出

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.

样例输入

JWPUDJSTVP
VICTORIOUS

样例输出

YES

来源

Northeastern Europe 2004

https://blog.csdn.net/code12hour/article/details/81225551

密码加密，密码都是大写英文字母，有两种加密方式，替换方式和排列方式。替换就是把每个字母用别的字母替换，而且不能重复。排列方式就是把字母重新排列顺序。这两种方式混合使用。现在给你A字符串和B字符串，A是密文，问B是否是原文。

排列的解决方法比较简单，就把两个字符串都按字典序排序，看看是否相同即可。替换的解决方式，观察每个字母的出现次数，然后就可以得到。综合一下就是，统计每个字母的出现次数，然后排序，观察是否相同。

python

def main():
    import sys
    input = sys.stdin.read
    data = input().strip().split()
    
    str1 = data[0]
    str2 = data[1]
    
    cnt1 = [0] * 26
    cnt2 = [0] * 26
    
    for char in str1:
        cnt1[ord(char) - ord('A')] += 1
    
    for char in str2:
        cnt2[ord(char) - ord('A')] += 1
    
    cnt1.sort()
    cnt2.sort()
    
    if cnt1 == cnt2:
        print("YES")
    else:
        print("NO")

if __name__ == "__main__":
    main()

02159: Ancient Cipher ​

02159: Ancient Cipher