#include "prize.h" #include <bits/stdc++.h> using namespace std; int find_best(int n) { int l=0, r=n-1, u=n-1; while(l<r) { int m=(l+r)/2; vector<int> res=ask(m); if(res[0]==res[1]&&res[1]==0){return m;} else if(res[0]>0)r=m-1; else l=m; } }

prize.cpp: In function 'int find_best(int)':
prize.cpp:12:1: warning: control reaches end of non-void function [-Wreturn-type]
   12 | }
      | ^