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 <bits/stdc++.h>
#include "cycle.h"
using namespace std;
const int mxN = 1e9+5;
// int m, p, cnt = 0;
//
// bool jump(int x) {
//     cnt++;
//     cout << p << " -> ";
//     p += x;
//     p %= m;
//     cout << p << "\n";
//     cout << cnt << "\n";
//     if(p == 0)
//         return true;
//     return (m-p) <= m/2;
// }
void escape(int n) {
    if(jump(0))
        jump(n/2);
    while(!jump(1)) continue;
    jump(n/2);
}
// int main() {
//     scanf("%d %d", &m, &p);
//     escape(m);
//     return 0;
// }
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... |