[알고리즘/백준/1158] 요세푸스 문제

문제

---

https://www.acmicpc.net/problem/1158

1158번: 요세푸스 문제

 

풀이

---

let fs = require("fs");
const filePath = process.platform === "linux" ? "/dev/stdin" : "./input.txt";
const [N, K] = fs.readFileSync(filePath).toString().split(" ").map(Number);

const people = Array.from({ length: N }, (val, idx) => idx + 1);
const answer = [];
let idx = 0;
while (people.length) {
  idx = (idx + K - 1) % people.length;

  answer.push(+people.splice(idx, 1));
}

console.log(`<${answer.join(", ")}>`);