인프런 커뮤니티 질문&답변

let n = 5;
let k = 3;
let arr = [2, 4, 5, 8, 12];
let m = 6;

console.log(solution(n, k, arr, m));

function solution(n, k, arr, m){
  let temp = Array.from({length: k}, () => 0);
  let cnt=0;

  function DFS(L, S){
    if (L === k){
      let sum = temp.reduce((prev, cur) => prev+cur);
      if (sum % m === 0) cnt++;
    }else{
      for (let i=S; i<n; i++){
        temp[L]=arr[i];
        DFS(L+1, i+1);
      }
    }
  }

  DFS(0, 0);
  return cnt;
}