Pagini recente » Cod sursa (job #3222890) | Cod sursa (job #1134019) | Cod sursa (job #1990455) | Cod sursa (job #1574167) | Cod sursa (job #1145372)
#include <cstdio>
using namespace std;
long long nr(long long mij){
long long nr5=0;
while(mij>0){
nr5=nr5+mij/5;
mij=mij/5;
}
return nr5;
}
long long bs(long long st,long long dr,int p){
long long ans=-1;
while(st<=dr){
long long mij=st+(dr-st)/2;
if(nr(mij)>=p){
if(nr(mij)==p) ans=mij;
dr=mij-1;
}
else st=mij+1;
}
return ans;
}
int main()
{
freopen("fact.in","r",stdin);
freopen("fact.out","w",stdout);
int p;
long long st=1,dr=(1LL<<60),n;
scanf("%d",&p);
n=bs(st,dr,p);
printf("%lld",n);
return 0;
}