kmp

#include<iostream>
#include<string>
#include<cstring>
using namespace std;

void kmp_pre(char x[], int m, int Next[])
{
    int i, j;
    j = Next[0] = -1;
    i = 0;
    while (i < m)
    {
        int mark1=j,mark2=j;
        while (-1 != j && x[i] != x[j]) mark1=j,j = Next[j],mark2 = j;
        Next[++i] = ++j;
        cout << "(" << i <<","<< mark1<<" " <<mark2 << " " << j << ")";
    }
    cout << endl;
}
int Next[10010];
int KMP_Count(char x[], int m, char y[], int n)
{
    int i, j;
    int ans = 0;
    kmp_pre(x, m, Next);
    for (int i = 0; i < m+1; i++)
        cout << Next[i]<<" ";
    cout << endl;
    i = j = 0;
    while (i < n)
    {
        while (-1 != j && y[i] != x[j]) j = Next[j];
        i++; j++;
        if (j >= m)
        {
            ans++;
            j = Next[j];
        }
    }
    return ans;
}
int main()
{
    char a[100], b[100];
    cin >> a >> b;
    int lena = strlen(a), lenb = strlen(b);
    cout << KMP_Count(a, lena, b, lenb) << endl;
    return 0;
}