Pagini recente » Cod sursa (job #2088618) | Cod sursa (job #449814) | Cod sursa (job #1276421) | Cod sursa (job #1510558) | Cod sursa (job #2172746)
# include <fstream>
# include <cstring>
# define DIM 2000010
# define BAZA1 53
# define BAZA2 103
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
char a[DIM],b[DIM];
int sol[1002],n,m,i,nr;
unsigned long long p1[DIM],p2[DIM],vala1,vala2,valb1,valb2;
int cod(char c){
if(c>='A'&&c<='Z')
return 26+c-'A';
else
return c-'a';
}
int main () {
fin>>a+1>>b+1;
n=strlen(a+1);
m=strlen(b+1);
p1[0]=1;
for(i=1;i<=n;i++)
p1[i]=p1[i-1]*BAZA1;
p2[0]=1;
for(i=1;i<=n;i++)
p2[i]=p2[i-1]*BAZA2;
for(i=1;i<=n;i++){
vala1=vala1*BAZA1+cod(a[i]);
vala2=vala2*BAZA2+cod(a[i]);
}
for(i=1;i<=n;i++){
valb1=valb1*BAZA1+cod(b[i]);
valb2=valb2*BAZA2+cod(b[i]);
}
if(vala1==valb1&&vala2==valb2){
nr++;
if(nr<=1000)
sol[nr]=0;
}
for(;i<=m;i++){
valb1-=p1[n-1]*cod(b[i-n]);
valb1=valb1*BAZA1+cod(b[i]);
valb2-=p2[n-1]*cod(b[i-n]);
valb2=valb2*BAZA2+cod(b[i]);
if(vala1==valb1&&vala2==valb2){
nr++;
if(nr<=1000)
sol[nr]=i-n;
}
}
fout<<nr<<"\n";
for(i=1;i<=min(nr,1000);i++)
fout<<sol[i]<<" ";
return 0;
}