Pagini recente » Cod sursa (job #2836950) | Cod sursa (job #1028838) | Cod sursa (job #1028842) | Cod sursa (job #2836941) | Cod sursa (job #3293783)
#include <fstream>
#include <string>
#include <vector>
using namespace std;
ifstream cin ("strmatch.in");
ofstream cout ("strmatch.out");
const int N = 4e6;
int z[N + 1];
string s, p;
int nr;
vector <int> sol;
int main()
{
cin >> s >> p;
int m = s.size();
s = s + '@' + p;
for (int i = 1, l = 0, r = 0; i < s.size(); ++i)
{
if (i <= r)
z[i] = min (z[i - l], r - i + 1);
while (i + z[i] < s.size() && s[z[i]] == s[i + z[i]])
++z[i];
if (i + z[i] - 1 > r)
l = i, r = i + z[i] - 1;
}
for (int i = m + 1; i < s.size(); ++i)
if (z[i] == m)
{
++nr;
if (nr <= 1000)
sol.push_back(i - m - 1);
}
cout << nr << '\n';
for (auto it : sol)
cout << it << ' ';
return 0;
}