@Harry_Haiyun老哥的荒唐代码

#include <bits/stdc++.h>
#define MOD 998244353
#define mod 1000000007
#define ll long long
#define ull unsigned long long
#define ui unsigned int
using namespace std;
const int maxn = 1e6+9;
int main()
{
	int n,m;
    cin >> n >> m;
    string ID[n];
    int len[n];
    for (int i = 0; i < n; i++) cin >> ID[i];
    for (int i = 0; i < m; i++)
    {
        cin >> len[i];
        char s[len[i]];
        cin >> s;
        int sum = 0;
        for (int j = 0; j < n; j++)
        {
            if (ID[j].rfind(s) == ID[j].length() - strlen(s)) 
                sum++;
        }
        cout << sum << '\n';
    }
	return 0;
}