Pagini recente » Cod sursa (job #2143381) | Cod sursa (job #2346320) | Cod sursa (job #102431) | Cod sursa (job #2369384) | Cod sursa (job #3156602)
#include <fstream>
#include <string>
using namespace std;
ifstream cin ("strmatch.in");
ofstream cout ("strmatch.out");
const int N = 1e6;
int z[N + 1];
string pat, s;
int main()
{
cin >> pat >> s;
s = pat + '@' + s;
int n = s.size();
int m = pat.size();
for (int i = 1, l = 0, r = 0; i < n; ++i)
{
if (i <= r)
z[i] = min (z[i - l], r - i + 1);
while (i + z[i] < n && s[i + z[i]] == s[z[i]])
++z[i];
if (i + z[i] - 1 > r)
r = i + z[i] - 1, l = i;
}
int nr = 0;
for (int i = m + 1; i < n; ++i)
if (z[i] == m)++nr;
cout << nr << '\n';
nr = 0;
for (int i = m + 1; i < n; ++i)
if (z[i] == m && nr + 1 <= 1000)
++nr, cout << i - m - 1 << ' ';
return 0;
}