(信息解码)Message Decoding(uva213)(模拟,输入输出处理)(ACM/ICPC WF 1991)

传送门

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

using namespace std;

int code[8][1<<8];

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

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

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

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

猜你喜欢

转载自blog.csdn.net/zhouzi2018/article/details/80719589