[JavaScript/백트래킹] 백준 실버 3 : 15656 - N과 M (7)

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

15656번: N과 M (7)

---

📌 작성한 코드 

// 15656
const fs = require("fs");
const filePath = process.platform === "linux" ? "/dev/stdin" : "Beakjoon/Silver/test.txt";
const input = fs.readFileSync(filePath).toString().trim().split("\n");

const [N, M] = input[0].split(" ").map(Number);
const numbers = input[1]
    .split(" ")
    .map(Number)
    .sort((a, b) => a - b);

let arr = new Array(M).fill(0);
let answer = "";

const tracking = (count) => {
    if (count === M) {
        answer += `${arr.join(" ")}\n`;
        return;
    }

    for (let i = 0; i < N; i++) {
        arr[count] = numbers[i];
        tracking(count + 1);
    }
};

tracking(0);
console.log(answer);

 

✅ 성공