Pagini recente » Cod sursa (job #829568) | Cod sursa (job #314267) | Cod sursa (job #2882332) | Cod sursa (job #3306388) | Cod sursa (job #3329174)
#include <bits/stdc++.h>
using namespace std;
long long P, N;
long long zero(long long n)
{
int p = 5;
long long sum = 0;
while(n >= p)
{
sum += n / p;
p *= 5;
}
return sum;
}
int main()
{
ifstream cin("fact.in");
ofstream cout("fact.out");
cin >> P;
long long st, dr, mij, f = -1;
st = 0, dr = LONG_MAX;
if(P == 0)
cout << 1;
else
{
while(st <= dr)
{
mij = (st + dr) / 2;
if(P <= zero(mij))
{
dr = mij - 1;
f = mij;
}
else
st = mij + 1;
}
cout << f;
}
return 0;
}