Pagini recente » Cod sursa (job #157801) | Cod sursa (job #2628506) | Cod sursa (job #1408015) | Cod sursa (job #303355) | Cod sursa (job #2084290)
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
char a[2000005],b[2000005];
int l[2000005],poz[1005];
int main()
{
ifstream fin ("strmatch.in");
ofstream fout ("strmatch.out");
fin>>a>>b;
int nr=0,m,n;
m=strlen(a);
n=strlen(b);
l[0]=0;
int i=1,j=0,k=0;
while(i<m)
if(a[i]==a[j])
{
l[i]=j+1;
i++;
j++;
}
else if(j==0)
l[i++]=0;
else
j=l[j-1];
i=j=0;
while(i<n)
if(b[i]==a[j])
{
i++;
j++;
if(j==m)
{
nr++;
if (nr<=1000)
poz[k++]=i-m;
j=l[j-1];
}
}
else if(j==0)
i++;
else
j=l[j-1];
fout<<nr<<'\n';
for (int i=0; i<k; i++)
fout<<poz[i]<<' ';
return 0;
}