Cod sursa(job #1714062)
| Utilizator | Data | 7 iunie 2016 12:10:44 | |
|---|---|---|---|
| Problema | GFact | Scor | 15 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.51 kb |
#include <fstream>
using namespace std;
ifstream cin("gfact.in");
ofstream cout("gfact.out");
long long legendre(long long f,long long n)
{
long long c,p=0;
c=f;
while(c<=n)
{
p+=n/c;
c*=f;
}
return p;
}
int main()
{
long long p,q,st,dr,m;
cin>>p>>q;
st=1;
dr=2000000000;
while(st<=dr)
{
m=(st+dr)/2;
if(legendre(p,m)>=q)
dr=m-1;
else
st=m+1;
}
cout<<st;
return 0;
}
