Pagini recente » Cod sursa (job #264558) | Cod sursa (job #776867) | Cod sursa (job #2110888) | Cod sursa (job #1424483) | Cod sursa (job #369340)
Cod sursa(job #369340)
#include<stdio.h>
#include<string.h>
#define NM 2000001
char M[NM],N[NM];
int m,n,U[NM],sol[1009],k;
void prefix(){
int i,j=-1;
U[0]=-1;
for(i=0;i<n;++i){
while(j>-1 && N[i]!=M[j+1]) j=U[j];
if(N[i]==M[j+1]) j++;
if(k<1000){
if(j==m-1) k++,sol[k]=i-m+1;
}
else break;
U[i]=j;
}
}
int main(){
freopen("strmatch.in","r",stdin);
freopen("strmatch.out","w",stdout);
scanf("%s%s",M,N);
m=strlen(M);
n=strlen(N);
prefix();
int i;
printf("%d\n",k);
for(i=1;i<=k;++i) printf("%d ",sol[i]);
return 0;
}