# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
117274 | WongHokFong_cpp | 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 <iostream>
#include <cstdio>
#include <cstdio>
#include <iomanip>
#include <cstring>
#include <algorithm>
#include "prize.h"
using namespace std;
int find_best(int n)
{
int l=0,r=n-1;
int mid=(r+l)/2;
while(0==0)
{
int a[2]=ask(mid);
if(a[0]+a[1]==0) return mid;
if(a[0]==1) r=mid-1;
else l=mid+1;
}
}