Pagini recente » Cod sursa (job #103385) | Cod sursa (job #51692) | Diferente pentru autumn-warmup-2007/solutii/runda-2 intre reviziile 56 si 38 | Cod sursa (job #1285551) | Cod sursa (job #261071)
Cod sursa(job #261071)
#include <stdio.h>
long long t,p,n,u,nr0,x,y,nc;
int main(){
FILE *f = fopen("fact.in", "r");
FILE *g = fopen("fact.out", "w");
x=0;
y=1<<62;
fscanf(f,"%lld",&p);
while (x<=y) {
n=x+(y-x)/2;
t=5;
nr0=0;
while (t<=n) {
nr0+=n/t;
t*=5;
}
if (nr0>=p) {
y=n-1;
nc=n;
}
else
x=n+1;
}
if (nc)
fprintf(g,"%lld",nc);
else
fprintf(g,"-1");
fclose(f);
fclose(g);
return 0;
}