Pagini recente » Cod sursa (job #1038903) | Cod sursa (job #2205135) | Cod sursa (job #893210) | Cod sursa (job #2818597) | Cod sursa (job #2350913)
#include <iostream>
#include <cstdio>
#include <string.h>
using namespace std;
char a[2000003];
char b[2000003];
int prefix[2000003];
int n, m;
int v[2000002], l;
void pref()
{
int k = 0;
for(int i = 2; i<=n; i++)
{
while(a[i] != a[k+1] && k!=0)
{
k = prefix[k];
}
if(a[i] == a[k+1])
{
k++;
}
prefix[i] = k;
}
}
void rez()
{
fgets(a+1, 2000002, stdin);
fgets(b+1, 2000002, stdin);
n = strlen(a+1)-1;
m = strlen(b+1)-1;
pref();
/*for(int i = 1; i<=n; i++)
{
printf("%d ", prefix[i]);
}*/
int k = 0;
for(int i = 1; i<=m; i++)
{
while(b[i] != a[k+1] && k!=0)
{
k = prefix[k];
}
if(b[i] == a[k+1])
k++;
if(k >= n)
{
if(l<1000)
v[l++] = i-n;
else
l++;
}
}
printf("%d\n", l);
for(int i = 0; i<l && i<1000; i++)
printf("%d ", v[i]);
}
int main()
{
freopen("strmatch.in", "r", stdin);
freopen("strmatch.out", "w", stdout);
rez();
return 0;
}