Pagini recente » Cod sursa (job #1935462) | Cod sursa (job #2580460) | Cod sursa (job #2896354) | Cod sursa (job #2610813) | Cod sursa (job #1387171)
#include<fstream>
#include<string>
#include<vector>
using namespace std;
string s,p,t;
int i,n;
int pi[4000003];
vector<int> sol;
int main()
{
ifstream cin("strmatch.in");
ofstream cout("strmatch.out");
cin>>p>>t;
s=p+'*'+t;
n=s.size();
for (i=1;i<n;i++)
{
int j=pi[i-1];
while (j>0 && s[i]!=s[j])
j=pi[j-1];
if (s[i]==s[j]) j++;
pi[i]=j;
}
/*for (i=0;i<n;i++)cout<<s[i]<<' ';cout<<'\n';
for (i=0;i<n;i++)cout<<pi[i]<<' ';cout<<'\n';*/
for (i=0;i<t.size();i++)
if (pi[1+p.size()+i]==p.size())
sol.push_back(i-p.size()+1);
int k=sol.size();
cout<<k<<'\n';
for (i=0;i<min(k,1000);i++)
cout<<sol[i]<<' ';
return 0;
}