UVa 213 Message Decoding(World Finals1991，字符串)

最新推荐文章于 2020-02-27 15:15:47 发布

知足c

最新推荐文章于 2020-02-27 15:15:47 发布

阅读量3.9k

点赞数 3

分类专栏： -----------OJ----------- UVa ----------专题---------- 字符串文章标签：小白刘汝佳 UVA ACM WorldFinal

本文链接：https://blog.csdn.net/iooden/article/details/38322995

版权

该博客介绍了一种消息编码方案，需要通过程序将二进制编码解码回原始消息。编码规则涉及一系列以0和1组成的"key"字符串，按照特定长度和顺序映射到消息头的字符。解码过程包括识别键的长度、匹配键到字符并解析消息段。博客提供了样例输入和输出，以及解码的关键步骤。

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

Message Decoding

Some message encoding schemes require that an encoded message be sent in two parts. The first part, called the header, contains the characters of the message. The second part contains a pattern that represents the message. You must write a program that can decode messages under such a scheme.

The heart of the encoding scheme for your program is a sequence of ``key" strings of 0's and 1's as follows:

The first key in the sequence is of length 1, the next 3 are of length 2, the next 7 of length 3, the next 15 of length 4, etc. If two adjacent keys have the same length, the second can be obtained from the first by adding 1 (base 2). Notice that there are no keys in the sequence that consist only of 1's.

The keys are mapped to the characte