题解 | 约瑟夫环

#include <iostream>
using namespace std;

int main() {
    int n, k, m;
    cin >> n >> k >> m;
    m -= 1;
    int arr[100] = { 0 };
    int ny = n;
    int my = m;
    while (ny - 1)
    {
        while (my)
        {
            if (!arr[k]) my--;
            k = (k + 1) % n;
            while (arr[k])
                k = (k + 1) % n;
        }
        my = m;
        arr[k] = 1;
        ny--;
        while (arr[k])
                k = (k + 1) % n;
    }
    cout << k;
    return 0;
}
// 64 位输出请用 printf("%lld")