# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
140098 | davitmarg | The Big Prize (IOI17_prize) | C++17 | 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.
//DM
#include <iostream>
#include <cmath>
#include <algorithm>
#include <vector>
#include <string>
#include <cstring>
#include <map>
#include <set>
#include <queue>
#include "prize.h"
#define LL long long
#define mod 1000000007ll
#define MP make_pair
#define PB push_back
#define all(v) v.begin(),v.end()
using namespace std;
int find_best(int n)
{
int l=0,r=n-1,m,pos;
while(l<=r)
{
m=(l+r)/2;
if(!ask(m).first)
{
pos=m;
l=m+1;
}
else
r=m-1;
}
return pos;
}
/*
int main()
{
return 0;
}
*/
/*
*/