Pagini recente » Cod sursa (job #1158558) | Cod sursa (job #2970176) | Rating Alexandra Tudorescu (Alexandra_Natalia) | Cod sursa (job #895910) | Cod sursa (job #2056416)
#include <iostream>
#include <fstream>
#include <string.h>
using namespace std;
ifstream fin ("strmatch.in");
ofstream fout ("strmatch.out");
#define NMax 2000005
int i,q=0,pi[NMax],M,N,n,pos[NMax];
char A[NMax],B[NMax];
void prefix()
{
for(i=2,pi[1]=0;i<=M;++i)
{
while(q&&A[q+1]!=A[i])q=pi[q];
if(A[q+1]==A[i])++q;
pi[i]=q;
}
}
int main()
{
fin.getline(A,NMax);
fin.getline(B,NMax);
M=strlen(A);
N=strlen(B);
for(i=M;i;--i) A[i]=A[i-1];A[0]=' ';
for(i=N;i;--i) B[i]=B[i-1];B[0]=' ';
prefix();
q=0;
for(i=2;i<=N;++i)
{
while(q&&A[q+1]!=B[i]) q=pi[q];
if(A[q+1]==B[i])++q;
if(q==M)
{
q=pi[M];
++n;
pos[n]=i-M;
}
}
fout<<n<<'\n';
if(n>1000)n=1000;
for(i=1;i<=n;++i)fout<<pos[i]<<' ';
fout<<'\n';
fin.close(); fout.close();
return 0;
}