GPD2021

https://boj.ma/9251 9251번: LCS boj.ma LCS 설명 GOAT [알고리즘] 그림으로 알아보는 LCS 알고리즘 - Longest Common Substring와 Longest Common SubsequenceLCS는 주로 최장 공통 부분수열(Longest Common Subsequence)을 말합니다만, 최장 공통 문자열(Longest Common Substring)을 말하기도 합니다.velog.io const [N, M] = require('fs').readFileSync('./dev/stdin').toString().trim().split('\n');const dp = Array.from(Array(N.length + 1), () => Array(M.length..

https://www.acmicpc.net/problem/5525const [N, M, S] = require('fs').readFileSync('./dev/stdin').toString().trim().split('\n');let i = 0;let cnt = 0;let answer = 0;while (i

https://www.acmicpc.net/problem/17500 class Item { next = null; constructor(value) { this.value = value; }}class Queue { head = null; tail = null; size = 0; constructor() {} push(value) { const node = new Item(value); if (this.head == null) { this.head = node; } else if (this.tail) { this.tail.next = node; } this.tail = node; this.size += 1; } pop() { if (this.head) { const popItem..

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