# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
108001 | reda | The Big Prize (IOI17_prize) | C++14 | 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;
int find_best(int n)
{
int mid = n/2;
int arr[2]=ask(mid);
if(arr[0]==0 && arr[1]==0)return mid;
else{
if(arr[0]>arr[1])
{
return find_best(mid);
}
else return find_best(mid+n/2);
}
}