Pagini recente » Cod sursa (job #3146380) | Cod sursa (job #2188938) | Cod sursa (job #2421930) | Cod sursa (job #22207) | Cod sursa (job #156124)
Cod sursa(job #156124)
#include<fstream.h>
#include<math.h>
long s=1,d=2000000,m,k,c,z=0,n,p;
int main()
{
ifstream f("fact.in");
ofstream g("fact.out");
f>>n;
m=(s+d)/2;
while (z!=n&&s<d)
{z=0; k=5;p=1;
while(k<=m)
{
c=m/k; z+=c;
p++;
k=pow(5,p);
}
if(z<n) {s=m+1; m=(s+d)/2;}
else if(z>n) {d=m-1; m=(s+d)/2;}
}
if(z==n) g<<m-(m%5);
else g<<"-1";
f.close();
g.close();
return 0;
}