Pagini recente » Cod sursa (job #1131541) | Cod sursa (job #3168893) | Cod sursa (job #2384486) | Cod sursa (job #599193) | Cod sursa (job #2351190)
#include <fstream>
#include <iostream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
long long n, st, dr, sol;
int main()
{
f >> n;
if(n == 0)
{ g << 1 << '\n';
return 0;
}
st = 1;
dr = 100 * n;
while(st<=dr)
{
long long mij = (st + dr) / 2;
int n0 = 0, p = 5;
while(mij >= p)
{
n0 = n0 + mij/p;
p*=5;
}
if(n0 == n)
{
mij-=mij%5;
sol = mij;
dr = mij - 1;
}
else if(n0 > n) dr = mij - 1;
else st = mij + 1;
}
g << sol << '\n';
return 0;
}