Pagini recente » Cod sursa (job #1321365) | Cod sursa (job #737435) | Cod sursa (job #1955634) | Cod sursa (job #1366854) | Cod sursa (job #469667)
Cod sursa(job #469667)
#include<stdio.h>
#include<math.h>
long long min=1;
long long q;
long long mult(long long a,long long b)
{
long long c=b,s=0;
while(a>c)
{
s=s+a/c;
c=c*b;
}
return s;
}
long long bin(long long d,long long e)
{
long long m,pozdi,st,dr;
st=1;
dr=(1ll<<61)-1;
while(st<=dr)
{
m=(st+dr)/2;
if(mult(m,d)>=e)
{
dr=m-1;
pozdi=m;
}
else
st=m+1;
}
return pozdi;
}
void desc(long long p)
{
long long d=2,e,f,a;
e=sqrt(p);
while(d<=e&&p>1)
{
f=0;
while(p%d==0)
{
f++;
p=p/d;
}
if(f)
{
a=bin(d,f*q);
if(a>min)
min=a;
}
d++;
}
if(p>1)
{
a=bin(d,f*q);
if(a>min)
min=a;
}
}
int main()
{
freopen("gfact.in","r",stdin);
freopen("gfact.out","w",stdout);
long long p;
scanf("%lld%lld",&p,&q);
desc(p);
printf("%lld",min);
return 0;
}