# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
738472 | Elvin_Fritl | 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;
#include "prize.h"
int find_best(int n) {
int l=0,r=n-1;
while(l<=r){
int mid=(l+r)>>1;
int a[2]=ask(mid);
if(a[0] == a[1] && a[0] == 0){
return mid;
}
if(a[0]==0){
l=mid+1;
}
else{
r=mid-1;
}
}
return 0;
}