Cod sursa(job #1513536)
| Utilizator | Data | 29 octombrie 2015 18:04:18 | |
|---|---|---|---|
| Problema | Factorial | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.49 kb |
#include <fstream>
using namespace std;
long long n, p, i;
int zero(long long n) {
// cati de 0 are la final n!
long long p = 5;
int nr = 0;
while (p <= n) {
nr = nr + n/p;
p = p*5;
}
return nr;
}
ifstream fin ("fact.in");
ofstream fout("fact.out");
int main () {
fin>>p;
for (i=1;;i++)
if (zero(i) >= p)
break;
if (zero(i) == p)
fout<<i;
else
fout<<-1;
return 0;
}
