GPD2021

https://www.acmicpc.net/problem/2104class Item { constructor(public value: T) {}}type MergeFunction = (this: SegmentTree, nodeA: Item, nodeB: Item) => Item;class SegmentTree { private lg: number; private sz: number; private n: number; tree: Array>; constructor(public inputArray: Array, private defualtValue: Item, private merge: MergeFunction) { this.n = inputArray.length; this.lg = Math.ceil(M..

https://www.acmicpc.net/problem/14607 const N = BigInt(require('fs').readFileSync('./dev/stdin').toString().trim());console.log(((N * (N - BigInt(1))) / BigInt(2)).toString());

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);

https://www.acmicpc.net/problem/17484  const input = require('fs') .readFileSync('./dev/stdin') .toString() .trim() .split('\n') .map((v) => v.trim().split(' ').map(Number));const [N, M] = input.shift();const dp = Array.from(new Array(N), () => Array.from(new Array(M), () => new Array(3).fill(0)));input[0].forEach((v, i) => { dp[0][i] = new Array(3).fill(v);});dp[0][0][0] = 0;dp[0][M - 1][2] = 0..

https://www.acmicpc.net/problem/17175//https://www.acmicpc.net/problem/17175const N = +require('fs').readFileSync('./dev/stdin').toString();if (N

https://www.acmicpc.net/problem/14494//https://www.acmicpc.net/problem/14494const [r, c] = require('fs').readFileSync('./dev/stdin').toString().trim().split(' ').map(Number);const dp = Array.from(new Array(r), () => new Array(c).fill(1));const MOD = 1_000_000_007;for (let i = 1; i