hdu-1521

#include <cstring>
const int kMaxC = 26;
const int kMaxS = 11;
struct 
{
    int cnt;
    Trie* next[kMaxC];
    Trie(){
        cnt = 0;
        memset(next, 0, sizeof(next));
    }
};
void BuildTrie(Trie *rt, const char *str)
{
    int len = strlen(str);
    for(int i = 0; i < len; ++i)
    {
        int loc = str[i] - 'a';
        if(rt->next[loc] == NULL)
        {
            Trie *p = new Trie();
            ++p->cnt;
            rt -> next[loc] = p;
            rt = p;
        }
        else
        {
            rt = rt->next[loc];
            ++rt->cnt;
        }
    }
}
int QueryTrie(Trie *rt, char *str)
{
    int ret = 0;
    int len = strlen(str);
    for(int i = 0; i < len; ++i)
    {
        if(rt->next[str[i] - 'a'] != NULL)
        {
            rt = rt->next[str[i] - 'a'];
            ret = rt->cnt;
        }
        else
            return 0;
    }
    return ret;
}
int main()
{
    char str[kMaxS];
    Trie *rt = new Trie();
    while(gets(str))
    {
        if(strlen(str) == 0)break;
        BuildTrie(rt, str);
    }
    while(gets(str))
    {
        printf("%dn", QueryTrie(rt, str));
    }
    return 0;
}