Pagini recente » Cod sursa (job #653259) | Cod sursa (job #1136713) | Cod sursa (job #2640869) | Cod sursa (job #1070709) | Cod sursa (job #2717198)
#include<bits/stdc++.h>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
char s1[2000010],s2[2000010];
int prefix[2000010],n,m,k;
int ans[2000010];
int main()
{
fin>>s1;
fin>>s2;
n=strlen(s1);
m=strlen(s2);
int j=0;
for(int i=1; i<=n-1; i++)
{
while(j>0&&s1[i]!=s1[j])
j=prefix[j-1];
if(s1[i]==s1[j])
j++;
prefix[i]=j;
}
j=0;
for(int i=1; i<m; i++)
{
while(s2[i]!=s1[j]&&j>0)
j=prefix[j-1];
if(s2[i]==s1[j])
j++;
if(j==n)
ans[++k]=i-n+1;
}
fout<<k<<'\n';
for(int i=1; i<=min(k,1000); i++)
fout<<ans[i]<<" ";
return 0;
}