Cod sursa(job #358782)
| Utilizator | Data | 24 octombrie 2009 15:14:54 | |
|---|---|---|---|
| Problema | Factorial | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
#include<stdio.h>
long long n=200000000;
int zero(int n)
{
int nr=0;
while(n)
{
nr+=n/5;
n/=5;
}
return nr;
}
long long binary_search(int val)
{
int i,step;
for (step=1;step<n;step<<=1);
for (i=0;step;step>>=1)
if (i+step<=n&&zero(i+step)<val)
i+=step;
return i+1;
}
int main()
{
int p;
freopen("fact.in","r",stdin);
freopen("fact.out","w",stdout);
scanf("%lld",&p);
printf("%lld",binary_search(p));
return 0;
}
