Pagini recente » Cod sursa (job #902902) | Cod sursa (job #1083481) | Cod sursa (job #479162) | Cod sursa (job #2472177) | Cod sursa (job #685675)
Cod sursa(job #685675)
#include<fstream>
#include<string.h>
#define lim 2000005
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
char N[lim],M[lim];
long long k,i,p[lim],z,Sol[1025],q,n,m;
bool ok;
int main (){
f>>(N+1);
f>>(M+1);
n=strlen(N+1);
m=strlen(M+1);
k=0;
p[1]=0;
for(i=2;i<=n;i++){
while(k>0 && N[k+1]!=N[i])
k=p[k];
if(N[k+1]==N[i])
k++;
p[i]=k;
}
q=0;
ok=1;
for(i=1;i<=m;i++){
while(q>0 && N[q+1]!=M[i])
q=p[q];
if(N[q+1]==M[i])
q++;
if(q==n){
z++;
if(z>1000)
ok=0;
Sol[z]=i-q;
}
if(!ok)
break;
}
g<<z<<"\n";
if(z>1000)
z=1000;
for(i=1;i<=z;i++)
g<<Sol[i]<<" ";
g<<"\n";
return 0;
}