hdu 2594 kmp
#include<stdio.h>
#define N 51000
void getkmp(int next[],char s[]) {
int j=0,k=-1;
next[0]=-1;
while(s[j]!=0) {
if(k==-1||s[j]==s[k]) {
j++;k++;
if(s[j]!=s[k])
next[j]=k;
else
next[j]=next[k];
}
else
k=next[k];
}
}
int kmp(char t[],char s[],int next[]) {
int i=0,j=0;
while(s[i]!=0) {
if(t[j]==s[i])
i++,j++;
else {
j=next[j];
if(j==-1)j=0,i++;
}
}
t[j]=0;
return j;
}
int main() {
int next1[N],len;
char s1[N],s2[N];
while(scanf("%s%s",s1,s2)!=EOF) {
getkmp(next1,s1);
len=kmp(s1,s2,next1);
if(len)
printf("%s %d ",s1,len);
else
printf("0 ");
}
return 0;
}
#define N 51000
void getkmp(int next[],char s[]) {
int j=0,k=-1;
next[0]=-1;
while(s[j]!=0) {
if(k==-1||s[j]==s[k]) {
j++;k++;
if(s[j]!=s[k])
next[j]=k;
else
next[j]=next[k];
}
else
k=next[k];
}
}
int kmp(char t[],char s[],int next[]) {
int i=0,j=0;
while(s[i]!=0) {
if(t[j]==s[i])
i++,j++;
else {
j=next[j];
if(j==-1)j=0,i++;
}
}
t[j]=0;
return j;
}
int main() {
int next1[N],len;
char s1[N],s2[N];
while(scanf("%s%s",s1,s2)!=EOF) {
getkmp(next1,s1);
len=kmp(s1,s2,next1);
if(len)
printf("%s %d ",s1,len);
else
printf("0 ");
}
return 0;
}