Pagini recente » Cod sursa (job #2293355) | Cod sursa (job #1182516) | Cod sursa (job #1450346) | Cod sursa (job #438276) | Cod sursa (job #2791199)
#include <iostream>
#include <cstring>
#include <cstdio>
#define NMAX 2000001
#define MOD1 66660613
#define MOD2 77773013
using namespace std;
char s1[NMAX], s2[NMAX];
long long l1, l2;
int nr, a[1005], p[100005];
void citire()
{
scanf("%s\n%s", s1, s2);
l1=strlen(s1);
l2=strlen(s2);
}
void prefix()
{
int j=-1, i=0;
p[0]=-1;
while(i<l1)
{
while(j>=0 && s1[i]!=s1[j])
j=p[j];
j++;
i++;
p[i]=j;
}
}
void kmp()
{
int j=0, i=0;
while(i<l2)
{
while(j>=0 && s2[i]!=s1[j])
j=p[j];
j++;
i++;
if(j==l1)
{
j=p[j];
if(nr<=1000)
a[nr++]=i-l1;
}
}
}
void afisare()
{
printf("%d\n", nr);
for(int i=0; i<(nr<=1000?nr:1000); ++i)
printf("%d ", a[i]);
}
int main()
{
freopen("strmatch.in", "r", stdin);
freopen("strmatch.out", "w", stdout);
citire();
prefix();
kmp();
afisare();
return 0;
}