Pagini recente » Cod sursa (job #1370112) | Cod sursa (job #2876449) | Cod sursa (job #71068) | Cod sursa (job #1889673) | Cod sursa (job #1671052)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int p, n, i, l, r;
int nr0 (int n) {
int s = 0;
int exp = 5;
while (n >= exp) {
s += (n / exp);
exp *= 5;
}
return s;
}
int cautbin() {
l = 0;
r = 1000000000;
while (l <= r) {
int m = (l + r) / 2;
if (nr0(m) < p) l = m + 1;
else r = m - 1;
}
if (nr0(l) == p) g << -1;
else
g << l;
}
int main()
{
f >> p;
if (p == 0) g << 1;
else
cautbin();
return 0;
}