| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 820619 | vjudge1 | 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 "prize.h"
using namespace std;
int find_best(int n) {
int l = 0, r = n;
while (r - l > 1){
int mid = (l + r)/2;
vector<int> res = ask(mid);
cout << mid << "\n";
if (res[0] > 0)
r = mid;
else
l = mid;
}
return l;
}
