hdu1251统计难题（trie树）

http://acm.hdu.edu.cn/showproblem.php?pid=1251

将每次走过得字母统计数量  查找的时候输出字母数量的最小值

#include<stdio.h>
#include<iostream.h>
#include<string.h>
struct node
{
    int count;
    node *next[27];
    node()
    {
        count = 0;
        memset(next,NULL,sizeof(next));
    }
};
void trie(char *c,node *root)
{
    int k = strlen(c),i,d;
    struct node *p = root; 
    for(i = 0 ; i < k ; i++)
    {
        d = c[i]-'a';
        if(p->next[d]==NULL)
        {            
            p->next[d] = new node;
        }        
        p = p->next[d];
        p->count++;
    }
}
void ftire(char *c,node *root)
{
    struct node *p = root;
    int i,k = strlen(c),d,f = 0,w = 0;
    int min = 100000;
    for(i = 0 ;i <k  ;i++)
    {
        d = c[i]-'a';
        if(p->next[d]==NULL)
        {
            w = 1;
            break;
        }
        if(p->count<min)
            min = p->count;
        p = p->next[d];
    }
    if(!w)
        f = p->count;
    printf("%d\n",f);
}
int main()
{
    int i;
    char str[11];
    struct node *root = new node;
    while(gets(str)!=NULL)
    {        
        if(str[0]!='\0')
        {
            trie(str,root);            
        }
        else
            break;
    }
    while(gets(str)!=NULL)
    {
        ftire(str,root);
    }
    return 0;
}