Cod sursa(job #1520947)
Utilizator | Data | 9 noiembrie 2015 19:19:35 | |
---|---|---|---|
Problema | Factorial | Scor | 5 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
int p, i = 0, n = 5, k;
ifstream f("fact.in");
ofstream g("fact.out");
f >> p;
while (n) {
i++;
k = n / 5;
while (k % n == 0) {
k /= 5;
i++;
}
if (i == p) {
g << n; break;
}
if (i > p) {
g << -1; break;
}
n += 5;
}
f.close ();
g.close ();
return 0;
}