Pagini recente » Cod sursa (job #2518758) | Cod sursa (job #2345583) | Cod sursa (job #2916046) | Cod sursa (job #419474) | Cod sursa (job #2373677)
#include <bits/stdc++.h>
using namespace std;
char A[2000010],B[2000010];
int d[2000010],v[1010];
int main()
{
freopen("strmatch.in","r",stdin);
freopen("strmatch.out","w",stdout);
scanf("%s\n",A+1);
scanf("%s",B+1);
int l1=strlen(A+1),k=0;
for(int i=2;i<=l1;i++)
{
while(k>0 && A[i]!=A[k+1]) k=d[k];
if(A[i]==A[k+1]) k++;
d[i]=k;
}
k=0;
int nr=0,ans=0,l=strlen(B+1);
for(int i=1;i<=l;i++)
{
while(k>0 && B[i]!=A[k+1]) k=d[k];
if(B[i]==A[k+1]) k++;
if(k==l1)
{
ans++;
if(nr<1000) v[++nr]=i-k;
}
}
printf("%d\n",ans);
for(int i=1;i<=nr;i++) printf("%d ",v[i]);
return 0;
}