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;
//
// bool jump(int x) {
// cout << p << "-> ";
// p += x;
// p %= m;
// cout << p << "\n";
// if(p == 0)
// return true;
// return (m-p) <= m/2;
// }
void escape(int n) {
while(!jump(1)) continue;
while(jump(1)) continue;
jump(n-1);
}
// 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... |