Pagini recente » Cod sursa (job #2269221) | Cod sursa (job #1611326) | Cod sursa (job #301745) | Cod sursa (job #1091027) | Cod sursa (job #3222251)
#include <bits/stdc++.h>
using namespace std;
const string TASK("strmatch");
ifstream fin(TASK + ".in");
ofstream fout(TASK + ".out");
#define cin fin
#define cout fout
const int N = 2e6 + 9;
string s, b;
int z[N];
int main()
{
cin >> s >> b;
int tar = s.size();
s.push_back('#');
s += b;
int l = 0, r = 0, n = s.size();
for(int i = 0; i < n; ++i)
{
if(i < r)z[i] = z[i - l];
while(i + z[i] < n && s[i + z[i]] == s[z[i]])++ z[i];
if(z[i] > r)
{
l = i;
r = r + z[i];
}
}
vector<int> ans;
for(int i = 0; i < n; ++i)
if(z[i] == tar && ans.size() < 1000)
ans.push_back(i - tar - 1);
cout << ans.size() << '\n';
for(auto i : ans)cout << i << ' ';
return 0;
}