usaco 4.1 Cryptcowgraphy(DFS+hash+剪枝)

最新推荐文章于 2021-06-05 11:09:55 发布

Pira

最新推荐文章于 2021-06-05 11:09:55 发布

阅读量749

点赞数

分类专栏： DFS与BFS 文章标签： encryption integer c scheme string random

本文链接：https://blog.csdn.net/fp_hzq/article/details/7776536

版权

本文介绍了牛信加密技术，这是一种通过插入特定字母并交换部分字符串来加密消息的方法。为了应对多次加密的消息，需要编写程序来判断原始未加密消息是否可能为给定字符串。该问题解决方案采用深度优先搜索（DFS）配合哈希表进行剪枝优化，通过判断哈希表中的状态来避免无效计算，提高效率。

摘要由CSDN通过智能技术生成

Cryptcowgraphy
Brian Dean

The cows of Farmer Brown and Farmer John are planning a coordinated escape from their respective farms and have devised a method of encryption to protect their written communications.

Specifically, if one cow has a message, say, "International Olympiad in Informatics", it is altered by inserting the letters C, O, and W, in random location in the message, such that C appears before O, which appears before W. Then the cows take the part of the message between C and O, and the part between O and W, and swap them. Here are two examples:

            International Olympiad in Informatics
                              -> 
            CnOIWternational Olympiad in Informatics
            
            International Olympiad in Informatics
                              -> 
            International Cin InformaticsOOlympiad W

To make matters more difficult, the cows can apply their encryption scheme several times, by again encrypting the string that results from the previous encryption. One night, Farmer John's cows receive such a multiply-encrypted message. Write a program to compute whet