Josephus

Josephus

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

void josephus2(int n, int k) {
  queue < int > q;
  for (int i = 1; i <= n; i++) q.push(i);
  int d = n, v = 0, x;
  while (d > 1) {
    int x = q.front();
    q.pop();
    ++v;
    if (v == k) {
      d--;
      v = 0;
    } else q.push(x);
  }
  cout << "\n Phan tu con sot lai la: " << q.front();
}

int main() {
  josephus2(9, 2);
  return 0;
}