Pagini recente » Cod sursa (job #2083708) | Cod sursa (job #2113276) | Cod sursa (job #1597376) | Cod sursa (job #311827) | Cod sursa (job #373014)
Cod sursa(job #373014)
#include<cstdio>
long long nr,prim[5000],put[5000];
void desc(int x)
{
if (x%2==0)
{
nr++;
prim[nr]=2;
while (x%2==0)
{
put[nr]++;
x/=2;
}
}
if (x!=1)
for (int i=3;i*i<=x;i+=2)
if (x%i==0)
{
nr++;
prim[nr]=i;
while (x%i==0)
{
put[nr]++;
x/=i;
}
}
if (x!=1)
{
nr++;
prim[nr]=x;
put[nr]=1;
}
}
/*bool ok(long long x)
{
bool ok=true;
for (int i=1;i<=nr;i++)
{
long long s=0,x1=x;
while (x1)
s += (x1/=prim[i]);
if (s<put[i])
{
ok=false;
break;
}
}
return ok;
}
long long cautbin()
{
long long i,pas=1<<30;
for (i=0;pas;pas>>=1)
if (!ok(i+pas))
i+=pas;
return i+1;
}*/
int main()
{
freopen("gfact.in","r",stdin);
freopen("gfact.out","w",stdout);
long long p=0,q=0;
scanf("%d%d",&p,&q);
/*desc(p);
for (int i=1;i<=nr;i++)
put[i]*=q;
printf("%lld",cautbin());*/
desc(p);
long long x=0,y=0;
for (long long i=prim[nr];i<=prim[nr]*q;i++)
{
if (i%prim[nr]==0)
y++;
x+=y;
if (x>=put[nr]*q)
{
printf("%lld",i);
return 0;
}
}
return 0;
}