Pagini recente » Cod sursa (job #707718) | fmi-no-stress-2012/solutii/potrivire | Cod sursa (job #2169674) | Cod sursa (job #1353207) | Cod sursa (job #3204456)
#include <fstream>
using namespace std;
ifstream fin("fact.in");
ofstream fout("fact.out");
int main()
{
long long p,n=-1;
fin>>p;
long long dt=p*5;
long long st=1;
while(st<=dt)
{
int m=(st+dt)/2;
long long c=0;
for(long long i=5;i<=m;i*=5)
{
c=c+m/i;
}
if(c==p)
{
n=m-m%5;
st=dt+1;
}
if(c<p)
{
n=m;
st=m+1;
}
else
{
dt=m-1;
}
}
if(p==0)
n=1;
fout<<n;
return 0;
}