Pagini recente » Cod sursa (job #573305) | Cod sursa (job #838877) | Cod sursa (job #3156632) | Cod sursa (job #2665050) | Cod sursa (job #2416117)
#include <bits/stdc++.h>
using namespace std;
char A[2000010],B[2000010];
int d[2000010],ans[1010];
int main()
{
freopen("strmatch.in","r",stdin);
freopen("strmatch.out","w",stdout);
scanf("%s\n",A+1);
scanf("%s",B+1);
int c=strlen(A+1),k=0,l=strlen(B+1),r=0,sol=0;
for(int i=2;i<=c;i++)
{
while(k>0 && A[i]!=A[k+1]) k=d[k];
if(A[i]==A[k+1]) k++;
d[i]=k;
}
k=0;
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==c)
{
sol++;
if(r<1000) ans[++r]=i-c;
}
}
printf("%d\n",sol);
for(int i=1;i<=r;i++) printf("%d ",ans[i]);
return 0;
}