Pagini recente » Cod sursa (job #1661980) | Cod sursa (job #2393715) | Cod sursa (job #832193) | Cod sursa (job #2934622) | Cod sursa (job #2483401)
#include <fstream>
#include <climits>
#include <algorithm>
using namespace std;
ifstream f("factorial.in");
ofstream g("factorial.out");
int p, st(1), dr(INT_MAX), m;
int zero(int i) {
int nr = 0, x = 5;
while (x <= i) {
nr += i/x;
x *= 5;
}
return nr;
}
int main()
{
f >> p;
if (!p) {
g << "1\n";
return 0;
}
while (st <= dr) {
m = st + (dr - st) / 2;
if (zero(m) == p) {
g << m - m%5 << endl;
exit(0);
}
if (zero(m) < p) st = m + 1;
else dr = m - 1;
}
g << "-1\n";
return 0;
}