Pagini recente » Cod sursa (job #1850686) | Cod sursa (job #2929882) | Cod sursa (job #2278498) | Cod sursa (job #833677) | Cod sursa (job #531625)
Cod sursa(job #531625)
#include<cstdio>
using namespace std;
long long int p,st,dr,mij,a;
long long int f(long long int n){
long long int x=1,i,nr=0;
for(i=1;i<=13;++i){
x*=5;
nr+=n/x;
}
return nr;
}
int main(){
freopen("fact.in","r",stdin);
freopen("fact.out","w",stdout);
scanf("%lld\n",&p);
dr=5000000000LL;
while(st<=dr){
mij=st+(dr-st)/2;
if(f(mij)<=p){
st=mij+1;
}
if(f(mij)>=p){
dr=mij-1;
}
}
mij=st+(dr-st)/2;
if(f(mij)==p){
a=mij;
while (a%5!=0){
--a;
}
}
else {
a=-1;
}
printf("%lld\n",a);
return 0;
}