1 #include
      
        2 #include
       
         3 #include
        
          4 char c[50010][110] ; 5 struct node 6 { 7     int flag ; 8     struct node *next[26] ; 9 };10 struct node *creat()11 {12     int i ;13     struct node *p ;14     p = (struct node*)malloc(sizeof(struct node));15     p->flag = 0 ;16     for(i=0; i<26; i++)17     p->next[i] = NULL ;18     return p;19 }20 void insert(struct node *head, char *s)21 {22     int i ;23     struct node *p = head ;24     int len = strlen(s) ;25     for(i=0; i
         
          next[t]==NULL)29         {30             p->next[t] = creat() ;31         }32         p = p->next[t] ;33     }34     p->flag = 1 ;35 }36 int judge(struct node *head, char *s)37 {38     struct node *p = head ;39     for(; *s!='\0';)40     {41         int t = *s - 'a' ;42         if(p->next[t]==NULL)43         return 0 ;44         p = p->next[t] ;45         if(p->flag==1&&*(s+1)=='\0')46         return 1 ;47         s++ ;48     }49     return 0 ;50 }51 int search(struct node *head, char *s)52 {53     struct node *p = head ;54     for(; *s!='\0';)55     {56         int t = *s - 'a' ;57         if(p->next[t]==NULL)58         return 0 ;59         p = p->next[t] ;60         if(p->flag==1&&judge(head, s+1))61         {62             return 1;63         }64         s++ ;65     }66     return 0 ;67 }68 int main()69 {70    int i = 0, j ;71    struct node *head = creat() ;72    while(gets(c[i])!=NULL)73    {74        insert(head, c[i]) ;75        i++ ;76    }77    for(j=0; j