Pagini recente » Cod sursa (job #2635965) | Cod sursa (job #2717580) | Cod sursa (job #2143815) | Cod sursa (job #1469008) | Cod sursa (job #3151154)
#include <bits/stdc++.h>
using namespace std;
int pi[4000003];///pi[i] = cel mai lung prefix propriu al sirului s(1..i) care este si sufix al sirului s(1..i)
int afis[1001];
char a[2000001], b[2000001];
string s;
int main()
{
freopen("strmatch.in", "r", stdin);
freopen("strmatch.out", "w", stdout);
fgets(a, sizeof(a), stdin);
fgets(b, sizeof(b), stdin);
int cnt = 0;
int na = strlen(a) - 1, nb = strlen(b) - 1;
s += '$';
for(int i = 0; i < na; i++)
s += a[i];
s += '$';
for(int i = 0; i < nb; i++)
s += b[i];
for(int i = 2; i < s.size(); i++)
{
pi[i] = pi[i - 1];
while(pi[i] && s[pi[i] + 1] != s[i])
pi[i] = pi[pi[i]];
if(s[pi[i] + 1] == s[i])
pi[i]++;
}
for(int i = 1; i < s.size(); i++)
if(pi[i] == na)
{
cnt++;
if(cnt <= 1000)
afis[cnt] = i - na + 1 - na - 2;
}
cout << cnt << '\n';
for(int i = 1; i <= min(cnt, 1000); i++)
cout << afis[i] << " ";
return 0;
}