Pagini recente » Cod sursa (job #2950061) | Cod sursa (job #2733177) | Cod sursa (job #490182) | Cod sursa (job #2375600) | Cod sursa (job #2596294)
#include <bits/stdc++.h>
#define maxn 9999999999999999999999
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
long long n, a, b, res;
long long zeros(long long x)
{
long long res = 0, div = 5;
while(x / div)
{
res += x / div;
div *= 5;
}
return res;
}
int main()
{
f>>n;
a = 1;
bool found = false;
b = maxn;
while(a < b)
{
long long mid = (a + b) / 2;
res = zeros(mid);
if(res > n)
b = mid - 1;
else if(res < n)
a = mid + 1;
else
b = mid, found = true;
}
if(!found)
g<<-1<<'\n';
else
{
while(zeros(a - 1) == n)
--a;
g<<a<<'\n';
}
}