题解 | 约瑟夫环

#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
using namespace std;
int N = 1001;
int T = 10e5;
void solve() {
    int n, m, k;
    cin >> n >> k >> m;
    int res = 0;
    for (int i = 2 ; i <= n; ++i) {
        res = (res + m) % i;
    }
    res = (res + k) % n;
    cout << res << endl;

}
int main() {
    int t  = 1;
    // cin >> t;
    while (t--) {
        solve();
    }


    return 0;
}