Pagini recente » Cod sursa (job #76934) | Cod sursa (job #15206) | Cod sursa (job #1629176) | Cod sursa (job #1863934) | Cod sursa (job #1501575)
#include<fstream>
#include<cstring>
using namespace std;
ifstream in("strmatch.in");
ofstream out("strmatch.out");
const int Nmax = 2000001;
char A[Nmax],B[Nmax];
int N,M,pi[Nmax],sol,K,ans[1002];
int main(){
in.getline(A,Nmax),N=strlen(A);
in.getline(B,Nmax),M=strlen(B);
int w=0;
for(int i=1;i<N;i++){
while(w && A[w]!=A[i]) w=pi[w-1];
if(A[w]==A[i]) w++;
pi[i]=w;
}
w=0;
for(int i=0;i<M;i++){
while(w && A[w]!=B[i]) w=pi[w-1];
if(A[w]==B[i]) w++;
if(w==N){
sol++,ans[++K]=i-N+1;
if(K>1000) K--;
}
}
out<<sol<<'\n';
for(int i=1;i<K;i++) out<<ans[i]<<' ';
out<<ans[K]<<'\n';
return 0;
}