Pagini recente » Cod sursa (job #444985) | Cod sursa (job #1806114) | Cod sursa (job #1016783) | Cod sursa (job #2938306) | Cod sursa (job #2449531)
#include <bits/stdc++.h>
using namespace std;
int main()
{
ifstream fin("strmatch.in");
string s, p;
fin >> p;
fin >> s;
fin.close();
long a[2000005];
long sol = 0, j = 0;
vector<long> v;
a[0] = 0;
for (long i = 1; i < p.length();)
if (p[j] == p[i])
{
a[i] = j + 1;
++i;
++j;
}
else if (j != 0)
j = a[j - 1];
else
{
a[i] = 0;
++i;
}
j = 0;
for (long i = 0; i < s.length();)
{
if (s[i] == p[j])
{
++i;
++j;
}
else if (j != 0)
{
j = a[j - 1];
}
else
{
++i;
}
if (j == p.length())
{
++sol;
if (v.size() < 1000)
v.push_back(i - p.length());
j = a[j - 1];
}
}
ofstream fout("strmatch.out");
fout << sol << '\n';
for (int i = 0; i < v.size(); ++i)
fout << v[i] << ' ';
fout.close();
return 0;
}