Node.js) 백준 28447번: 마라탕 재료 고르기

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

28447번: 마라탕 재료 고르기

const [[N, K], ...mara] = require('fs')
	.readFileSync('./dev/stdin')
	.toString()
	.trim()
	.split('\n')
	.map((v) => v.split(' ').map(Number));
let answer = -Infinity;
if (K == 1) {
	console.log(0);
	process.exit();
}
for (let i = 0; i < 1 << N; i++) {
	let temp = i;
	const possible = [];
	let cnt = 0;
	while (temp > 0) {
		if ((temp & 1) === 1) {
			possible.push(cnt);
		}
		cnt++;
		temp >>= 1;
	}

	if (possible.length == K) {
		let max = 0;
		for (let a = 0; a < K; a++) {
			for (let b = a; b < K; b++) {
				const ma = possible[a];
				const ra = possible[b];
				max += mara[ma][ra];
			}
		}
		if (max > answer) {
			answer = max;
		}
	}
}
console.log(answer);