Pagini recente » Cod sursa (job #1915230) | Cod sursa (job #2635970) | Cod sursa (job #205692) | Cod sursa (job #1147650) | Cod sursa (job #1740160)
#include <fstream>
using namespace std;
ifstream in("fact.in");
ofstream out("fact.out");
long long n,i,j,p,st,dr,m,p5[13],nr,ok;
int main()
{
in>>p;
p5[0]=1;
for(i=1;i<=12;i++)
{
p5[i]=p5[i-1]*5;
}
if(p)
{
st=1; dr=500000001;
while(st<=dr)
{
nr=0;
m=st+(dr-st)/2;
for(i=1;i<=12;i++) nr+=m/p5[i];
if(nr>p) dr=m-1;
else if(nr<p) st=m+1;
else st=dr+1, m=m-(m%5),ok=1;
}
if(ok) out<<m<<'\n';
else out<<-1<<'\n';
}
else out<<1<<'\n';
return 0;
}