| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 373964 | FEDIKUS | Exam (eJOI20_exam) | 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.
#include "exam.h"
int solve(int n){
int ret=0;
int res=INT_MAX;
int prvi=1;
int drugi=n-1;
int koliko=1;
while(true){
if(drugi>prvi) break;
if(query(prvi,drugi)){
return koliko;
}
if(query(prvi,drugi)) return koliko;
if(prvi>0 && query(prvi-1,drugi)) return koliko;
if(drugi<n-1 && query(prvi,drugi+1)) return koliko;
}
return ret;
}