GPD2021

https://www.acmicpc.net/problem/24418 //https://www.acmicpc.net/problem/24418const input = require('fs') .readFileSync('./dev/stdin') .toString() .trim() .split('\n') .map((v) => v.split(' ').map(Number));const N = input.shift()[0];let count = 0;input.unshift(new Array(N).fill(0));const arr = input.map((v) => [0, ...v]);function test(arr, n, m) { if (n == 0 || m == 0) { count++; return 0; } el..

https://www.acmicpc.net/problem/24417//https://www.acmicpc.net/problem/24417const N = +require('fs').readFileSync('./dev/stdin').toString().trim();const MOD = 1_000_000_007;let temp1 = 1;let temp2 = 1;let temp3 = 0;for (let i = 3; i

https://www.acmicpc.net/problem/15489//https://www.acmicpc.net/problem/15489const [R, C, W] = require('fs').readFileSync('./dev/stdin').toString().trim().split(' ').map(Number);const dp = [[1], [1, 1]];const N = R + W - 2;for (let i = 2; i

https://www.acmicpc.net/problem/14495  const N = +require('fs').readFileSync('./dev/stdin').toString().trim();const dp = [0, 1, 1, 1].map((v) => BigInt(v));for (let i = 4; i

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

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

https://www.acmicpc.net/problem/2233 class Apple { constructor(pos1, parent) { this.position = [pos1]; this.parent = parent; this.height = parent?.height ? parent.height + 1 : 1; } mark(pos2) { this.position.push(pos2); }}const input = require('fs').readFileSync('./dev/stdin').toString().trim().split('\n');const N = +input[0];const binary = input[1].trim();const [t1, t2] = input[2].split(' '..

https://www.acmicpc.net/problem/11437 // https://www.acmicpc.net/problem/11437class Node { constructor(index) { this.index = index; this.parent = null; this.height = null; this.adj = []; } setHeight(p) { this.parent = p; this.height = p == -1 ? 0 : nodes[p].height + 1; this.adj.forEach((child) => { if (child != this.parent) { nodes[child].setHeight(this.index); } }); }}const input..