传送门

题目大意就是寻找子串在母串出现的次数！很裸的一道KMP问题，正好来练练手（捂脸哭）

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int maxn = 1000017;
int nt[maxn];
char s[maxn],p[maxn];
void Kmp_pre(char p[])
{
    int i = 0,j = -1;
    int len = strlen(p);
    nt[0] = -1;
    while(i < len)
    {
        if(j == -1 || p[i] == p[j])
        {
            i++;
            j++;
            nt[i] = j;
        }
        else
            j = nt[j];
    }
}
int Kmp_count(char s[],char p[])
{
    int i = 0,j = 0,ans = 0;
    int len1 = strlen(s);
    int len2 = strlen(p);
    nt[0] = -1;
    while(i < len1 && j < len2)
    {
        if(j == -1 || s[i] == p[j])
        {
            i++;
            j++;
        }
        else
            j = nt[j];
        if(j == len2)
        {
            ans++;
            j = nt[j];
        }
    }
    return ans;
}
int main()
{
    int t;
    scanf("%d",&t);
    getchar();
    while(t--)
    {
        gets(p);
        Kmp_pre(p);
        gets(s);
        int ans = Kmp_count(s,p);
        printf("%d\n",ans);
    }
    return 0;
}