第四章 - Message Decoding - uva213

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 thatrepresents 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 asfollows:

0, 00, 01, 10, 000, 001, 010, 011, 100, 101, 110, 0000, 0001, . . . , 1011, 1110, 00000, . . .

The first key in the sequence is of length 1, the next 3 are of length 2, the next 7 of length 3, thenext 15 of length 4, etc. If two adjacent keys have the same length, the second can be obtained fromthe 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 characters in the header in order. That is, the first key (0) is mappedto the first character in the header, the second key (00) to the second character in the header, the kthkey is mapped to the kth character in the header. 

For example, suppose the header is:AB#TANCnrtXcThen 0 is mapped to A, 00 to B, 01 to #, 10 to T, 000 to A, ..., 110 to X, and 0000 to c.

The encoded message contains only 0’s and 1’s and possibly carriage returns, which are to be ignored.The message is divided into segments. The first 3 digits of a segment give the binary representationof the length of the keys in the segment. For example, if the first 3 digits are 010, then the remainderof the segment consists of keys of length 2 (00, 01, or 10). The end of the segment is a string of 1’swhich is the same length as the length of the keys in the segment. So a segment of keys of length 2 isterminated by 11. The entire encoded message is terminated by 000 (which would signify a segmentin which the keys have length 0). The message is decoded by translating the keys in the segmentsone-at-a-time into the header characters to which they have been mapped.

Input

The input file contains several data sets. Each data set consists of a header, which is on a single lineby itself, and a message, which may extend over several lines. The length of the header is limitedonly by the fact that key strings have a maximum length of 7 (111 in binary). If there are multiplecopies of a character in a header, then several keys will map to that character. The encoded messagecontains only 0’s and 1’s, and it is a legitimate encoding according to the described scheme. That is,the message segments begin with the 3-digit length sequence and end with the appropriate sequence of1’s. The keys in any given segment are all of the same length, and they all correspond to characters inthe header. The message is terminated by 000.

Carriage returns may appear anywhere within the message part. They are not to be considered aspart of the message.

Output

For each data set, your program must write its decoded message on a separate line. There should notbe blank lines between messages.

Sample

input

TNM AEIOU

0010101100011

1010001001110110011

11000

$#**\

0100000101101100011100101000

Sample output

TAN ME

##*\$

分析：（根据书上的方法）

由题可知最长的编码头的长度不超过7，可以设一个数组code[len][value]表示长度为len，值为value的编码对应的字符为多少

读入编码头

之后每次都先读入一个长度为3的0,1串，设置一个函数readint(int len)来读入并计算出对应的十进制数k是多少。

每次都读入k位0,1串，(用readint读入并计算出对应的十进制值m是多少)，并把对应的code[k][m]输出

我学习了：

1）1<<len表示2的len次方，"<<"是左移，左移一位表示乘2，右移一位表示除2，则(1<<len)-1就表示长度为len的二进制表示的最大数（比如(1<<3)-1）表示111

2）putchar(c):

c可以是英文状态下，单引号引起来的一个字符，也可以是介于0-127之间的一个十进制整数（包括0,127），也可以是char型。

#include<iostream>
#include<cstdio>

using namespace std;

int main(){
    int n=65;//A的ascii码为65
    putchar(n);
}
//输出：A

3）边读入计算len位长二进制数的值的方法：

#include<iostream>
#include<cstdio>

using namespace std;
char readchar(){
    char ch;
    for(;;){
        ch=getchar();
        if(ch!='\n'&&ch!='\r')return ch;
    }
}
int main(){
    int len,v=0;
    cin>>len;
    while(len--){
        v=v*2+readchar()-'0';
    }
    cout<<v<<endl;
}
/*输出：
3
101
输出：
5
*/

4）遇到这种输入字符串的而且有很多换行的题，可以自己编写一个readchar函数，当不为换行的时候返回输入的值，这样使代码更加简洁明了

代码如下：

#include<iostream>
#include<cstdio>
#include<cstring>

using namespace std;
char code[8][8<<7];

char readchar(){
    for(;;){
        char ch=getchar();
        if(ch!='\n'&&ch!='\r')return ch;
    }
}

int readint(int n){
    int v=0;
    while(n--){
        v=v*2+readchar()-'0';
    }
    return v;
}

int readcodes(){
    memset(code,0,sizeof(code));
    code[1][0]=readchar();
    if(code[1][0]==EOF)return 0;
    for(int len=2;len<=7;len++){
        for(int i=0;i<(1<<len)-1;i++){
            int ch=getchar();
            if(ch=='\n'||ch=='\r')return 1;
            code[len][i]=ch;
        }
    }

    return 1;
}

int main(){
    while(readcodes()){
        for(;;){
            int len=readint(3);
            if(!len)break;
            for(;;){
                int v=readint(len);
                if(v==(1<<len)-1)break;
                putchar(code[len][v]);
            }
        }
        putchar('\n');
    }
}