Pagini recente » Cod sursa (job #1310156) | Cod sursa (job #111368) | Cod sursa (job #358396) | Cod sursa (job #1539109) | Cod sursa (job #2609086)
#include <bits/stdc++.h>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
long long n, rez;
long long calc(long long);
int main()
{
f >> n;
if (!n)
g << 1, g.flush(), exit(0);
long long st = 1, dr = 1e8 * 5;
while (st <= dr)
{
long long mid = (st + dr) / 2;
long long ax = calc(mid);
if (n == ax)
rez = mid, dr = mid - 1;
else if (ax < n)
st = mid + 1;
else
dr = mid - 1;
}
g << rez;
return 0;
}
long long calc(long long x)
{
long long p = 5, r = 0;
while (p <= x)
r += x / p, p *= 5;
return r;
}