Pagini recente » Cod sursa (job #1313783) | Cod sursa (job #2313408) | Cod sursa (job #1004938) | Cod sursa (job #2048329) | Cod sursa (job #1678241)
#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
ifstream fin("date.in");
ofstream fout("date.out");
int nextt[2000001],n,m,nr,sol[1001];
char P[2000001],T[2000001];
void urm()
{
int k=0;
for(int i=2; i<=n; ++i)
{
while(k>0 && P[k+1]!=P[i])
k=nextt[k];
if(P[k+1]==P[i])
++k;
nextt[i]=k;
}
}
int main()
{
int x=-1;
fin>>P+1>>T+1;
n=strlen(P+1);
m=strlen(T+1);
urm();
for(int i=1; i<=m; ++i)
{
while(x>0 && P[x+1]!=T[i])
x=nextt[x];
if(P[x+1]==T[i])
++x;
if(x==n)
{
++nr;
if(nr<1001)
sol[nr]=i-n+1;
x=nextt[x];
}
}
fout<<nr<<'\n';
for(int i=1; i<=min(nr,1000); i++)
fout<<sol[i]<<' ';
fout<<'\n';
return 0;
}