Pagini recente » Cod sursa (job #356239) | Cod sursa (job #1755449) | Cod sursa (job #1797058) | Cod sursa (job #983691) | Cod sursa (job #685640)
Cod sursa(job #685640)
#include<fstream>
#include<string.h>
#define lim 2000002
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
char N[lim],M[lim];
int k,i,p[lim],z,Sol[lim],q;
int main (){
f>>(N+1);
f>>(M+1);
k=0;
p[1]=0;
for(i=2;N[i]!=0;i++){
while(k>0 && N[k+1]!=N[i])
k=p[k];
if(N[k+1]==N[i])
k++;
p[i]=k;
}
q=0;
for(i=1;i<=M[i]!=0;i++){
while(q>0 && N[q+1]!=M[i])
q=p[q];
if(N[q+1]==M[i])
q++;
if(q==strlen(N+1)){
z++;
Sol[z]=i-strlen(N+1);
}
}
g<<z<<"\n";
for(i=1;i<=z;i++)
g<<Sol[i]<<" ";
return 0;
}