Pagini recente » Cod sursa (job #1591012) | Cod sursa (job #218696) | Cod sursa (job #1597782) | Cod sursa (job #1090054) | Cod sursa (job #2297726)
#include <cstdio>
#include <string.h>
using namespace std;
char s1[2000005];
char s2[2000005];
int p[2000005];
char a[2000005];
int n, m;
int nr=0;
void constr_p()
{
int i=0;
int j=-1;
p[0]=-1;
while(i<m)
{
while(j>=0 && s1[i]!=s1[j])
j=p[j];
i++;
j++;
p[i]=j;
}
}
int main()
{
freopen("strmatch.in","r",stdin);
freopen("strmatch.out","w",stdout);
scanf("%s\n",s1);
scanf("%s",s2);
m=strlen(s1);
n=strlen(s2);
constr_p();
int i=0;
int j=0;
while(i<n)
{
while(j>=0 && s2[i]!=s1[j])
{
j=p[j];
}
i++;
j++;
if(j==m)
{
j=p[j];
nr++;
if(nr<=1000)
a[nr]=i-m;
}
}
printf("%d\n",nr);
if(nr>1000)
nr=1000;
for(int i=1; i<=nr; i++)
printf("%d ",a[i]);
return 0;
}