Pagini recente » Cod sursa (job #2128861) | Cod sursa (job #1054599) | clasament-arhiva-educationala | Borderou de evaluare (job #2010131) | Cod sursa (job #2231080)
#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';
}
}
}