UVa213

刘汝佳的AC代码，我的意志RE= =

#pragma warning(disable:4996)
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<vector>
#include<algorithm>
#include<iostream>
#include<time.h>
#include<map> 
#include<set>
#include<sstream>
#include<cassert>

using namespace std;
const int INF = 0x3f3f3f3f;


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

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

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

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 main()
{
    while (readcodes())
    {
        //printcodes();
        for (;;)
        {
            int len = readint(3);
            if (len == 0)break;
            //printf("len=%d\n",len);
            for (;;)
            {
                int v = readint(len);
                //printf("v=%d\n",v);
                if (v == (1 << len) - 1)break;
                putchar(code[len][v]);
            }
        }
        putchar('\n');
    }
    return 0;
}

无限RE

#pragma warning(disable:4996)
#include<cstdio>
#include<cstring>
#include<string>
#include<cmath>
#include<vector>
#include<algorithm>
#include<iostream>
#include<time.h>
#include<map> 
#include<set>
#include<sstream>
#include<cassert>

using namespace std;
const int INF = 0x3f3f3f3f;

char word[7][(1 << 10) - 1];
int readchar()
{
    for (;;)
    {
        int ch = getchar();
        if (ch != '\n'&&ch != '\r')
            return ch;
    }
}
int readcodes()
{
    memset(word, 0, sizeof(word));
    word[0][0] = readchar();
    for (int i = 1;i<7;i++)
    {
        for (int j = 0;j<((1 << (i + 1)) - 1);j++)
        {
            int ch = getchar();
            if (ch == EOF)
                return 0;
            if (ch == EOF)
                return 0;
            if (ch == '\n' || ch == '\r')
                return 1;
            word[i][j] = ch;
        }
    }
}

int main()
{
    string str;
    while (readcodes())
    {
        int k = 0;
        int len, temp = 0;
        string strtemp;
        str.clear();
        while (cin >> strtemp)
        {
            str.append(strtemp);
            temp = str.length();
            if (str[temp - 1] == '0'&&str[temp - 2] == '0'&&str[temp - 3] == '0')
                break;
        }
        k = 0;
        while (1)
        {
            len = (str[k] - '0') * 4 + (str[k + 1] - '0') * 2 + (str[k + 2] - '0');
            if (len == 0)
                break;
            k += 3;
            while (1)
            {
                int sum = 0;
                int tmp = 1 << len;
                for (int i = k;i<k + len;i++)
                {
                    tmp = tmp >> 1;
                    sum += (str[i] - '0')*tmp;
                }
                if (sum == (1 << len) - 1)
                {
                    k += len;
                    break;
                }
                cout << word[len - 1][sum];
                k += len;
            }
        }
        cout << endl;
    }
    return 0;
}