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 namespace std;
int find_best(int n) {
int cl = 0, cr = n, cm;
for (int i = 0; i < 22; i++) {
cm = (cl + cr) / 2;
vector<int> B = ask(cm);
if (B[0] == 1) cr = cm;
else cl = cm;
if (B[0] + B[1] == 0) return cm;
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |