Pagini recente » Cod sursa (job #2134451) | Cod sursa (job #488392) | Cod sursa (job #319034) | Cod sursa (job #1643336) | Cod sursa (job #2125197)
#include <bits/stdc++.h>
#define lgmax 2100010
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
char a[lgmax],b[lgmax];
int i,pi[lgmax],k,n,m;
vector <int> ans;
int main()
{
fin>>a+1>>b+1;
n=strlen(a+1);
m=strlen(b+1);
pi[1]=0;
k=0;
for(i=2;i<=n;i++)
{
while(k>0&&a[k+1]!=a[i])
k=pi[k];
if(a[k+1]==a[i])
k++;
pi[i]=k;
}
k=0;
for(i=1;i<=m;i++)
{
while(k>0&&a[k+1]!=b[i])
k=pi[k];
if(a[k+1]==b[i])k++;
if(k==n)
{
ans.push_back(i-n);
k=pi[k];
}
}
fout<<ans.size()<<'\n';
for(i=0;i<1000&&i<ans.size();i++)fout<<ans[i]<<" ";
return 0;
}