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/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..
https://www.acmicpc.net/problem/24955// https://www.acmicpc.net/problem/24955class Node { constructor(item) { this.item = item; this.next = null; }}class Queue { constructor() { this.head = null; this.tail = null; this.length = 0; } push(item) { const node = new Node(item); if (this.head == null) { this.head = node; } else { this.tail.next = node; } this.tail = node; this.length +..
- Total
- Today
- Yesterday
- node.js
- 투포인터
- 면접비
- 롱베케이션
- 서버점검
- 투포인터 연습
- MOD
- 동적프로그래밍
- create db
- 은둔청년체험
- BFS
- 면접질문
- DB 생성
- 그래프
- 개발자면접
- MySQL
- 로드나인
- 서버개발
- 최소공통조상
- 다이나믹프로그래밍
- create databases;
- 다이나밍프로그래밍
일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
1 | 2 | 3 | 4 | 5 | 6 | 7 |
8 | 9 | 10 | 11 | 12 | 13 | 14 |
15 | 16 | 17 | 18 | 19 | 20 | 21 |
22 | 23 | 24 | 25 | 26 | 27 | 28 |
29 | 30 |