Algorithm/baekjoon 썸네일형 리스트형 [NodeJS] 백준 15657번 - N과 M (8) /** * @link https://www.acmicpc.net/problem/15657 * @name N과_M_(8) */ const readline = require('readline'); const strToNumberArr = (str) => str.split(' ').map(Number); const rl = readline.createInterface({ input: process.stdin, output: process.stdout, }); const input = []; rl.on('line', (line) => { input.push(line); }).on('close', () => { const [n, m] = strToNumberArr(input.shift()); const resul.. 더보기 [NodeJS] 백준 1991 - 트리 순회 /** * @link https://www.acmicpc.net/problem/1991 * @name 트리_순회 */ const readline = require('readline'); const rl = readline.createInterface({ input: process.stdin, output: process.stdout, }); const input = []; rl.on('line', (line) => { input.push(line); }).on('close', () => { const n = Number(input.shift()); const result = solution( n, input.map((v) => v.split(' ')), ); console.log(result.join('.. 더보기 [NodeJS] 백준 1629 - 곱셈 /** * @link https://www.acmicpc.net/problem/1629 * @name 곱셈 */ const readline = require('readline'); const strToNumberArr = (str) => str.split(' ').map(BigInt); const rl = readline.createInterface({ input: process.stdin, output: process.stdout, }); const input = []; rl.on('line', (line) => { input.push(line); }).on('close', () => { const [a, b, c] = strToNumberArr(input[0]); const recur = (n1, n.. 더보기 [NodeJS] 백준 15654 - N 과 M (5) /** * @link https://www.acmicpc.net/problem/15654 * @name N과_M_(5) */ const readline = require('readline'); const strToNumberArr = (str) => str.split(' ').map(Number); const rl = readline.createInterface({ input: process.stdin, output: process.stdout, }); const input = []; rl.on('line', (line) => { input.push(line); }).on('close', () => { const [n, m] = strToNumberArr(input.shift()); const resul.. 더보기 [NodeJS] 백준 14500 - 테트로미노 /** * @link https://www.acmicpc.net/problem/14500 * @name 테트로미노 */ const readline = require('readline'); const strToNumberArr = (str) => str.split(' ').map(Number); const rl = readline.createInterface({ input: process.stdin, output: process.stdout, }); const input = []; rl.on('line', (line) => { input.push(line); }).on('close', () => { const [n, m] = strToNumberArr(input.shift()); const result =.. 더보기 [NodeJS] 백준 11725 - 트리의 부모 찾기 /** * @ljnk https://www.acmicpc.net/problem/11725 * @name 트리의_부모_찾기 */ const readline = require('readline'); const strToNumberArr = (str) => str.split(' ').map(Number); const rl = readline.createInterface({ input: process.stdin, output: process.stdout, }); const input = []; rl.on('line', (line) => { input.push(line); }).on('close', () => { const n = Number(input.shift()); const result = solution.. 더보기 [NodeJS] 백준 11403 - 경로 찾기 /** * @link https://www.acmicpc.net/problem/11403 * @name 경로_찾기 */ const readline = require('readline'); const strToNumberArr = (str) => str.split(' ').map(Number); const rl = readline.createInterface({ input: process.stdin, output: process.stdout, }); const input = []; rl.on('line', (line) => { input.push(line); }).on('close', () => { const n = Number(input.shift()); const result = solution(n, .. 더보기 [NodeJS] 백준 11286 절댓값 힙 /** * @link https://www.acmicpc.net/problem/11286 * @name 절댓값_힙 */ const readline = require('readline'); const rl = readline.createInterface({ input: process.stdin, output: process.stdout, }); const input = []; rl.on('line', (line) => { input.push(Number(line)); }).on('close', () => { input.shift(); const result = solution(input); console.log(result.join('\n')); process.exit(); }); /** * * @para.. 더보기 이전 1 2 3 4 5 ··· 13 다음