Pagini recente » Istoria paginii preoni-2005/runda-2 | Cod sursa (job #1756443) | Cod sursa (job #1557931) | Cod sursa (job #1754872) | Cod sursa (job #1556959)
#include <cstdio>
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int p,ls,ld,mij,kk,k,fct;
int main()
{
f >> p;
ls = 1;
ld = 800000000;
kk = 0;
if(p == 0)
g << 1 << '\n';
else
{
while(ls <= ld && kk == 0)
{
k = 0;
mij = (ls + ld) / 2;
fct = 5;
while(fct <= mij)
{
k += mij / fct;
fct *= 5;
}
if(k == p)
kk = mij;
if(k > p)
ld = mij - 1;
else
if(k < p)
ls = mij + 1;
}
if(kk != 0)
g << kk - kk % 5 << '\n';
else
g << -1 << '\n';
}
return 0;
}