Pagini recente » Cod sursa (job #2481790) | Cod sursa (job #2760299) | Cod sursa (job #1308764) | Cod sursa (job #2813367) | Cod sursa (job #247985)
Cod sursa(job #247985)
//#include<algorithm>
//using namespace std;
#include<stdio.h>
int p;
void solve(){
int st,dr,x,y,m,k,ok;
scanf("%d",&p);
if(!p)
printf("1");
else{
for(st=1,dr=30000,ok=0; st<dr; ){
m=(st+dr)/2;
for(x=m,k=0; x; k+=x/=5);
if(k>p)
dr=m-1;
else if(k<p)
st=m+1;
else{
y=m;
ok=1;
break;}}
if(ok){
for(k=p; k==p; --y)
for(x=y,k=0; x; k+=x/=5);
printf("%d",y);}
else
printf("-1");}}
int main(){
freopen("fact.in","r",stdin);
freopen("fact.out","w",stdout);
solve();
return 0;}