UVA 213信息解码

题目链接

#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<vector>
#include<set>
#include<map>
#include<queue>
using namespace std;
#define maxn 1005
#define ll long long
#define pi acos(-1.0)
#define inf 0x3f3f3f3f
int code[8][1<<8];
int read_n()//一直读到非换行符为止
{
    while(1)
    {
        int ch=getchar();
    if(ch!='\n'&&ch!='\r')return ch;
    }
}
int readint(int t)
{
    int ans=0;
    for(int i=0;i<t;i++)
       ans=ans*2+read_n()-'0';
    return ans;
}
int readhead()
{
    code[1][0]=read_n();
        for(int i=2;i<=7;i++)
        {
            for(int j=0;j<(1<<i)-1;j++)
            {
                char ch;
                ch=getchar();
                if(ch==EOF)return 0;
                if(ch=='\n'||ch=='\r')return 1;
                code[i][j]=ch;
            }
        }
}
int main()
{
    while(readhead())
    {
        while(1)
        {
            int len=readint(3);
            if(len==0)break;
            while(1)
            {
                int v=readint(len);
                if(v==(1<<len)-1)break;
                printf("%c",code[len][v]);
            }
        }
        printf("\n");//一定要有
    }
    return 0;
}