Pagini recente » Borderou de evaluare (job #1567369) | Cod sursa (job #2002754) | Cod sursa (job #574079) | Cod sursa (job #498941) | Cod sursa (job #2801148)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
vector<int> sol;
string a,b;
int pi[4000005];
void prefix_function()
{
pi[0]=0;
for(int i=1;i<b.size();i++)
{
int j=pi[i-1];
while(j>0&&b[j]!=b[i])
j=pi[j-1];
if(b[j]==b[i])
j++;
pi[i]=j;
}
}
int main()
{
fin>>a>>b;
b=a+"#"+b;
prefix_function();
for(int i=a.size();i<b.size();i++)
if(pi[i]==(int)a.size()&&i-2*(int)a.size()>=0)
sol.push_back(i-2*(int)a.size());
fout<<sol.size()<<'\n';
for(auto i:sol)
fout<<i<<' ';
return 0;
}