Pj Immediate Decodability

#include<cstdio>
#include<algorithm>
#include<iostream>
#include<cstring>
using namespace std;
const int manx=1<<8;
char data[manx];
int t[manx][2],tail;
int end[manx<<8];
bool flag=false;
void ins()
{
    int last=tail,now=0;
    int len=strlen(data)-1;
    for(int i=0;i<=len;i++)
    {
        int nxt=data[i]-'0';
        if(!t[now][nxt])    t[now][nxt]=++tail;
        if(end[now])    flag=true;//经过一个串的结尾
        now=t[now][nxt];
    }
    end[now]+=1;
    if(last==tail)  flag=true;//是其他串的前缀
    return ;
}
int main()
{
    int tot=0;
    //freopen("a.in","r",stdin);
    while(scanf("%s",data)!=EOF)
    {
        if(data[0]=='9')
        {
            tot+=1;
            if(!flag)
                printf("Set %d is immediately decodable\n",tot);
            else
            {
                printf("Set %d is not immediately decodable\n",tot);
            }//每一组数据都要初始化
            flag=false;
            memset(t,0,sizeof(t));
            memset(end,0,sizeof(end));
            tail=0;
            continue;
        }
        if(!flag)   ins();
    }
}