백준 1158번 [요세푸스 문제]

// const n = 7
// const k = 3

const fs = require('fs');
const input = fs.readFileSync('/dev/stdin').toString().trim().split();

let [n, k] = input[0].split(' ');

let queue = [];

for(let i=1; i<=n; i++){
    queue.push(i);
}

let answer = [];

while(queue.length != 0){
    
    for(let i=0; i<k-1; i++){
        queue.push(queue.shift());
    }
    answer.push(queue.shift());
}

const str = "<" + answer.join(', ') + ">";
console.log(str)