Pagini recente » Cod sursa (job #67721) | Cod sursa (job #369792) | Cod sursa (job #2307931) | Cod sursa (job #2883269) | Cod sursa (job #2722010)
#include <iostream>
#include <cstring>
#include <vector>
#define NMAX 2000100
using namespace std;
char A[NMAX],B[NMAX], aux[NMAX];
int nA,nB, pre[NMAX];
vector <int> sol;
inline void scan() {
A[0]=' ';
B[0]=' ';
cin>>aux;
nA=strlen(aux);
strcpy(A+1,aux);
aux[0]='\0';
cin>>aux;
nB=strlen(aux);
strcpy(B+1,aux);
}
inline void make_pre() {
int q=0;
for(int i=2; i<=nA; ++i)
{
while(q && A[q+1]!=A[i])
q=pre[q];
if(A[q+1]==A[i])
q++;
pre[i]=q;
}
}
int main()
{
scan();
make_pre();
int q=0;
for(int i=1; i<nB; ++i)
{
while(q && A[q+1]!=B[i])
q=pre[q];
if(A[q+1]==B[i])
q++;
if(q==nA)
sol.push_back(i-nA);
}
cout<<sol.size()<<'\n';
for(int i=0; i<min(1000, (int) sol.size()); ++i)
cout<<sol[i]<<' ';
cout<<'\n';
return 0;
}