Baekjoon 11057번 오르막 수

문제

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

걸린 시간

-

풀이

JavaScript

const fs = require('fs');
const filePath = process.platform === 'linux' ? '/dev/stdin' : './input';
const stdin = fs.readFileSync(filePath).toString().trim().split('\n').map(s => s.trim());
const input = (() => {
  let line = 0;
  return () => stdin[line++];
})();

const n = parseInt(input());

const dp = Array.from(Array(n+1), () => Array(10));

for(let j = 0; j < 10; j++) dp[1][j] = 1;
for(let i = 2; i < n+1; i++){
  for(let j = 0; j < 10; j++){
    let tmp = 0;
    for(let k = j; k < 10; k++){
      tmp += dp[i-1][k];
      tmp %= 10007;
    }
    dp[i][j] = tmp;
  }
}

let ans = 0;
for(let j = 0; j < 10; j++){
  ans += dp[n][j];
  ans %= 10007;
}
console.log(ans);