Pagini recente » Cod sursa (job #2827) | Cod sursa (job #509112) | Cod sursa (job #249475) | Cod sursa (job #1300767) | Cod sursa (job #1627151)
#include <fstream>
#include<cmath>
using namespace std;
ifstream f("factorial.in");
ofstream g("factorial.out");
int numar (long long n)
{
int p=5,nr=0;
while(p<=n)
{
nr=nr+n/p;
p*=5;
}
return nr;
}
int main()
{
long long sum=0,i=0,j=0,p,d,st=1,dr=1000000000,mij,k,sol;
f>>k;
while(st<=dr)
{mij=(st+dr)/2;
d=numar(mij);
if(d>=k)
{ sol=mij;
dr=mij-1;
}
else if(d<k)
{
st=mij+1;
}
}
if(numar(sol)==k) g<<sol; else g<<-1;
f.close();
g.close();
return 0;
}