Pagini recente » Cod sursa (job #2307203) | Cod sursa (job #156173) | Cod sursa (job #921416) | Cod sursa (job #1105782) | Cod sursa (job #186922)
Cod sursa(job #186922)
#include <stdio.h>
#include <string.h>
#define MAX 2000001
char a[MAX],b[MAX];
int urm[MAX],n,m;
void urmatorul(){
long k,x;
k=-1;
urm[0]=0;
for(x=1;x<m;x++){
while(k>0&&b[k+1]!=b[x])k=urm[x];
if(b[k+1]==b[x])k++;
urm[x]=k;
}
}
int main(){
freopen("strmatch.in","r",stdin);
freopen("strmatch.out","w",stdout);
gets(b); gets(a);
n=strlen(a);
m=strlen(b);
long v[1001],x,i;
int c;
c=0;
x=-1;
for(i=0;i<n;i++){
if(c==1000)i=n+1;
while(x>0&&b[x+1]!=a[i])x=urm[x];
if(b[x+1]==a[i])x++;
if(x==m-1&&c<1000){
v[++c]=i-m+1;
x=urm[x];
}
}
printf("%d\n",c);
for(i=1;i<=c;i++)printf("%ld ",v[i]);
// printf("%s",b);
fclose(stdin);
fclose(stdout);
return 0;
}