1158 요세푸스 문제

#include <iostream>
#include <list>

using namespace std;

void solve() {
	list<int> itemList;
	int n, k;
	cin >> n >> k;

	for (int i = 0; i < n; i++)
		itemList.push_back(i + 1);
	cout << "<";
	for (int i = 0; i < n - 1; i++) {
		for (int j = 0; j < k - 1; j++) {
			itemList.push_back(itemList.front());
			itemList.pop_front();
		}
		cout << itemList.front() << ", ";
		itemList.pop_front();
	}
	cout << itemList.front() << ">\n";
}
int main() {
	solve();
	return 0;
}