题解 | 约瑟夫环

#include<bits/stdc++.h>
using namespace std;
int main() {
	int n, k, m;
	cin >> n >> k >> m;
	vector<int>v(n, 1);
	int i = k;
	int step = 1;
	int p = n;
	while (p != 1) {
		if (v[i] == 1 && step == m) {
			v[i] = 0;
			step = 1;
			p--;
		} else if (v[i] == 1 && step != 0)step++;
		if (i == n)i = 0;
		else i++;
	}
	for (int i = 0; i < n; i++) {
		if (v[i] == 1)cout << i;
	}
}