Pagini recente » Cod sursa (job #893508) | Cod sursa (job #2951816) | Cod sursa (job #2334408) | Cod sursa (job #2460968) | Cod sursa (job #1495635)
#include<stdio.h>
#include<string.h>
#define N 2000099
char a[N+1],b[N+1];
int sol[1009],pi[N+1];
int main()
{
freopen("strmatch.in","r",stdin);
freopen("strmatch.out","w",stdout);
scanf("%s %s",a+1,b+1);
int n=strlen(a+1),m=strlen(b+1);
int k=0,i;
for(i=2;i<=n;i++){
while(k!=0&&a[i]!=a[k+1])
k=pi[k];
if(a[i]==a[k+1])
k++;
pi[i]=k;
//printf("%d ",pi[i]);
}
int nr=0;
k=0;
for(i=1;i<=m;i++){
while(k!=0&&b[i]!=a[k+1])
k=pi[k];
if(b[i]==a[k+1])
k++;
if(k==n&&nr<1000)
sol[nr++]=i-n;
}
printf("%d\n",nr);
if(nr>1000)
for(i=0;i<1000;i++)
printf("%d ",sol[i]);
else
for(i=0;i<nr;i++)
printf("%d ",sol[i]);
return 0;
}