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

题解：字典树裸题

/*
*@Author:   STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=10000000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,q;
int ans,cnt,flag,temp;
int a[N][26];
char str[10];
bool en[N];
int sum[N];
void insert(string s){
    int len=s.size(),p=0;
    for(int i=0;i<len;i++){
        int ch=s[i]-'a';
        if(a[p][ch]==0)a[p][ch]=++cnt;
        p=a[p][ch];
        sum[p]++;//cout<<sum[p]<<endl;
    }
    en[p]=1;
}
int search(char *str){
    int len=strlen(str),p=0;
    for(int i=0;i<len;i++){
        int ch=str[i]-'a';
        p=a[p][ch];
        if(p==0)return 0;

    }
    return sum[p];
}
int main()
{
#ifdef DEBUG
	freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
#endif
    //scanf("%d",&n);
    //scanf("%d",&t);
    string s;
    while(getline(cin,s)){
        if(s[0]=='\0')
            break;
        insert(s);
    }
    while(~scanf("%s",str)){
        cout<<search(str)<<endl;
    }

    //cout << "Hello world!" << endl;
    return 0;
}