Pagini recente » Cod sursa (job #640504) | Cod sursa (job #1491969) | Borderou de evaluare (job #2493485) | Cod sursa (job #120501) | Cod sursa (job #2375695)
#include <fstream>
#include <vector>
using namespace std;
ifstream in("strmatch.in");
ofstream out("strmatch.out");
int main()
{
int w = -1;
string A, B;
in >> A >> B;
vector<int> sol;
vector<int> pi(A.size() + 1);
pi[0] = -1;
for (int i = 1; i < A.size(); i++)
{
while (w != -1 && A[w + 1] != A[i])
w = pi[w];
if (A[w + 1] == A[i])
w++;
pi[i] = w;
}
w = -1;
for (int i = 0; i < B.size(); i++)
{
while (w != -1 && A[w + 1] != B[i])
w = pi[w];
if (A[w + 1] == B[i])
w++;
if (w == A.size() - 1)
{
if (sol.size() < 1000)
sol.push_back(i - A.size() + 1);
w = pi[w];
}
}
out << sol.size() << '\n';
for (int i = 0; i < sol.size(); i++)
out << sol[i] << ' ';
return 0;
}