hdu 1251 统计难题

///  author:Kissheart  ///
#include<stdio.h>
#include<algorithm>
#include<iostream>
#include<string.h>
#include<vector>
#include<stdlib.h>
#include<math.h>
#include<queue>
#include<deque>
#include<ctype.h>
#include<map>
#include<set>
#include<stack>
#include<string>
#define INF 0x3f3f3f3f
#define FAST_IO ios::sync_with_stdio(false)
const double PI = acos(-1.0);
const double eps = 1e-6;
const int MAX=500005;
const int mod=1e9+7;
typedef long long ll;
using namespace std;
#define gcd(a,b) __gcd(a,b)
inline ll lcm(ll a,ll b){return a/gcd(a,b)*b;}
inline ll qpow(ll a,ll b){ll r=1,t=a; while(b){if(b&1)r=(r*t)%mod;b>>=1;t=(t*t)%mod;}return r;}
inline ll inv1(ll b){return qpow(b,mod-2);}
inline ll exgcd(ll a,ll b,ll &x,ll &y){if(!b){x=1;y=0;return a;}ll r=exgcd(b,a%b,y,x);y-=(a/b)*x;return r;}
inline ll read(){ll x=0,f=1;char c=getchar();for(;!isdigit(c);c=getchar()) if(c==‘-‘) f=-1;for(;isdigit(c);c=getchar()) x=x*10+c-‘0‘;return x*f;}
//freopen( "in.txt" , "r" , stdin );
//freopen( "data.txt" , "w" , stdout );
int tot,n;
int trie[MAX][30];
int sum[MAX];
char s[15];

void Insert()
{
    int len=strlen(s);
    int rt=0;
    for(int i=0;i<len;i++)
    {
        int x=s[i]-‘a‘;
        if(!trie[rt][x])
            trie[rt][x]=++tot;

        sum[trie[rt][x]]++;
        rt=trie[rt][x];
    }
}
int Find()
{
    int len=strlen(s);
    int rt=0;
    for(int i=0;i<len;i++)
    {
        int x=s[i]-‘a‘;
        if(!trie[rt][x]) return 0;
        rt=trie[rt][x];
    }
    return sum[rt];
}
int main()
{
    while(gets(s))
    {
        if(strlen(s)==0) break;
        Insert();
    }

    while(gets(s))
    {
        //printf("%s\n",s);
        printf("%d\n",Find());
    }
    return 0;
}