Pagini recente » Cod sursa (job #270525) | Cod sursa (job #1145161) | Cod sursa (job #568743) | Cod sursa (job #2785209) | Cod sursa (job #2883124)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
const int NMAX = 2e6 + 6;
int pi[3 * NMAX];
void buildPi(string &a)
{
int i, j;
pi[0] = 0;
for(i = 1; i < a.length(); ++i)
{
j = pi[i-1];
while(j != 0 && a[j] != a[i])
j = pi[j-1];
if(a[j] == a[i])
++j;
pi[i] = j;
}
}
int main()
{
string a, b;
vector <int> sol;
fin >> a >> b;
int i, siz = a.length();
i = a.length() + 1;
a = a + "#" + b;
buildPi(a);
for(; i < a.length(); ++i)
if(pi[i] == siz)
sol.push_back(i - (siz + 1) - siz + 1);
fout << sol.size() << '\n';
int j = 0;
for(auto &it: sol)
{
++j;
fout << it << ' ';
if(j == 1000)
break ;
}
return 0;
}