Cod sursa(job #2099658)
Utilizator | Data | 4 ianuarie 2018 16:25:08 | |
---|---|---|---|
Problema | GFact | Scor | 15 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream f ("gfact.in");
ofstream g ("gfact.out");
int p,q;
long long i,step;
int verif (int n)
{
int nr=0;
while (n>=p)
{
nr+=n/p;
n=n/p;
}
return nr;
}
int main()
{
f>>p>>q;
step=1<<30;
for (i=0;step;step>>=1)
{
if (verif(i+step)<q)
{
i+=step;
}
}
g<<i+1<<'\n';
return 0;
}