1 //2016.10.7
 2 #include <iostream>
 3 #include <cstdio>
 4 #include <cstdlib>
 5 #include <cstring>
 6 
 7 using namespace std;
 8 
 9 struct node//26叉树，num为到该节点截止的前缀有多少个
10 {
11     node* ch[26];
12     int num;
13     node(){
14         num = 0;
15         for(int i = 0; i < 26; i++)
16               ch[i] = NULL;
17     }
18 };
19 
20 node *root = NULL;
21 char s[15];
22 
23 void Insert(char *s)
24 {
25     node* cur = root;
26     cur->num++;
27     for(int i = 0; i < strlen(s); i++)
28     {
29         int tmp = s[i]-‘a‘;
30         if(cur->ch[tmp] == NULL)
31               cur->ch[tmp] = new node;
32         cur = cur->ch[tmp];
33         cur->num++;
34     }
35 }
36 
37 int query(char *s)
38 {
39     node *cur = root;
40     for(int i = 0; i < strlen(s); i++)
41     {
42         int tmp = s[i]-‘a‘;
43         if(cur->ch[tmp] == NULL)return 0;
44         cur = cur->ch[tmp];
45     }
46     return cur->num;
47 }
48 
49 int main()
50 {
51     root = new node;
52     while(gets(s), strcmp(s, "")){
53         Insert(s);
54     }
55     while(scanf("%s", s)!=EOF){
56         printf("%d\n", query(s));
57     }
58 
59     return 0;
60 }