Pagini recente » Cod sursa (job #1884231) | Cod sursa (job #1774010) | Cod sursa (job #2942720) | Cod sursa (job #2573733) | Cod sursa (job #3160614)
#include <iostream>
#include <cmath>
#include <vector>
#include <string>
using namespace std;
int lps[2000001];
string pat,text;
int main()
{
cin>>pat;
cin>>text;
pat.push_back('#');
int k=0;
for(int i=1; i<pat.size(); i++)
{
while(k!=0&&pat[i]!=pat[k])
k=lps[k-1];
if(pat[k]==pat[i])
k++;
lps[i]=k;
}
vector<int> ans;
k=0;
for(int i=0; i<text.size(); i++)
{
while(k!=0&&text[i]!=pat[k])
k=lps[k-1];
if(pat[k]==text[i])
k++;
if(k>=pat.size()-1)
ans.push_back(i-(pat.size()-1)+1);
}
cout<<ans.size()<<'\n';
for(int i=0;i<min(1000,(int)ans.size());i++)
cout<<ans[i]<<" ";
return 0;
}