| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1018763 | 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<bits/stdc++.h>
using namespace std;
#define lli long long int
int find_best(int n){
int a[2];
int x=1,y=n,z;
while(x!=y){
z=(x+y)/2;
a=ask(z);
if(a[0]){
y=z-1;
}
else if(a[1]){
x=z+1;
}
else{
return z;
}
}
return x;
}
