Pagini recente » Cod sursa (job #3271659) | Cod sursa (job #601459) | Cod sursa (job #1088228) | Borderou de evaluare (job #2008085) | Cod sursa (job #1820378)
#include <iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int urm[2000005],n,m,nr,apar[1005];
char t[2000005],p[2000005];
void urmator(char p[])
{
int m=strlen(p+1);
urm[1]=0;
int q=0;
for(int i=2;i<=m;i++)
{
while(q>0&&p[q+1]!=p[i])
q=urm[q];
if(p[q+1]==p[i])q++;
urm[i]=q;
}
}
int main()
{
freopen("strmatch.in","r",stdin);
freopen("strmatch.out","w",stdout);
scanf("%s %s", p+1, t+1);
p[0]=' ';
t[0]=' ';
n=strlen(t+1);
m=strlen(p+1);
urmator(p);
int q=0;
for(int i=1;i<=n;i++)
{
while(q>0&&p[q+1]!=t[i])
q=urm[q];
if(p[q+1]==t[i])
q++;
if(q==m)
{
q=urm[q];
if(nr<1000)
apar[nr]=i-m;
nr++;
}
}
printf("%d\n",nr);
for(int i=0;i<nr;i++)
printf("%d ",apar[i]);
return 0;
}