hdu:1305

Problem Description
An encoding of a set of symbols is said to be immediately decodable if no code for one symbol is the prefix of a code for another symbol. We will assume for this problem that all codes are in binary, that no two codes within a set of codes are the same, that each code has at least one bit and no more than ten bits, and that each set has at least two codes and no more than eight.

Examples: Assume an alphabet that has symbols {A, B, C, D}

The following code is immediately decodable:
A:01 B:10 C:0010 D:0000

but this one is not:
A:01 B:10 C:010 D:0000 (Note that A is a prefix of C)


Input
Write a program that accepts as input a series of groups of records from input. Each record in a group contains a collection of zeroes and ones representing a binary code for a different symbol. Each group is followed by a single separator record containing a single 9; the separator records are not part of the group. Each group is independent of other groups; the codes in one group are not related to codes in any other group (that is, each group is to be processed independently).


Output
For each group, your program should determine whether the codes in that group are immediately decodable, and should print a single output line giving the group number and stating whether the group is, or is not, immediately decodable.


Sample Input
01
10
0010
0000
9
01
10
010
0000
9


Sample Output
Set 1 is immediately decodable
Set 2 is not immediately decodable

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
const int maxn=100009;
char str[maxn][12];
struct trie
{
    int next[12];
    int cnt;
    void init()
    {
        cnt=0;
        memset(next,0,sizeof(next));
    }
}tree[maxn];
int index1;
void insert(char *s)
{
    int len=strlen(s);
    int p=0;
    for(int i=0;i<len;i++)
    {
        int x=s[i]-'0';
        if(tree[p].next[x]==0)
         {
             tree[index1+1].init();
             tree[p].next[x]=++index1;
         }
         tree[tree[p].next[x]].cnt++;
         p=tree[p].next[x];

    }
}
bool find(char *s)
{
    int len=strlen(s);
    int p=0;
    int x;
    for(int i=0;i<len;i++)
    {
        x=s[i]-'0';
        p=tree[p].next[x];

    }
    if(tree[p].cnt>=2)
    return false;
    return true;
}
int main()
{
    int cnt=0;

    while(scanf("%s",str[0])!=EOF)
    {    tree[0].init();
        int index=1;
            index1=0;
        insert(str[0]);

        while(1)
        {
            scanf("%s",str[index]);
            if(str[index][0]=='9')
            break;
            insert(str[index]);
            index++;
        }
        int flag=0;
        for(int i=0;i<index;i++)
        {
            if(!find(str[i]))
            {
                flag=1;
                break;
            }
        }
        if(flag)
        printf("Set %d is not immediately decodable\n",++cnt);
        else
        printf("Set %d is immediately decodable\n",++cnt);

    }
    return 0;
}