# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
597826 | yanndev | The Big Prize (IOI17_prize) | C++17 | 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 <bits/stdc++.h>
#include <prize.h>
using namespace std;
int find_best(int n) {
int l = 0;
int r = n - 1;
while (l < r) {
int m = (l + r) / 2;
int ans[2] = ask(m);
if (ans[0] == 0 && ans[1] == 0)
return m;
if (ans[0] > 0)
r = m - 1;
else
l = m + 1;
}
return l;
}