[요세푸스] 백준 1158 요세푸스 C++

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

int n, k;
queue<int> q;
vector<int > ans;

int main(void) {
	ios_base::sync_with_stdio(0);
	cin.tie(0), cout.tie(0);

	cin >> n >> k;

	for (int i = 0; i < n; i++)
	{
		q.push(i + 1);
	}

	for (int i = 0; i < n; i++)
	{
		for(int j = 0; j < k - 1; j++)
		{
			q.push(q.front());
			q.pop();
		}
		ans.push_back(q.front());
		q.pop();
	}

	for (int i = 0; i < ans.size(); i++)
	{
		if (i == 0)
		{
			cout << "<";
		}

		if (i == ans.size() - 1)
		{
			cout << ans[i] << ">";
			break;
		}

		cout << ans[i] << ", ";
	}
}