요세푸스 문제

#include <algorithm>
#include <iostream>
#include <stdio.h>
#include <vector>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <string>
#include <cmath>
using namespace std;


int main() {
	//freopen("input.txt", "rt", stdin);
	int n, k;
	scanf("%d %d", &n, &k);
	queue<int> q;
	for (int i = 1; i <= n; i++) {
		q.push(i);
	}
	printf("<");
	while (q.size() > 1) {
		for (int i = 0; i < k-1; i++) {
			int f = q.front();
			q.pop();
			q.push(f);
		}
		int r = q.front();
		q.pop();
		printf("%d, ", r);
	}
	printf("%d>", q.front());

	return 0;
}