Pagini recente » Cod sursa (job #3221609) | Cod sursa (job #94288) | Cod sursa (job #1387860) | Cod sursa (job #98934) | Cod sursa (job #1488475)
#include <iostream>
#include <fstream>
using namespace std;
ifstream in("fact.in");
ofstream out("fact.out");
long no_0(long n)
{
int k=0;
long x=5;
while(x<=n)
{
k+=n/x;
x*=5;
}
return k;
}
int main()
{
int p;
in>>p;
if(p==0)
{
out << 1;
return 0;
}
long r = -1;
long st = 0;
long dr = 5*100000000;
long q;
while(st < dr)
{
q = (st+dr)/2;
if(no_0(q)==p)
{
r = q;
break;
}
else if(no_0(q) < p) st = q + 1;
else dr=q-1;
}
if(r!=-1)
for(long i = 3; i>=0; i--)
{
if(r%5==0)break;
r--;
}
out<<r;
return 0;
}