Pagini recente » Cod sursa (job #1013369) | Cod sursa (job #1655716) | Cod sursa (job #1014041) | Cod sursa (job #1082838) | Cod sursa (job #202510)
Cod sursa(job #202510)
#include <stdio.h>
#include <values.h>
#include <math.h>
long zerouri(long n)
{
long zero=0;
int i,max=0;
for (i=1;i<=n;i++)
{
if (pow(5,i)<=n)
{
zero+=n/pow(5,i);
} else break;
}
return zero;
}
long p,rez=0;
int binsearch(long a,long b)
{
long c=(a+b)/2;
if (zerouri(c)<p)
{
return binsearch(a,c);
} else
if (zerouri(c)>p)
{
return binsearch(c+1,b);
} else
{
if (rez==0)
rez=c;
}
return 0;
}
int main()
{
freopen("fact.in","r",stdin);
freopen("fact.out","w",stdout);
scanf("%ld",&p);
long a=0,b=2000000;
long c=0;
if (p!=0)
{
binsearch(a,b);
printf("%ld",rez);
} else
printf("1");
// printf("%ld",zerouri(p));
return 0;
}