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/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/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
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
- Total
- Today
- Yesterday
- 다이나믹프로그래밍
- 동적프로그래밍
- 로드나인
- BFS
- MySQL
- create db
- 다이나밍프로그래밍
- MOD
- 은둔청년체험
- 면접비
- node.js
- 롱베케이션
- 면접질문
- 서버개발
- 서버점검
- 그래프
- create databases;
- 최소공통조상
- 투포인터
- DB 생성
- 개발자면접
- 투포인터 연습
일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 | 31 |