Pagini recente » Cod sursa (job #1183431) | Cod sursa (job #1717288) | Cod sursa (job #505516) | Cod sursa (job #2262350) | Cod sursa (job #2866620)
#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);
for(int i=0;a[i];i++)
j=0; i=1;
while(a[i])
{
while(a[i]!=a[j] && j)
j=pf[j-1];
if(a[i]==a[j])
pf[i++]=(j++)+1;
else
i++;
}
for(i=0;b[i];i++)
{
while(j>0 && b[i]!=a[j+1])
j=pf[j];
if(b[i]==a[j+1])
j++;
if(j+1==n)
poz[++cnt]=i+1-n;
}
fout << cnt << '\n';
for(i=1;i<=min(1000,cnt);i++)
fout << poz[i] << " ";
return 0;
}