본문 바로가기

728x90

Algorithm

[NodeJS] 백준 2805 /** * @link https://www.acmicpc.net/problem/2805 */ 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 [str, height] = input; const [n, m] = str.split(' ').map(Number); const result = solution(n, m, height.split(' ').map(Number)); c.. 더보기
[NodeJS] 백준 2775 /** * @link https://www.acmicpc.net/problem/2775 */ 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', () => { const [count, ...numArr] = input; const arr = []; for (let i = 0; i < count * 2; i += 2) { arr.push([numArr[i], numArr[i + 1]]).. 더보기
[NodeJS] 백준 2108 /** * @link https://www.acmicpc.net/problem/2108 */ 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', () => { const [n, ...nums] = input; const result = solution(n, nums); console.log(result.join('\n')); process.exit(); }); /** * * @para.. 더보기
[NodeJS] 백준 1012 const input = []; let inputIndex = 0; const distances = [ [-1, 0], [1, 0], [0, -1], [0, 1], ]; let graph, columnCount, rowCount, cabbageCount, result = 0; const strToNumArr = (str) => str.split(' ').map((numString) => Number(numString)); require('readline') .createInterface(process.stdin, process.stdout) .on('line', function (line) { input.push(line.trim()); }) .on('close', function () { let t =.. 더보기
[NodeJS] 백준 15964 /** * @link https://www.acmicpc.net/problem/15964 */ 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 [a, b] = input[0].split(' ').map(Number); const result = solution(a, b); console.log(result); process.exit(); }); /** * * @param.. 더보기
[NodeJS] 백준 11866 /** * @link https://www.acmicpc.net/problem/11866 */ 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, K] = input[0].split(' ').map(Number); const result = solution(N, K); console.log(result); process.exit(); }); /** * * @param.. 더보기
[NodeJS] 백준 9086 /** * @link https://www.acmicpc.net/problem/9086 */ 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 [, ...arr] = input; const arr2 = arr.map((s) => { if (s.length === 1) { return `${s}${s}`; } else { return `${s[0]}${s[s.length -.. 더보기
[NodeJS] 백준 2754 /** * @link https://www.acmicpc.net/problem/2754 */ 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', () => { switch (input[0]) { case 'A+': console.log('4.3'); break; case 'A0': console.log('4.0'); break; case 'A-': console.log('3.7'); break; c.. 더보기

728x90