# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
781282 | OrazB | The Big Prize (IOI17_prize) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "prize.h"
int find_best(int n) {
int l = 0, r = n;
while(l <= r){
int md = (l+r)/2;
vector<int> a = ask(md);
if (a[0] == a[1]) return md;
if (a[0] > a[1]) r = md - 1;
else l = md + 1;
}
}