Pagini recente » Cod sursa (job #2679842) | Cod sursa (job #981394) | Cod sursa (job #190261) | Cod sursa (job #951424) | Cod sursa (job #8702)
Cod sursa(job #8702)
#include<stdio.h>
#include<math.h>
long int n,a,b,c;
long int h(long int x)
{
long int div;
long int nr=x;
while(nr!=0) {div++;nr=nr/5;}
return div;
}
long int binar(long int a,long int b)
{
c=(a+b)/2;
k=h(c);
if(k==n) return c;
else if(k<n) return binar(a,c-1);
else return binar(c+1,b);
}
int main()
{
FILE *in=fopen("fact.in","rt");
fscanf(in,"%ld",&n);
fclose(in);
FILE *out=fopen("fact.out","wt");
fprintf(out,"%ld",binar(1,1000000000));
fclose(out);
return 0;
}