题解 | 约瑟夫环

#include<bits/stdc++.h>
using namespace std;
int main() {
	int n, k, m;
	cin >> n >> k >> m;
	int arr[101] = {0};
	for (int i = 0; i < n; i++) {
		arr[i] = i;
	}
	vector<int>v(arr, arr + n);
	int c = (k - 1 + n) % n;
	while (v.size() != 1) {
		c = (c + m - 1) % v.size();
		v.erase(v.begin() + c);
	}
	cout << v[0]+1;
	return 0;
}