Pagini recente » Cod sursa (job #1826938) | Cod sursa (job #2949857) | Cod sursa (job #1637405) | Cod sursa (job #261843) | Cod sursa (job #2076317)
#include <algorithm>
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
int NumZeroes(int n) {
int total = 0;
while (n) {
total += (n /= 5);
}
return total;
}
int main() {
ifstream cin("fact.in");
ofstream cout("fact.out");
int p;
cin >> p;
int left = 0, right = 5 * p, best = -1;
while (left <= right) {
int middle = (left + right) / 2;
int num_zeroes = NumZeroes(middle);
if (num_zeroes >= p) {
if (num_zeroes == p) {
best = middle;
}
right = middle - 1;
} else {
left = middle + 1;
}
}
cout << best << "\n";
return 0;
}