Pagini recente » Cod sursa (job #2243828) | Cod sursa (job #81303) | Cod sursa (job #2322163) | Cod sursa (job #1066860) | Cod sursa (job #2330857)
#include <fstream>
#include <cmath>
using namespace std;
long long nrz(int n);
int n, j;
int main() {
ifstream ifs("fact.in");
ofstream ofs("fact.out");
ifs >> n;
for (j = 5; nrz(j) <= n; j = j + 5);
if (nrz(j - 5) == n)
ofs << j - 5;
else ofs << -1;
return 0;
}
long long nrz(int n) {
int i = 1;
long long num = 0, mod = 5;
while (n / mod != 0) {
num = num + n / mod;
i++;
mod = mod * 5;
}
return num;
}