Pagini recente » Cod sursa (job #252477) | Cod sursa (job #2726127) | Cod sursa (job #1602447) | Cod sursa (job #668920) | Cod sursa (job #2537651)
#include <fstream>
std::ifstream f("fact.in");
std::ofstream g("fact.out");
long long n;
long long Count0(long long n){
long long power = 5;
long long sol = 0;
while(power <= n){
sol += n / power;
power *= 5;
}
return sol;
}
int main(){
f >> n;
long long left = 1;
long long right = 5 * n;
while(left <= right){
long long mid = (left + right) / 2;
if(Count0(mid) >= n)
right = mid - 1;
else
left = mid + 1;
}
if(Count0(left) != n)
g << -1;
else
g << left;
return 0;
}