Pagini recente » Cod sursa (job #1152996) | Cod sursa (job #1257307) | Istoria paginii runda/eusebiu_oji_2011_cls9 | Cod sursa (job #54872) | Cod sursa (job #850769)
Cod sursa(job #850769)
#include <stdio.h>
int n;
int nrz(int k) {
int rez = 0;
for (int i = 5 ; i <= k ; i *=5) {
rez += k / i;
}
return rez;
}
int cbin(int l,int h) {
if (l > h) {
return -1;
}
int mid = (l + h) / 2;
int x = nrz(mid);
if (x == n) {
return mid - mid % 5;
}
if (x > n) {
return cbin(l,mid - 1);
} else {
return cbin(mid + 1,h);
}
}
int main() {
freopen("fact.in","r",stdin);
freopen("fact.out","w",stdout);
scanf("%d",&n);
printf("%d",cbin(0,500000000));
return 0;
}