Pagini recente » Cod sursa (job #2989441) | Cod sursa (job #2859414) | Cod sursa (job #3167176) | Cod sursa (job #790440) | Cod sursa (job #3292637)
#include <fstream>
#include <string>
#include <vector>
using namespace std;
ifstream cin("strmatch.in");
ofstream cout("strmatch.out");
string a, b, sir;
int kmp[4000002];
int main()
{
vector<int> rez;
cin>>a>>b;
sir = "&";
sir += a;
sir += "$";
sir += b;
int n = sir.size(), nrsecv = 0;
int la = a.size();
kmp[1] = 0;
for(int i = 2; i < n; ++i)
{
int k = kmp[i - 1];
while(k != 0 && sir[i] != sir[k + 1])
{
k = kmp[k];
}
if(sir[i] == sir[k+1])
{
kmp[i] = k + 1;
}
if(kmp[i] == la)
{
++nrsecv;
if(nrsecv <= 1000)
{
rez.push_back(i);
}
}
}
cout<<nrsecv<<"\n";
for(auto i : rez)
{
cout<<i - 2 * la - 1<<" ";
}
return 0;
}