Pagini recente » Cod sursa (job #2579859) | Cod sursa (job #2962662) | Cod sursa (job #433410) | Cod sursa (job #2909412) | Cod sursa (job #443216)
Cod sursa(job #443216)
#include <cstdio>
using namespace std;
FILE* fin=fopen("gfact.in","r");
FILE* fout=fopen("gfact.out","w");
typedef unsigned long long uint64;
int p,q,decomp[30][2],nf=0;
#define max(a,b) (((a)>(b))?(a):(b))
inline int num(uint64 a,uint64 k){
int nr=0;
for(int i=a;i<=k;i*=a){
nr+=k/i;
}
return nr;
}
inline uint64 search(int a,int b){
uint64 beg=0,end=2*a*b*q,last=0,mdl;
while(beg<=end){
mdl=beg+((end-beg)>>1);
if(num(a,mdl)>=b){
last=mdl,end=mdl-1;
}else{
beg=mdl+1;
}
}
return last;
}
int main(){
fscanf(fin,"%d %d\n",&p,&q);
for(int i=2,k;i*i<=p;++i){
if(p%i==0){
k=0;
while(p%i==0){
k++,p/=i;
}
decomp[nf][0]=i;
decomp[nf][1]=k*q;
nf++;
}
}
if(p>1){
decomp[nf][0]=p;
decomp[nf][1]=q;
nf++;
}
uint64 maxv=0;
for(int i=0,c;i<nf;i++){
c=search(decomp[i][0],decomp[i][1]);
maxv=max(c,maxv);
}
fprintf(fout,"%lld ",maxv);
fclose(fin);
fclose(fout);
return 0;
}