Pagini recente » Cod sursa (job #188643) | Cod sursa (job #253390) | Cod sursa (job #254112) | Cod sursa (job #405814) | Cod sursa (job #1435588)
#include<fstream>
#include<string>
#include<vector>
using namespace std;
const int N=4000103;
ifstream cin("strmatch.in");
ofstream cout("strmatch.out");
string s,p,t;
int n,i,j;
vector<int> pi(N),sol;
int main()
{
cin>>p>>t; s=p+'*'+t; n=s.length();
for (i=1;i<n;i++){
j=pi[i-1];
while(j>0 && s[i]!=s[j])j=pi[j-1];
pi[i]=(j+=(s[i]==s[j]));
}
for (i=0;i<t.size();i++)
if (pi[i+p.size()+1]==p.size())
sol.push_back(i-p.size()+1);
cout<<sol.size()<<'\n';
int r=sol.size(); if (r>1000)r=1000;
for (i=0;i<r;i++)
cout<<sol[i]<<' ';
return 0;
}