Node.js)백준 9711번: 피보나치

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

 

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

const dp = [0, 1, 1, 2, 3, 5, 8].map((v) => BigInt(v));

for (let i = 6; i <= 10000; i++) {
	dp[i] = dp[i - 1] + dp[i - 2];
}

const answer = input.map((v, i) => {
	const [p, q] = v;
	return `Case #${i + 1}: ${(dp[p] % BigInt(q)).toString()}`;
});
console.log(answer.join('\n'));