Pagini recente » Cod sursa (job #1390499) | Cod sursa (job #2056699) | Cod sursa (job #2697888) | Cod sursa (job #178732) | Cod sursa (job #1287397)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
long long p, st, dr, nr, d;
long long i, n;
ifstream fin("fact.in");
fin >> p;
fin.close();
st = n = 0;
dr = 500000000;
d = 0;
while (st <= dr)
{
n = (st + dr) / 2;
nr = 0;
i = 5;
while (i <= n)
{
nr += n / i;
i *= 5;
}
if (p <= nr)
dr = n - 1;
else
st = n + 1;
if (p == nr) d = 1;
}
ofstream fout("fact.out");
if (!d) fout << "-1";
else if (st == 0)
fout << "1";
else
fout << st;
fout.close();
return 0;
}