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"
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define F first
#define S second
#define pb push_back
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
void escape(int n) {
	bool init = jump(0);
	int last = 1+n/2;
	rep(d,1,32){
		ll dd = 1<<d;
		int j = (n+dd-1)/dd;
		int u = j;
		if(!init){
			u = (n-last+j)%n;
		}
		last=j;
		init=jump(u);
	}
	if(!init)jump(n-last);
}
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... |