Pagini recente » Cod sursa (job #1879835) | Cod sursa (job #3280173) | Cod sursa (job #354095) | Cod sursa (job #2039499) | Cod sursa (job #2647432)
#include <iostream>
#include <stdio.h>
#include <bits/stdc++.h>
#define NMAX 2000003
using namespace std;
int n,m,i,k,nr,nr2;
int urm[NMAX];
int v[NMAX];
char t[NMAX];
char p[NMAX];
void make_prefix(){
int i,k=-1;
urm[0]=0;
for(i=1;i<m;i++){
while(k>0 && p[k+1]!=p[i])
k=urm[k];
if(p[k+1]==p[i])k++;
urm[i]=k;
}
}
int main()
{
freopen("strmatch.in","r",stdin);
freopen("strmatch.out","w",stdout);
gets(p);
gets(t);
n=strlen(t);
m=strlen(p);
make_prefix();
k=-1;
for(i=0;i<n;i++){
while(k && p[k+1]!=t[i])
k=urm[k];
if(p[k+1]==t[i])
k++;
if(k==m-1){
v[++nr2]=i-m+1;
k=urm[k];
}
}
printf("%d\n",min(1000,nr2));
for(i=1;i<=min(nr2,1000);i++)
printf("%d ",v[i]);
return 0;
}