문제https://www.acmicpc.net/problem/5957 풀이1. Node.js(fs)const fs = require('fs');const input = fs.readFileSync('/dev/stdin').toString().trim().split('\n');const N = parseInt(input[0]);let unwashed = Array.from({length: N}, (_, i) => N - i);let washed = [];let dried = [];for (let i = 1; i 0) { washed.push(unwashed.pop()); } } } else { // Canmuu drying f..
문제https://www.acmicpc.net/problem/5397 풀이1. Node.js(fs)const fs = require('fs');const input = fs.readFileSync('/dev/stdin').toString().trim().split('\n');const T = parseInt(input[0]);function processKeyLogger(str) { const leftStack = []; const rightStack = []; for (let char of str) { if (char === ' 0) { rightStack.push(leftStack.pop()); } } else i..
문제https://www.acmicpc.net/problem/4992 풀이1. Node.js(fs)const fs = require('fs');const input = fs.readFileSync('/dev/stdin').toString().trim().split('\n');let index = 0;while (true) { const [n, r] = input[index++].split(' ').map(Number); if (n === 0 && r === 0) break; let deck = Array.from({length: n}, (_, i) => n - i); for (let i = 0; i 2. Node.js(readLine)const readline = require('..
문제https://www.acmicpc.net/problem/4949풀이1. Node.js(fs)const fs = require('fs');const input = fs.readFileSync('/dev/stdin').toString().trim().split('\n');function isBalanced(str) { const stack = []; const openBrackets = ['(', '[']; const closeBrackets = [')', ']']; const pairs = { ')': '(', ']': '[' }; for (let char of str) { if (openBrackets.includes(char)) { sta..
