BOJ 11866 - 요세푸스 문제 0 [C++]

문제

링크

풀이

#include <iostream>
#include <queue>
using namespace std;
 
void solve(void) {
  int n, k;
  cin >> n >> k;
 
  queue<int> q;
  for (int i=1; i<=n; i++) {
    q.push(i);
  }
 
  cout << "<";
  while (!q.empty()) {
    for (int i=0; i<k-1; i++) {
      q.push(q.front());
      q.pop();
    }
    cout << q.front();
    q.pop();
    if (!q.empty()) cout << ", ";
  }
  cout << ">";
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  solve();
  return 0;
}