POJ3461 Oulipo

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int size=1000020,p=131;
typedef unsigned long long ULL;
ULL f[size],key[size]; 
int T;
char tmp1[size],tmp2[size];
int main(){
    f[0]=1;
    for(int i=1;i<=size;++i) f[i]=f[i-1]*p;
    scanf("%d",&T);
    while(T--){
        scanf("%s%s",tmp1+1,tmp2+1);
        int len1=strlen(tmp1+1),len2=strlen(tmp2+1);
        for(int i=1;i<=len2;++i) key[i]=key[i-1]*p+(ULL)(tmp2[i]);
        ULL key_tmp1=0;int ans=0;
        for(int i=1;i<=len1;++i) key_tmp1=key_tmp1*p+(ULL)tmp1[i];
        for(int i=0;i<=len2-len1;++i) if(key[i+len1]-key[i]*f[len1]==key_tmp1) ++ans;
        printf("%d
",ans);
    }
    return 0;
}

//KMP
#include<iostream>
#include<cstdio>
#include<stack>
#include<cstring>
#include<algorithm>
#include<vector>
using namespace std;
const int size=1000005;
char a[size],b[size];
int Nex[size],lena,lenb,T,ans;
void init(char *s){
    for(int i=2,j=0;i<=lenb;++i){
        while(j>0&&s[j+1]!=s[i]) j=Nex[j];
        if(s[j+1]==s[i]) ++j;
        Nex[i]=j;
    }
}
void kmp(char *a,char *b){
    memset(Nex,0,sizeof(Nex));
    init(b);
    for(int i=1,j=0;a[i];++i){
        while(j&&a[i]!=b[j+1]) j=Nex[j];
        if(a[i]==b[j+1]) ++j;
        if(j==lenb) ++ans,j=Nex[j];
    }
}
int main(){
    scanf("%d",&T);
    while(T--){
        ans=0;
        scanf("%s%s",b+1,a+1);
        lena=strlen(a+1),lenb=strlen(b+1);
        kmp(a,b);
        printf("%d
",ans);
    }
    return 0;
}