uva 213 Message Decoding

Description

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 characters in the header in order. That is, the first key (0) is mapped to the first character in the header, the second key (00) to the second character in the header, the kth key is mapped to the kth character in the header. For example, suppose the header is:

AB#TANCnrtXc

Then 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 representation of the length of the keys in the segment. For example, if the first 3 digits are 010, then the remainder of the segment consists of keys of length 2 (00, 01, or 10). The end of the segment is a string of 1's which is the same length as the length of the keys in the segment. So a segment of keys of length 2 is terminated by 11. The entire encoded message is terminated by 000 (which would signify a segment in which the keys have length 0). The message is decoded by translating the keys in the segments one-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 line by itself, and a message, which may extend over several lines. The length of the header is limited only by the fact that key strings have a maximum length of 7 (111 in binary). If there are multiple copies of a character in a header, then several keys will map to that character. The encoded message contains 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 of 1's. The keys in any given segment are all of the same length, and they all correspond to characters in the header. The message is terminated by 000.

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

Output

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

Sample input

TNM AEIOU
0010101100011
1010001001110110011
11000
$#**\
0100000101101100011100101000

Sample output

TAN ME
##*\$

题意：

题目真长。意思是这样的。我们要翻译一段密码，密码是01序列。输入的第一行是翻译用的字典。字典的每个字符对应一段密码。从第一个字符开始，分别对应0 00 01 10 000 001 010 等等，很明显，这里是有规律的，容易看出来。   接下来的几行就是要翻译的序列。在序列里，分成了不同的段。每个段的前三位表明这个段的长度len。比如100 代表长度为4（二进制） 接下来每（len）4位一读，读出序列后再在字典里找到对应的字符。当读到的len位数全为1时，表示该段的的翻译结束，然后读取下一个三位数（即下一个段的长度）。所以在序列里表示段的长度的01序列和表示结束的全1序列是不翻译的。

AC代码：

  
  

   
   
#include
     
     
      
      
#include
      
      
       
       
#include
       
       
        
        
#include
        
        
         
         
#include
         
         
           using namespace std; int slen; char a[1000],dic[1000]; char ans[1000][1000]; int getnum(int& k) { //system("pause"); // printf("---->>%d\n",k); if(k==slen) { // printf("-------- find the break\n"); scanf("%s",a); slen=strlen(a);//注意更新slen的值 k=0; } return a[k]-'0'; } void getans() { int i,j; int flag=1,cnt=0; for(i=1;flag;i++) for(j=0;j<(1<