Pagini recente » Cod sursa (job #2519007) | Cod sursa (job #360684) | Cod sursa (job #2363299) | Cod sursa (job #2848290) | Cod sursa (job #1340024)
#include <fstream>
#include <cstring>
#define DIM 2000002
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
char A[DIM],B[DIM];
int P[DIM],L,n,m,nr,list[1002];
int main(){
fin>>A+1>>B+1;
P[1]=0;
n=strlen(A+1);
L=0;
for(int i=2;i<=n;i++){
while(L!=0 && A[i]!=A[L+1])
L=P[L];
if(A[i]==A[L+1])
L++;
P[i]=L;
}
m=strlen(B+1);
L=0;
for(int i=1;i<=m;i++){
while(L!=0 && B[i]!=A[L+1])
L=P[L];
if(B[i]==A[L+1])
L++;
if(L==n){
nr++;
if(nr<=1000)
list[nr]=i-n;
L=P[L];
}
}
fout<<nr<<"\n";
if(nr>1000)
nr=1000;
for(int i=1;i<=nr;i++)
fout<<list[i]<<" ";
fin.close();fout.close();
return 0;
}