Cod sursa(job #1588772)
| Utilizator | Data | 3 februarie 2016 16:48:23 | |
|---|---|---|---|
| Problema | GFact | Scor | 15 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fi("gfact.in");
ofstream fo("gfact.out");
int p, q;
int zero(int n){
int r = 0;
while (n >= p){
r += n / p;
n /= p;
}
return r;
}
int cautbin()
{
int i = 0;
int pas = (long long)1 << 30;
while (pas != 0)
{
if (zero(i + pas) < q)
i += pas;
pas /= 2;
}
return i+1;
}
int main()
{
int nr;
fi >> p >> q;
nr = cautbin();
if (zero(nr) == q)
fo << nr;
else fo << -1;
}