Pagini recente » Cod sursa (job #2736236) | Cod sursa (job #2357910) | Cod sursa (job #2152965) | Cod sursa (job #2591610) | Cod sursa (job #3163477)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
vector<int> sol;
int main()
{
string s, t;
int k, cnt;
fin>>s>>t;
t=s+'#'+t;
vector<int> pi(t.size());
pi[0]=0;
k=0;
cnt=0;
for(int i=1; i<t.size(); i++){
while(k!=0 && t[k]!=t[i])
k=pi[k-1];
if(t[k]==t[i])
k++;
pi[i]=k;
if(k==s.size()){
cnt++;
if(cnt<=1000 && i>s.size())
sol.push_back(i-2*s.size());
}
}
fout<<cnt<<'\n';
for(int i=0; i<sol.size(); i++)
fout<<sol[i]<<" ";
return 0;
}