[KMP]POJ 3416——Oulipo

题目传送门
又水blog了，对，我不解释了
这题就是裸的KMP求方案数

#include<cstdio>
#include<cstring>
using namespace std;
const int maxn=1000005;
int t,n,m,ans,fail[maxn];
char a[maxn],b[maxn];
void work(){
    int j=0;
    for (int i=2;i<=m;i++){
        while(j>0&&b[j+1]!=b[i]) j=fail[j];
        if (b[j+1]==b[i]) j++;
        fail[i]=j;
    }
}
void KMP(){
    int j=0;
    for (int i=1;i<=n;i++){
        while(j>0&&b[j+1]!=a[i]) j=fail[j];
        if (b[j+1]==a[i]) j++;
        if (j==m) ans++,j=fail[j];
    }
}
int main(){
    freopen("exam.in","r",stdin);
    freopen("exam.out","w",stdout);
    scanf("%d",&t);
    while (t--){
        memset(fail,0,sizeof(fail));
        ans=n=m=0;
        char ch=getchar();
        while (ch<'A'||ch>'Z') ch=getchar();
        while (ch>='A'&&ch<='Z') b[++m]=ch,ch=getchar();
        while (ch<'A'||ch>'Z') ch=getchar();
        while (ch>='A'&&ch<='Z') a[++n]=ch,ch=getchar();
        work();KMP();
        printf("%d\n",ans);
    }
}