# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
524769 | obokaman | 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 <iostream>
using namespace std;
int[] ask(int i);
int find_best(int n) {
for (int i = 0; i < n; ++i) {
auto ans = ask(i);
if (ans[0]==0 && ans[1]==0) {
return i;
}
}
return -1;
}