Pagini recente » Cod sursa (job #2309044) | Cod sursa (job #2232605) | Cod sursa (job #861711) | Cod sursa (job #92359) | Cod sursa (job #1662320)
#include <fstream>
#include <iostream>
using namespace std;
ifstream in("fact.in");
ofstream out("fact.out");
const int maxp = 100000000;
int p;
int nrZerouri(int n)
{
int nr = 0;
while (n)
{
nr = nr + n / 5;
n = n / 5;
}
return nr;
}
void solve()
{
int st = 1, dr = maxp;
while (st < dr)
{
int m = st + (dr - st) / 2; // echivalent (st + dr) / 2
int nrZeros = nrZerouri(m);
if (nrZeros < p)
{
st = m + 1;
}
else
{
dr = m - 1;
}
}
if (nrZerouri(st) == p)
{
out << st << endl;
}
else
{
out << -1 << endl;
}
}
int main()
{
in >> p;
solve();
return 0;
}