n,m,k = (*map(int,input().split()),)
pos,monkey = k,[*range(1,n+1)]
while len(monkey)>1:
pos = k if pos==m else m
idx = (pos-1) % len(monkey)
monkey = monkey[:idx][::-1] + monkey[idx+1:][::-1]
print(*monkey)
https://ask.csdn.net/questions/7706963?spm=1005.2026.3001.5622
静态数组版,供参考:
#include <stdio.h>
#define N 201
void dele(int* a, int t, int n) {
if (t < 0 || t >= n) return;
for (int i = t; i < n - 1; ++i)
a[i] = a[i + 1];
}
int main()
{
int n, m, k, arr[N] = { 0 }, ret;
ret = scanf("%d%d%d", &n, &m, &k);
if (ret == 3) {
for (int i = 0; i < n; ++i)
arr[i] = i + 1;
int pos = 0;
while (n > 1) {
pos = (pos + m - 1) % n;
dele(arr, pos, n);
n--;
pos = (pos + n - k - 1) % n + 1;
if (pos < 0) pos += n;
dele(arr, pos, n);
n--;
}
printf("%d", arr[0]);
}
return 0;
}