#include <iostream> using namespace std; constexpr int N = 2e5 + 10; int main() { int n, k, m; cin >> n >> k >> m; bool a[N]; for (int i = 1; i <= n; ++i) { a[i] = true; } int cur = k; int count = 0; while (count < n - 1) { int step = 0; while (step < m) { if (a[cur]) { ++step; } if (step == m) { a[cur] = false; ++count; break; } ++cur; if (cur > n) { cur = 1; } } } int king = 0; for (int i = 1; i <= n; ++i) { if (a[i]) { king = i; break; } } cout << king << endl; return 0; }
全部评论
(0) 回帖