Node.js) 백준 2775번: 부녀회장이 될꺼야

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

2775번: 부녀회장이 될테야

 

dp[i][j]는 i층 j호에 거주하는 거주민

조건식

dp[i][j] = dp[i-1][j] + dp[i][j-1] (i>0, j>0)

초기값

dp[0] = [1,2,3,4,5,6,7,8,9,10,11,12,13,14,15];

dp[n][0] = 1;

 

 

const input = require('fs').readFileSync('./dev/stdin').toString().trim().split('\n').map(Number);

let dp = Array.from(Array(15), () => Array(15).fill(0));
for (let i = 0; i < 15; i++) {
	dp[0][i] = i + 1;
}

for (let i = 0; i < 15; i++) {
	dp[i][0] = 1;
}

for (let k = 1; k < 15; k++) {
	for (let n = 1; n < 15; n++) {
		dp[k][n] = dp[k - 1][n] + dp[k][n - 1];
	}
}

const answer = [];
const T = input.shift();
for (let t = 0; t < T; t++) {
	const k = input.shift();
	const n = input.shift();
	answer.push(dp[k][n - 1]);
}

console.log(answer.join('\n'));