hdu1686 Oulipo (KMP)

#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<map>
#include<queue>
#include <deque>
#include <list>
#include <ctime>
#include <stack>
#include <vector>
#include<set>
#define Maxn 10050
typedef long long ll;
#define FOR(i,j,n) for(int i=j;i<=n;i++)
#define DFR(i,j,k) for(int i=j;i>=k;--i)
#define lowbit(a) a&-a
#define Max(a,b) a>b?a:b
#define Min(a,b) a>b?b:a
const int inf = 0x3f3f3f3f;
const double pi = acos(-1.0);
using namespace std;
int next[Maxn];
char p[Maxn],t[Maxn*100];
int cnt=0,len1,len2;
void getNext()
{   next[0] = -1;
    int i = 0;
    int j = -1;
    while (i < len1)
    {   if (j == -1 || p[i] == p[j]) next[++i] = ++j;
        else   j = next[j];
    }
}
void kmp()
{
    getNext();
    int i=0,j=0;
    while(i<len2)
    {
        if(j==-1||t[i]==p[j])
        {
            ++i,++j;
            if(j==len1) ++cnt;

        }
        else j=next[j];

    }
}
int main()
{   int T;
    scanf("%d",&T);
    while(T--)
    {   getchar();
        scanf("%s%s",p,t);
        cnt=0;
        len1=strlen(p);
        len2=strlen(t);
        kmp();
        printf("%d\n",cnt);

    }
    return 0;
}