c#

CS/Data Structure & algorithm

[Algorithm] 백준 4992 - Hanafuda Shuffle (Node / C#)

문제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('..

CS/Data Structure & algorithm

[Algorithm] 백준 4949 - 균형잡힌 세상 (Node / C#)

문제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..

CS/Data Structure & algorithm

[Algorithm] 백준 4889 -안정적인 문자열 (Node / C#)

문제https://www.acmicpc.net/problem/4889 풀이1. Node.js(fs)const fs = require('fs');const input = fs.readFileSync('/dev/stdin').toString().trim().split('\n');const numCases = parseInt(input[0]);function evaluateExpression(expr) { const stack = []; for (let i = 0; i  2. Node.js(readLine)const readline = require('readline');const rl = readline.createInterface({ input: process.stdin, output..

CS/Data Structure & algorithm

[Algorithm] 백준 4466 - A Smart Brain is a Tasty Brain (Node / C#)

문제https://www.acmicpc.net/problem/4466 풀이1. Node.js(fs)const fs = require('fs');const input = fs.readFileSync('/dev/stdin').toString().trim().split('\n');const numCases = parseInt(input[0]);function evaluateExpression(expr) { const stack = []; for (let i = 0; i  2. Node.js(readLine)const readline = require('readline');const rl = readline.createInterface({ input: process.stdin, output..

상단으로

티스토리툴바