Pagini recente » Cod sursa (job #1450589) | Cod sursa (job #2310734) | Cod sursa (job #80774) | Cod sursa (job #1500589) | Cod sursa (job #1539510)
#include <cstdio>
#include <cstring>
#define maxl 2000005
#define maxp 1000
using namespace std;
char M[maxl],N[maxl];
int n,m,pos[maxl],res=0,prefix[maxl];
void Lesen();
void Prefix_schaffen();
void KMP();
void Schreiben();
int main(){
freopen("strmatch.in","r",stdin);
freopen("strmatch.out","w",stdout);
Lesen();
Prefix_schaffen();
KMP();
Schreiben();
return 0;
}
void Lesen(){
M[0]=N[0]=' ';
scanf("%s",N+1);n=strlen(N);
scanf("%s",M+1);m=strlen(M);
}
void Prefix_schaffen(){
int k=0;
for(int i=2;i<n;i++){
while(k && N[k+1]!=N[i])k=prefix[k];
if(N[k+1]==N[i])k++;
prefix[i]=k;
}
}
void KMP(){
int k=0;
for(int i=1;i<m;++i){
while(k && N[k+1]!=M[i])k=prefix[k];
if(N[k+1]==M[i])k++;
if(k==n-1){
res++;
if(res<=maxp)pos[res]=i-k;
}
}
}
void Schreiben(){
printf("%d\n",res);
if(res>maxp)res=maxp;
for(int i=1;i<=res;i++)i==res?printf("%d\n",pos[res]):printf("%d ",pos[i]);
}