josephus-problem-i.cpp

#include <bits/stdc++.h>
using namespace std;

int main() {
  int n;
  cin >> n;
  queue<int> q;
  for (int i = 1; i <= n; i++) {
    q.push(i);
  }
  while (!q.empty()) {
    int skip = q.front(); q.pop();
    q.push(skip);
    int take = q.front(); q.pop();
    cout << take << " ";
  }
  cout << "\n";
  return 0;
}