Pagini recente » Cod sursa (job #499734) | Cod sursa (job #1198634) | Cod sursa (job #2879397) | Cod sursa (job #22191) | Cod sursa (job #2883567)
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
const int MAX=2e6+5;
int pf[MAX],poz[MAX],i,j,cnt,n;
char a[MAX],b[MAX];
int main()
{
fin >> a >> b;
n=strlen(a);
j=0;
for(i=1;a[i];i++)
{
while(a[i]!=a[j] && j)
j=pf[j-1];
if(a[i]==a[j])
pf[i]=(j++)+1;
}
i=j=0;
while(b[i])
{
if(b[i]==a[j])
{
i++;
j++;
if(j==n)
{
poz[++cnt]=i-n;
j=pf[j-1];
}
}
else if(j==0)
i++;
else
j=pf[j-1];
}
fout << cnt << '\n';
for(i=1;i<=min(cnt,1000);i++)
fout << poz[i] << " ";
return 0;
}