Pagini recente » Cod sursa (job #2740861) | Cod sursa (job #722796) | Cod sursa (job #1604050) | Cod sursa (job #2687006) | Cod sursa (job #846159)
Cod sursa(job #846159)
#include <stdio.h>
#define Max 2000001
char a[Max],b[Max];
int u[Max],p[1001],d,n,nr;
void prefix()
{
int k=-1;
u[0]=k;
for(int i=1;a[i]!='\0' && a[i]!='\n';n=++i)
{
while(k>-1 && a[k+1]!=a[i])k=u[k];
if(a[k+1]==a[i])k++;
u[i]=k;
}
}
void kmp()
{
int k=-1;
for(int i=0;b[i]!='\0' && b[i]!='\n';++i)
{
while(k>-1 && a[k+1]!=b[i])k=u[k];
if(a[k+1]==b[i])k++;
if(k==n-1)
{
nr++;
if(nr<=1000)p[++d]=i-n+1;
k=u[k];
}
}
}
int main()
{
freopen("test.in","r",stdin);
freopen("test.out","w",stdout);
scanf("%s ",a);
scanf("%s ",b);
prefix();
kmp();
printf("%d\n",nr);
if(nr>1000)nr=1000;
for(int i=1;i<=nr;i++)printf("%d ",p[i]);
return 0;
}