ACM: polya模拟 数论题 poj 1026

最新推荐文章于 2020-08-06 11:31:44 发布

Smile_Benson

最新推荐文章于 2020-08-06 11:31:44 发布

阅读量324

点赞数

分类专栏： ACM

本文链接：https://blog.csdn.net/smile_benson/article/details/51458022

版权

该博客介绍了一种Bob和Alice使用的基于密钥的编码方式，利用一系列不重复的正整数作为秘密钥匙对消息进行多次编码。文章详细阐述了编码原理，并给出了一段C++代码实现对给定序列的编码过程。最后，提供了样例输入和输出，帮助理解编码算法的工作方式。

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

Cipher

Description

Bob and Alice started to use a brand-new encoding scheme. Surprisingly it is not a Public Key Cryptosystem, but their encoding and decoding is based on secret keys. They chose the secret key at their last meeting in Philadelphia on February 16th, 1996. They chose as a secret key a sequence of n distinct integers, a1 ; . . .; an, greater than zero and less or equal to n. The encoding is based on the following principle. The message is written down below the key, so that characters in the message and numbers in the key are correspondingly aligned. Character in the message at the position i is written in the encoded message at the position ai, where ai is the corresponding number in the key. And then the encoded message is encoded in the same way. This process is repeated k times. After kth encoding they exchange their message.

The length of the message is always less or equal than n. If the message is shorter than n, then spaces are added to the end of the message to get the message with the length n.<