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