# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
889923 | elotelo966 | 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"
#include <bits/stdc++.h>
using namesapce std;
int find_best(int n) {
int l=0,r=n;
while(l<=r) {
int m=(l+r)/2;
std::vector<int> res = ask(m);
if(res[0] + res[1] == 0)
return m;
if(res[0]<res[1])
l=m+1;
else r=m-1;
}
return 0;
}