Pagini recente » Cod sursa (job #2471643) | Cod sursa (job #2209540) | Cod sursa (job #2834537) | Cod sursa (job #3151641) | Cod sursa (job #151739)
Cod sursa(job #151739)
#include <stdio.h>
#include <string.h>
using namespace std;
inline long min(long a,long b)
{
return a<b ? a : b;
}
char a[2000005],b[2000005];
int pi[2000005];
int main()
{
freopen("strmatch.in","r",stdin);
freopen("strmatch.out","w",stdout);
scanf("%s\n%s\n",&a,&b);
long m=strlen(a),n=strlen(b),i,q=0,nr=0,pos[1024];
for (i=m;i>0;i--)
a[i]=a[i-1];
a[0]=' ';
for (i=n;i>0;i--)
b[i]=b[i-1];
b[0]=' ';
pi[1]=0;
for (i=2;i<=m;i++)
{
while (q&&a[q+1]!=a[i])
q=pi[q];
if (a[q+1]==a[i])
q++;
pi[i]=q;
}
q=0;
for (i=1;i<=n;i++)
{
while (q&&a[q+1]!=b[i])
q=pi[q];
if (a[q+1]==b[i])
q++;
if (q==m)
{
q=pi[m];
if (nr<1000)
{
pos[nr]=i-m;
nr++;
}
}
}
printf("%ld\n",nr);
for (i=0;i<min(nr,1000);i++)
printf("%ld ",pos[i]);
return 0;
}