Pagini recente » Cod sursa (job #2135780) | Cod sursa (job #1572011) | Cod sursa (job #2765712) | Cod sursa (job #2564874) | Cod sursa (job #1486288)
#include <fstream>
using namespace std;
ifstream f("fact.in");
ofstream g("fact.out");
int p,i,w=0,nr;
long long pt[31],s=5;
long long n,dr,st;
int frac(int p)
{ int i=1,s=0;
while(pt[i]<=p)
{ s+=p/pt[i];
i++;
}
return s;
}
int main()
{ f>>n;
for(i=1;i<=27;i++) {pt[i]=s;s*=5;}
st=1;dr=n*5;
if(n==0) g<<-1; else w=1;
while(st<=dr and w==1)
{ p=(st+dr)/2;
nr=frac(p);
if(nr==n) {g<<p-p%5;w=0;}
if(nr<n) st=p+1; else if(nr>n) dr=p-1;
}
if(w==1) g<<-1;
return 0;
}