Cod sursa(job #2210292)
Utilizator | Data | 6 iunie 2018 06:05:02 | |
---|---|---|---|
Problema | GFact | Scor | 15 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.88 kb |
#include <fstream>
using namespace std;
int putere(long long mid,int p,int q)
{
int ci;
long long p5=1;
if(p==1)
q=0;
else
while(p5*p<=mid)
{
p5*=p;
q-=mid/p5;
}
/*for(int i=p;i<=mid && pp==1;i+=p)
{
ci=i;
while(ci%p==0)
{
q--;
ci/=p;
}
if(q<=0)
pp=0;
}*/
return q;
}
int main()
{
ifstream in ("gfact.in");
ofstream out ("gfact.out");
int st=1,p,q;
long long rez=1,dr;
long long mid;
in>>p>>q;
dr=p*q;
while(st<=dr)
{
mid=(st+dr)/2;
if(putere(mid,p,q)>0)
st=mid+1;
else
{
rez=mid;
dr=mid-1;
}
}
out<<rez;
return 0;
}