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;
int n;
bool Jump(int x) { return jump((x % n + n) % n); }
void escape(int _n) {
    n = _n;
    
    if (n == 2) { Jump(1); return; }
    
    bool lst = Jump(0);
    if (!lst) lst = Jump(n/2);
    for (int step = (1 << __lg(n-1)); step >= 1; step >>= 1) {
        if (lst) {
            lst = Jump(-step);
        }
        else {
            lst = Jump(step);
        }
    }
    if (lst) lst = Jump(n/2);
    else     lst = Jump(n/2 + 1);
    if (!lst) lst = Jump(-1);
}
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... |