Pagini recente » Cod sursa (job #1283844) | Istoria paginii runda/simulareoji2015p2 | Cod sursa (job #1274864) | Istoria paginii runda/hlo_cj_av_l3 | Cod sursa (job #1587866)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("fact.in");
ofstream fout("fact.out");
int nz(int x)
{
int ans=0,p5=5;
while(x>=p5)
{
ans=ans+x/p5;
p5=p5*5;
}
return ans;
}
int main()
{
int p,st,dr;
cin>>p;
st=1;dr=500000000;
while(st<=dr)
{
int mij=(st+dr)/2;
if(nz(mij)<p)
st=mij+1;
else
dr=mij-1;
}
if(nz(st)==p)
cout<<st;
else
cout<<-1;
return 0;
}