Pagini recente » Cod sursa (job #207567) | Cod sursa (job #1145587) | Cod sursa (job #654797) | Cod sursa (job #1201088) | Cod sursa (job #1820346)
#include <iostream>
#include<cstring>
#include<cstdio>
using namespace std;
int urm[100],n,m,nr,apar[1001];
char t[2000001],p[2000001];
void urmator(char p[])
{
int m=strlen(p);
urm[0]=-1;
int k=-1;
for(int q=1;q<m;q++)
{
while(k>-1&&p[k+1]!=p[q])
k=urm[k];
if(p[k+1]==p[q])k++;
urm[q]=k;
}
}
int main()
{
freopen("strmatch.in","r",stdin);
freopen("strmatch.out","w",stdout);
scanf("%s %s", p, t);
n=strlen(t);
m=strlen(p);
urmator(p);
int q=-1;
for(int i=0;i<n;i++)
{
while(q>-1&&p[q+1]!=t[i])
q=urm[q];
if(p[q+1]==t[i])
q++;
if(q==m-1)
{
if(nr<1000)
apar[nr]=i-m+1;
nr++;
q=urm[q];
}
}
printf("%d\n",nr);
for(int i=0;i<nr;i++)
printf("%d ",apar[i]);
return 0;
}