Pagini recente » Cod sursa (job #3298588) | Cod sursa (job #3278945) | Cod sursa (job #2775097) | Cod sursa (job #3296120) | Cod sursa (job #2477721)
#include <fstream>
#include <vector>
#include <string>
using namespace std;
int main()
{
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
string s, t;
fin >> s >> t;
int p = s.size();
s = s + "$" + t;
vector <int> pi(s.size() + 5, 0);
for (int i = 1, k = 0;i < s.size();++i)
{
for (;k > 0 && s[k] != s[i];k = pi[k - 1]);
if (s[k] == s[i])
++k;
pi[i] = k;
}
vector <int> sol;
int cnt = 0;
for (int i = p + 1;i < s.size();++i)
{
if (pi[i] == p)
{
++cnt;
if (cnt < 1000)
sol.push_back(i - 2 * p);
}
}
fout << cnt << "\n";
for (auto &x : sol)
fout << x << " ";
fin.close();
fout.close();
return 0;
}