#include<bits/stdc++.h>
using namespace std;
int Next[1000];
int Kmp_Search(char* s, char* p)
{
int i = 0;
int j = 0;
int sLen = strlen(s);
int pLen = strlen(p);
while (i < sLen && j < pLen)
{
if (j == -1 || s[i] == p[j])
{
i++;
j++;
}
else
{
j = Next[j];
}
}
if (j == pLen)
return i - j;
else
return -1;
}
void Get_Next(char* p,int* next)
{
int pLen = strlen(p);
next[0] = -1;
int k = -1;
int j = 0;// ABCDABD
while (j < pLen - 1){
if (k == -1 || p[j] == p[k]){
++k;
++j;
next[j]=k;
}
else k = next[k];
}
}
int main()
{
}