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 "cycle.h"
void escape(int n) {
	bool result = jump(1);
	if(result!=1) jump(n/2);
	long long pos = 0; long long Lpos = 0; long long Rpos = n/2; long long mid;
	
	for(;;) {
		mid = (Lpos+Rpos)/2;
		if(Lpos==Rpos) {
			return;
		}
		
		else if (pos > mid) result = jump(n-(pos-mid));
		else result = jump(mid-pos);
		
		if (result==1) Lpos = mid+1;
		else Rpos = mid;
		
		pos = mid;
	}
}
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... |