Pagini recente » Cod sursa (job #2377549) | Cod sursa (job #1962305) | Cod sursa (job #2550357) | Cod sursa (job #1501416) | Cod sursa (job #2174068)
#include <cstdio>
#include <cstring>
using namespace std;
char sir1[2000010],sir2[2000010];
int d[2000010],rez[1010];
int main()
{
freopen("strmatch.in","r",stdin);
freopen("strmatch.out","w",stdout);
gets(sir1+1);
int l1=strlen(sir1+1);
gets(sir2+1);
int l2=strlen(sir2+1);
int k=0;
for(int i=2;i<=l1;i++)
{
while(k>0 && sir1[i]!=sir1[k+1]) k=d[k];
if(sir1[i]==sir1[k+1]) k++;
d[i]=k;
}
k=0;
int l=0,sol=0;
for(int i=1;i<=l2;i++)
{
while(k>0 && sir2[i]!=sir1[k+1]) k=d[k];
if(sir2[i]==sir1[k+1]) k++;
if(k==l1)
{
sol++;
if(l<1000) rez[++l]=i-k;
k=d[k];
}
}
printf("%d\n",sol);
for(int i=1;i<=l;i++) printf("%d ",rez[i]);
return 0;
}