POJ 3461 Oulipo (KMP模板题)

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cmath>
#include<vector>
#include<queue>
#include<map>
#include<ctime>
#define eps (1e-8)

using namespace std;

typedef long long ll;
const int maxn = 1000010;
const int maxm = 10010;
int f[maxm],m,ans,n;
char P[maxm],T[maxn];

void getnext()
{
    f[0] = 0,f[1] = 0;
    for(int i=1;i<m;i++){
        int j = f[i];
        while(j && P[j]!=P[i]) j=f[j];
        f[i+1] = (P[j]==P[i])?j+1:0;
    }
}
void KMP()
{
    n = strlen(T);
    m = strlen(P);
    getnext();
    int j = 0;
    for(int i=0;i<n;i++){
        while(j && P[j]!=T[i]) j=f[j];
        if(P[j]==T[i]) j++;
        if(j==m) ans++;
    }
}

int main()
{
    int t;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%s%s",P,T);
        ans = 0;
        KMP();
        printf("%d\n",ans);
    }
    return 0;
}