Pagini recente » Cod sursa (job #223872) | Cod sursa (job #1474490) | Cod sursa (job #1200520) | Cod sursa (job #1681914) | Cod sursa (job #570545)
Cod sursa(job #570545)
#include<stdio.h>
#include<string.h>
char s[2000000],a[2000000];
int p[2000000];
int d[1004];
int n,m;
int nr=0;
void calculprefix()
{
int k = 0;
p[0] = 0;
for(int i=1;i<n;i++)
{
while(k > 0 && s[k + 1]!=s[i])
k = p[k];
if(s[k + 1] == s[i])
k = k + 1;
p[i] = k;
}
}
void kmp()
{
int k=0;
for(int i=0;i<m && nr<=1000;i++)
{
while(k > 0 && s[k + 1]!=a[i])
k = p[k];
if(s[k + 1] == a[i])
k = k + 1;
if(k==n)
{ nr++;
d[nr]=i-n+1;
}
}
}
int main()
{
freopen("strmatch.in","r",stdin);
freopen("strmatch.out","w",stdout);
scanf("%s", &s);
scanf("%s", &a);
n = strlen(s);
m = strlen(a);
calculprefix();
kmp();
printf("%d\n", nr);
for(int i=1;i<=nr;i++)
printf("%d ", d[i]);
return 1;
}