Cod sursa(job #2231080)
| Utilizator | Data | 12 august 2018 22:02:22 | |
|---|---|---|---|
| Problema | Factorial | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.7 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("fact.in");
ofstream out("fact.out");
int countZeroes(int n)
{
int counter = 0;
for (int i = 5; n / i >= 1; i *= 5)
counter += n / i;
return counter;
}
int p = 0;
bool found(int n){
for(int i = n; i<=n*5;++i){
if(n == countZeroes(i)){
p = i;
return true;
break;
}
}
return false;
}
int main()
{
int x;
in >> x;
if(x == 0){
out << 1 << '\n';
} else {
if(found(x) == true){
out << p << '\n';
} else {
out << -1 << '\n';
}
}
}
