trie树

#include<algorithm>
#include<iostream>
#include<limits.h>
#include<stdlib.h>
#include<string.h>
#include<cstring>
#include<stdio.h>
#include<bitset>
#include<cctype>
#include<math.h>
#include<string>
#include<time.h>
#include<vector>
#include<cmath>
#include<queue>
#include<stack>
#include<list>
#include<map>
#include<set>

#define LL long long
#define mod 1e9 + 7

using namespace std;

const double PI = acos(-1.0);
const int M = 500005;

struct node
{
    int next[26];
    int cnt;
}tree[M];

int le;

void insert(char *s)
{
    int i = 0, p = 0;
    while(s[i])
    {
        int x = s[i] - ‘a‘;
        if(tree[p].next[x] == -1)
        {
            tree[p].cnt = 0;
            tree[p].next[x] = le++;
        }
        p = tree[p].next[x];
        tree[p].cnt++;
        i++;
    }
}

int query(char *s)
{
    int i = 0, p = 0;
    while(s[i])
    {
        int x = s[i] - ‘a‘;
        if(tree[p].next[x] == -1)
            return 0;
        p = tree[p].next[x];
        i++;
    }
    return tree[p].cnt;
}

int main()
{
    char str[20];
    le = 1;
    memset(tree,-1,sizeof(tree));
    while(gets(str) && strlen(str))
        insert(str);
    while(gets(str))
        cout << query(str) << endl;
    return 0;
}