# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
108003 | 2019-04-26T18:36:43 Z | reda | The Big Prize (IOI17_prize) | C++14 | 0 ms | 0 KB |
#include<bits/stdc++.h> #include "prize.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); } }