HDU-1305-判断有没有一个是另一个的前缀(不分前后)

题目传送门
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.
题意:一组输入好多串01 …9代表一组的结束 …判断一组之内是否存在一个是另一个的前缀。
字典树模板搞一下

#include <cstring>
#include <cstdio>
using namespace std;
struct trie
{
    bool flag;
    trie *nex[2];
    trie()
    {
        flag=0;
        for(int i=0;i<2;i++)
            nex[i]=NULL;
    }
};
trie *root;
bool create(char *str)
{
    trie *a=root;
    int len=strlen(str);
    for(int i=0;i<len;i++)
    {
        int k=str[i]-'0';
        if(a->nex[k]==NULL)
            a->nex[k]=new trie();
        a=a->nex[k];
        if(a->flag)   //别人是他的前缀  别人都结尾了他单词还没结束
            return 0;
    }
    for(int i=0;i<2;i++)
        if(a->nex[i]!=NULL)
                return 0;  //他是别人的前缀 他都结尾了,还存在别的单词是他的延续
    a->flag=1;
    return 1;
}
void del(trie *a)
{
    for(int i=0;i<2;i++)
        if(a->nex[i]!=NULL)
            del(a->nex[i]);
    delete(a);
}
int main()
{
    char s[20];
    int cas=0;
    bool opo=1;
    root=new trie();
    while(~scanf("%s",s))
    {
        if(s[0]=='9')
        {
            if(opo)
                printf("Set %d is immediately decodable\n",++cas);
            else
                printf("Set %d is not immediately decodable\n",++cas);
            del(root);
            root=new trie();
            opo=1;
            continue;
        }
        if(opo)
            opo=create(s);
    }
}