Node.js)백준 1309번: 동물원

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

1309번: 동물원

const fs = require('fs');
const N = +fs.readFileSync("./dev/stdin").toString().trim();


let dp = Array.from(Array(N+1),()=>[]);
//[없,왼,오]
dp[1] = [1,1,1]

for(let i  = 2; i<=N; i++){
  dp[i] = [
    (dp[i-1][0]+dp[i-1][1]+dp[i-1][2])%9901,
    (dp[i-1][0]+dp[i-1][2])%9901,
    (dp[i-1][0]+dp[i-1][1])%9901
  ]
}

console.log((dp[N][0]+dp[N][1]+dp[N][2])%9901)