Pagini recente » Cod sursa (job #1563396) | Cod sursa (job #2422892) | Cod sursa (job #1096375) | Cod sursa (job #2268038) | Cod sursa (job #1371163)
#include <fstream>
#include <cstring>
#define DIM 2000002
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
int N,P[DIM],L,M,list[DIM],nr;
char A[DIM],B[DIM];
int main(){
fin>>A+1;
fin>>B+1;
N=strlen(A+1);
M=strlen(B+1);
P[1]=0;
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;
}
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";
for(int i=1;i<=min(nr,1000);i++)
fout<<list[i]<<" ";
fin.close();fout.close();
return 0;
}