Pagini recente » Cod sursa (job #2586139) | Cod sursa (job #1827724) | Cod sursa (job #2803807) | Cod sursa (job #2204013) | Cod sursa (job #2793448)
#include<iostream>
#include<fstream>
#include<climits>
using namespace std;
long long i, p, mij, sol=LLONG_MAX;
long long calc(long long x)
{
long long j = 5, sum = 0;
while(j <= x)
{
sum += x / j;
j = j * 5;
}
return sum;
}
int main()
{
freopen("fact.in", "r", stdin);
freopen("fact.out", "w", stdout);
cin >> p;
long long st = 1, dr = 500000000LL;
while(st <= dr)
{
mij = (st + dr) / 2;
if(calc(mij) >= p)
{
dr = mij - 1;
if(calc(mij)==p)
sol = min(sol, mij);
}
else
{
st = mij + 1;
}
}
if(calc(sol)==p)
cout << sol;
else cout<<-1;
}