Pagini recente » Cod sursa (job #3196904) | Cod sursa (job #2596453) | Cod sursa (job #333803) | Cod sursa (job #2095880) | Cod sursa (job #144287)
Cod sursa(job #144287)
#include <stdio.h>
#include <string.h>
#define mx 1<<21
long i,h,n,m,p;
long pi[mx];
long v[1024];
char s1[mx],s2[mx];
void prefix()
{
pi[1]=0;
p=0;
for (i=1; i<m; i++)
{
while (p>0 && s1[i]!=s1[p+1])
p=pi[p];
if (s1[i]==s1[p+1])
p++;
pi[p]=p;
}
}
void kmp()
{
n=strlen(s1);
m=strlen(s2);
prefix();
p=0;
h=0;
for (i=0; i<=n; i++)
{
while (p!=0 && s2[i]!=s1[p+1])
p=pi[p];
if (s2[i]==s1[p+1])
p++;
if (p==m)
{
h++;
p=pi[p];
if (h<=1000)
v[h]=i-m;
}
}
}
int main()
{
freopen("strmatch.in","r",stdin);
freopen("strmatch.out","w",stdout);
fgets(s1,mx,stdin);
fgets(s2,mx,stdin);
kmp();
printf("%ld\n",h);
if (h>1000)
h=1000;
for (i=1; i<=h; i++)
printf("%ld ",v[i]);
fclose(stdin);
fclose(stdout);
return 0;
}