kakasoo

// 백준 10819번 차이를 최대로를 풀었습니다. const readline = require("readline"); const rl = readline.createInterface({ input: process.stdin, output: process.stdout, }); rl.on("line", (line) => { if (isNaN(line)) { const permutation = [...permutations(line.split(" ").map(Number))]; const answer = []; for (let i = 0; i < permutation.length; i++) { let sum = 0; for (let j = 0; j < permutation[i].length - 1; j++)..

// 백준 10974번 모든 순열을 풀었습니다. const readline = require("readline"); const rl = readline.createInterface({ input: process.stdin, output: process.stdout, }); rl.on("line", (line) => { const elements = new Array(Number(line)).fill(0).map((el, i) => i + 1); const result = [...permutations(elements)].map((el) => el.join(" ")).sort(); for (const a of result) { console.log(a); } }); /** * * @param {number..