문제https://www.acmicpc.net/problem/2108개념수학, 구현구현 코드(JavaScript)const fs = require('fs');const input = fs.readFileSync(0, 'utf-8').trim().split('\n');const n = +input[0];const arr = input.slice(1).map((i) => +i);arr.sort((a, b) => a - b);// 산술평균let avg = (arr.reduce((a, c) => a + c, 0) / n).toFixed(0);console.log(avg == '-0' ? 0 : avg);// 중앙값console.log(arr[Math.floor(n / 2)]);// 최빈값const map = n..

문제https://www.acmicpc.net/problem/1213 개념그리디 알고리즘 구현 코드(JavaScript)const fs = require('fs');let input = fs.readFileSync('/dev/stdin').toString().trim();const arr = new Array(26).fill(0);for (const ch of input) { arr[ch.charCodeAt(0) - 65]++;}let oddChar = '';let oddCount = 0;let left = '';let right = '';for (let i = 0; i 1) { result = "I'm Sorry Hansoo";} else { for (let i = 0; i   코드 설명이 문제..

문제https://www.acmicpc.net/problem/7576  개념그래프 탐색BFS 구현 코드(JavaScript)const fs = require('fs');const input = fs.readFileSync('/dev/stdin').toString().trim().split('\n');const [m, n] = input[0].split(' ').map(Number);const tomatoes = input.slice(1).map((row) => row.split(' ').map(Number));let q = [];const dx = [1, -1, 0, 0];const dy = [0, 0, 1, -1];let day = 0;for (let i = 0; i = n || ny = m) cont..

문제https://www.acmicpc.net/problem/11053 개념동적 계획법(DP)   구현 코드(JavaScript)const fs = require('fs');// 백준 제출용let input = fs.readFileSync('/dev/stdin').toString().trim().split('\n');// 로컬 테스트용// const filePath =// process.platform === 'linux' ? '/dev/stdin' : __dirname + '/input.txt';// const input = fs.readFileSync(filePath).toString().trim().split('\n');const n = Number(input[0]);const arr = inp..

문제https://www.acmicpc.net/problem/11724개념그래프 탐색DFS, BFS구현 코드(JavaScript)const fs = require('fs');let input = fs.readFileSync('/dev/stdin').toString().trim().split('\n');const [n, m] = input[0].split(' ').map(Number);const graph = Array(n + 1) .fill(0) .map(() => Array(n + 1).fill(0));for (let i = 1; i { const queue = [start]; visited[start] = true; while (queue.length) { const node = qu..