알고리즘 (with. 백준 문제풀이)/Queue3 백준 1966번 [프린터 큐] const fs = require('fs'); const input = fs.readFileSync("/dev/stdin").toString().trim().split("\n"); let [n, ...testcases] = input; // let [n, m] = [4, 2] // const priQ = [1, 3, 2, 4] for (let i = 0; i < n; i++) { let m = Number(testcases[i * 2].split(' ')[1]) let priQ = testcases[i * 2 + 1].split(' ').map(Number); let answer = 0; while (true) { let e1 = priQ.shift() if (e1 < Math.max(...priQ)) .. 2023. 9. 19. 백준 2161번 [카드1] const fs = require('fs'); const input = fs.readFileSync('/dev/stdin').toString().trim().split(); const n = Number(input[0]); let arr = Array.from(new Array(n), (x, i) => i+1); let answer = []; while(arr.length > 0){ answer.push(arr.shift()); if (arr.length > 0) { arr.push(arr.shift()); } } str = answer.join(" ") console.log(str) 2023. 9. 18. 백준 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 2023. 9. 18. 이전 1 다음