Pagini recente » Cod sursa (job #2709666) | Istoria paginii runda/iconcurs19 | preoni-2007/runda-finala/poze/premiere | Istoria paginii runda/1543 | Cod sursa (job #2783490)
#include <iostream>
#include <fstream>
#include <cmath>
using namespace std;
ifstream cin("fact.in");
ofstream cout("fact.out");
int nz(long long n) {
int p = 5;
int s = 0;
while (p <= n) {
s += n / p;
p *= 5;
}
return s;
}
int main() {
int c = 5;
int p;
cin >> p;
while (nz(c) <= p) {
c += 5;
}
if (nz(c) != p)
cout << -1;
else
cout << c - 5;
}