Pagini recente » Cod sursa (job #2923175) | Cod sursa (job #2175560) | Cod sursa (job #2156978) | Cod sursa (job #343100) | Cod sursa (job #2537039)
#include <stdio.h>
#include <string.h>
#define MAX 2000000
#define MOD1 666013
#define MOD2 1000000007
char a[MAX],b[MAX];
int v[MAX];
int main(){
FILE *fin=fopen("strmatch.in","r");
FILE *fout=fopen("strmatch.out","w");
int n,m,i,am1,am2,bm1,bm2,p1,p2,sol=0;
fscanf(fin,"%s",&a);
fscanf(fin,"%s",&b);
n=strlen(a);
m=strlen(b);
if(n>m)
sol=0;
else{
am1=am2=bm1=bm2=0;
p1=p2=1;
for(i=0; i<n; i++){
am1=(am1*27+a[i]-'A')%MOD1;
am2=(am2*27+a[i]-'A')%MOD2;
bm1=(bm1*27+b[i]-'A')%MOD1;
bm2=(bm2*27+b[i]-'A')%MOD2;
p1=(p1*27)%MOD1;
p2=(p2*27)%MOD2;
}
p1/=27;
p2/=27;
for(i=n; i<m; i++){
bm1=((bm1-(b[i-n]-'A')*p1)*27+b[i]-'A'+MOD1)%MOD1;
bm2=((bm2-(b[i-n]-'A')*p2)*27+b[i]-'A'+MOD2)%MOD2;
if(am1==bm1 && am2==bm2)
v[sol++]=i-n+1;
}
}
fprintf(fout,"%d\n",sol);
for(i=0; i<sol; i++)
fprintf(fout,"%d ",v[i]);
fclose(fin);
fclose(fout);
return 0;
}