# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
80287 | 2018-10-19T19:11:01 Z | MoNsTeR_CuBe | The Big Prize (IOI17_prize) | C++17 | 0 ms | 0 KB |
#include "prize.h" #include <bits/stdc++.h> using namespace std; int find_best(int n) { int left = 0; int right = n-1; while(left < right){ int mid = (left+right)/2; int tab[] = ask(mid); if(tab[0]==1){ right = mid-1; }else if(tab[0] == 1){ left = mid+1; }else{ right = mid; break; } } return right; }