Cod sursa(job #281571)
Utilizator | Data | 15 martie 2009 13:13:56 | |
---|---|---|---|
Problema | Factorial | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include <stdio.h>
int bin(int p)
{ int hi=10000000,mid,lo=1,e,a;
while(lo<=hi)
{ mid=lo+(hi-lo)/2;
a=mid;e=0;
while(a/5)
{ e+=a/5;
a/=5;
}
if(p<e) hi=mid-1;
else if(p>e) lo=mid+1;
if(p==e) return mid;
}
return -1;
}
int main()
{int n;
freopen("fact.in","r",stdin);
freopen("fact.out","w",stdout);
scanf("%d",&n);
printf("%d",bin(n));
return 0;
}