# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1018769 | 2024-07-10T09:37:52 Z | vjudge1 | The Big Prize (IOI17_prize) | C++17 | 0 ms | 0 KB |
#include "prize.h" #include<bits/stdc++.h> using namespace std; #define lli long long int int find_best(int n){ int a[2]; int x=1,y=n,z; while(x!=y){ z=(x+y)/2; a=ask(z); if(a[0]){ y=z-1; } else if(a[1]){ x=z+1; } else{ return z; } } return x; }