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 "grader.h"
///Subtask 2
///Binary Search
int HC(int N){
int L=1,R=N;
while(L<R){
int mid=(L+R)/2;
Guess(mid);
int act=Guess(mid+1);
if(act==-1){
R=mid;
}
else{
L=mid+1;
}
}
return L;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |