hdu -1251 统计难题(字典树水题)

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

建树之后 查询即可.

G++提交 ME不知道为什么,c++就对了。

 #include <iostream>
 #include <cstdio>
 #include <cmath>
 #include <vector>
 #include <cstring>
 #include <string>
 #include <algorithm>
 #include <string>
 #include <set>
 #include <functional>
 #include <numeric>
 #include <sstream>
 #include <stack>
 #include <map>
 #include <queue>
 #include <deque>
 //#pragma comment(linker, "/STACK:102400000,102400000")
 #define CL(arr, val)    memset(arr, val, sizeof(arr))

 #define ll long long
 #define INF 0x7f7f7f7f
 #define lc l,m,rt<<1
 #define rc m + 1,r,rt<<1|1
 #define pi acos(-1.0)

 #define L(x)    (x) << 1
 #define R(x)    (x) << 1 | 1
 #define MID(l, r)   (l + r) >> 1
 #define Min(x, y)   (x) < (y) ? (x) : (y)
 #define Max(x, y)   (x) < (y) ? (y) : (x)
 #define E(x)        (1 << (x))
 #define iabs(x)     (x) < 0 ? -(x) : (x)
 #define OUT(x)  printf("%I64d\n", x)
 #define lowbit(x)   (x)&(-x)
 #define Read()  freopen("a.txt", "r", stdin)
 #define Write() freopen("b.txt", "w", stdout);
 #define maxn 310
 #define maxv 50010
 #define mod 1000000000
 using namespace std;

 typedef struct node
 {
     int count;
     struct node *next[];
 }*tree;

 void insert(tree p,char *s)
 {
     tree h=p;
     int l=strlen(s);
     for(int i=;i<l;i++)
     {
         int index=s[i]-'a';
         if(h->next[index]!=NULL)
         {
             h=h->next[index];
             h->count++;
         }
         else
         {
             tree tem=(tree)calloc(,sizeof(node));
             tem->count=;
             h->next[index]=tem;
             h=tem;
         }
     }
 }

 int find(tree p,char *s)
 {
     tree h=p;
     int l=strlen(s);
     for(int i=;i<l;i++)
     {
         int index=s[i]-'a';
         if(h->next[index]==NULL) return ;
         h=h->next[index];
     }
     return h->count;
 }
 int main()
 {
     //Read();
     char s[];
     tree head=(tree)calloc(,sizeof(node));
     while(gets(s)&&s[])
     {
         insert(head,s);
         //printf("%s\n",s);
     }
     //printf("1\n");
     while(~scanf("%s",s))
     {
         printf("%d\n",find(head,s));
     }
     free(head);
     return ;
 }