Pagini recente » Cod sursa (job #3162648) | Cod sursa (job #1098372) | Cod sursa (job #1971341) | Cod sursa (job #1681065) | Cod sursa (job #2673569)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
char s1[2000005],s2[2000005];
int prefix[2000005],ans[1009],k,j;
int main()
{
cin.getline(s1,2000005);
cin.getline(s2,2000005);
int n=strlen(s1);
int m=strlen(s2);
j=0;
for(int i=1;i<n;i++)
{
while(j>0&&s1[j]!=s1[i])
j=prefix[j-1];
if(s1[i]==s1[j])
j++;
prefix[i]=j;
}
j=0;
for(int i=0;i<m;i++)
{
while(j>0&&s1[j]!=s2[i])
j=prefix[j-1];
if(s1[j]==s2[i])
j++;
if(j==n)
{
k++;
if(k<=1000)
ans[k]=i-j+1;
j=prefix[j-1];
}
}
cout<<k<<'\n';
if(k>1000)
k=1000;
for(int i=1;i<=k;i++)
cout<<ans[i]<<' ';
}