substring

//使用kmp算法暴力求解
#include <bits/stdc++.h>
using namespace std;
void Next(const string &key, vector<int> &next)
{
    next[0] = -1;
    int i = 0, j = -1;
    while (i != key.size()-1)
    {
        if (j == -1 || key[i] == key[j])
        {
            next[++i] = ++j;
        }
        else
        {
            j = next[j];
        }
    }
}
int KMP(const string &word, const string &key)
{
    vector<int> next(key.size(), 0);
    Next(key, next);
    int i = 0, j = 0;
    while (i != word.size() && j != key.size())
    {
        if (j == -1 || word[i] == key[j])
        {
            ++i;
            ++j;
        }
        else
        {
            j = next[j];
        }
    }
    return j == key.size() ? i - j : -1;
}
void CountPreix(const vector<string> &words, const vector<string> &keys, vector<int> &counts)
{
    for (int i = 0; i < keys.size(); ++i)
    {
        for (int j = 0; j < words.size(); ++j)
        {
            if (KMP(words[j], keys[i]) != -1)
            {
                counts[i]++;
            }
        }
    }
}
int main()
{
    int n = 0;
    while (cin >> n)
    {
        vector<string> words(n);
        for (int i = 0; i < n; ++i)
        {
            cin >> words[i];
        }
        int m = 0;
        cin >> m;
        vector<string> keys(m);
        for (int i = 0; i < m; ++i)
        {
            cin >> keys[i];
        }
        vector<int> counts(m, 0);
        CountPreix(words, keys, counts);
        for (int count : counts)
        {
            cout << count << endl;
        }
    }
    
    return 0;
}

while True:
    try:
        num = int(input())
        List = []
        for i in range(num):
            List.append(input())
        M = int(input())
        for i in range(M):
            string = input()
            res = 0
            for j in List:
                if string in j:
                    res += 1
            print(res)
    except:
        break