[C++] 요세푸스(Queue) - 1158

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

int main()
{
	queue<int> q;
	int N, K;

	cin >> N;
	cin >> K;

	for (int i = 1; i < N + 1; i++)
		q.push(i);
	

	cout << "<";
	for (int i = 1; !q.empty(); i++)
	{
		if (i % K == 0)
		{
			cout << q.front();
			if (q.size() == 1)
				cout << ">";
			else
				cout << ", ";
		}
		else
			q.push(q.front());

		q.pop();
	}
	
	return 0;

}