杭电1686-KMP模板题

#include <stdio.h>
char W[10010],T[1000010];
int Next[10010];
void getNext()
{
    int len=strlen(W);
    int i,j;
    i=0;
    j=-1;
    Next[0]=-1;
    while(i<len)
    {
        if(j==-1||W[i]==W[j])
        {
            i++;
            j++;
            Next[i]=j;
        }
        else j=Next[j];
    }
}
/*void printNext()
{
    int len=strlen(W);
    int i;
    for(i=0;i<len;i++)
        printf("%d ",Next[i]);
    printf("\n");
}*/
int Kmp()
{
    int len1=strlen(W);
    int len2=strlen(T);
    int Count=0;
    int i=-1;
    int j=-1;
    while(j<len2)
    {
        if(i==-1||W[i]==T[j])
        {
            i++;
            j++;
            if(i==len1)
            {
                Count++;
            }
        }
        else i=Next[i];
    }
    if(Count!=0)return Count;
    else return -1;
}
int main()
{
    int N,outCome;
    scanf("%d",&N);
    while(N--)
    {
        scanf("%s %s",W,T);
        getNext();
       // printNext();
        outCome=Kmp();
        if(outCome!=-1)
            printf("%d\n",outCome);
        else printf("0\n");
    }
return 0;
}