Pagini recente » Cod sursa (job #1983104) | Cod sursa (job #2797471) | Cod sursa (job #445315) | Cod sursa (job #2139676) | Cod sursa (job #585832)
Cod sursa(job #585832)
#include<cstdio>
using namespace std;
int vit[50001], n, nrb;
inline int isPossible(int tmp) {
int i, j, m = 0;
for(i = 1; i <= n; ++i)
m += tmp / vit[i];
if(m < nrb)
return 0;
return 1;
}
int cautabinar() {
int i, r = 1 << 31; // mareste cam pana la 32
for(i = 1 << 30; i >= 1; i >>= 1) {
if(isPossible(r - i))
r -= i;
}
return r;
}
int main() {
int i, j, ax;
freopen("fabrica.in", "rt", stdin);
freopen("fabrica.out", "wt", stdout);
scanf("%d%d%d", &nrb, &n, &ax);
for(i = 1; i <= n; ++i)
scanf("%d", &vit[i]);
ax = cautabinar();
printf("%d %d\n", ax, ax + 1);
return 0;
}