요세푸스 문제( 백준 1158/C++)

#include <iostream>
#include <queue>
using namespace std;

int main() {
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);
	int N, K;
	cin >> N >> K;
	queue<int> myQueue;
	
	for (int i = 1; i <= N; i++) {
		myQueue.push(i);
	}
	cout << "<";
	while (!myQueue.empty()) {
		for (int i = 1; i < K; i++) {
			myQueue.push(myQueue.front());
			myQueue.pop();
		}
		cout << myQueue.front();
		myQueue.pop();

		if (!myQueue.empty()) {
			cout << ", ";
		}
	}
	cout << ">" << endl;
	return 0;
}