GPD2021

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 { const [p, q] = v; return `Case #${i + 1}: ${(dp[p] % BigInt(q)).toString()}`;});console.log(answer.join('\n'));

https://www.acmicpc.net/problem/17212 const N = +require('fs').readFileSync('./dev/stdin').toString().trim();const dp = [0, 1, 1, 2, 2, 1, 2, 1];for (let i = 8; i

https://www.acmicpc.net/problem/25418let [A, K] = require('fs').readFileSync('./dev/stdin').toString().trim().split(' ').map(Number);let cnt = 0;while (K != A) { cnt++; if (K % 2 == 0 && K / 2 >= A) { K /= 2; } else { K--; }}console.log(cnt);