Pagini recente » Cod sursa (job #1599225) | Cod sursa (job #140293) | Cod sursa (job #1658454) | Cod sursa (job #3216224) | Cod sursa (job #235782)
Cod sursa(job #235782)
# include <stdio.h>
# include <string.h>
# define nmax 2000002
char A[nmax],B[nmax];
int Prefix[nmax], p[1024];
int n,m;
void prefix(void)
{
int k=-1, i;
Prefix[0]=-1;
for (i=1;i<n;i++){
while (k>-1 && A[k+1]!=A[i])
k=Prefix[k];
if (A[k+1]==A[i]) k++;
Prefix[i]=k;
}
}
int main(){
int j=0,k,i;
freopen("strmatch.in", "r", stdin);
freopen("strmatch.out", "w", stdout);
gets(A); n=strlen(A);
gets(B); m=strlen(B);
prefix();
k=-1;
for (i=0;i<m;i++){
while (k>-1 && A[k+1]!=B[i]) k=Prefix[k];
if (A[k+1]==B[i]) k++;
if (k==n-1){
k=Prefix[n-1],j++;
if (j<=1000) p[j]=i-n+1;
}
}
printf("%d\n",j);
if (j>1000) j=1000;
for (i=1;i<=j;i++)
printf("%d ", p[i]);
return 0;
}