백준 소스코드 [C++] 11866 요세푸스 문제 0

www.acmicpc.net/problem/11866

11866번: 요세푸스 문제 0

백준 소스코드 [C++] 11866 요세푸스 문제 0

#include <iostream>
#include <utility>
#include <vector>
#include <queue>
#include <algorithm>
#include <string>
using namespace std;
int main() {
	queue <int> q;
	int n, k;
	cin >> n >> k;
	for (int i = 1;i <= n;i++) q.push(i);
	cout << "<";
	while ((int)q.size() != 1) {
		for (int j = 0;j < k-1;j++) {
			q.push(q.front());
			q.pop();
		}
		cout << q.front() << ", ";
		q.pop();
	}
	cout << q.front() << ">";
 	return 0;
}