💛 JavaScript/백준

[JS] 4948

const fs = require('fs'); const path = process.platform === 'linux' ? '/dev/stdin' : './data.txt'; const input = fs .readFileSync(path) .toString() .split('\n') .map((x) => Number(x)); function solve(input) { for (let number of input) { if (number === 0) { return null; } let min = number; let max = number * 2; let arr = [...new Array(max + 1).keys()]; for ..

[JS] 1929

const fs = require('fs'); const path = process.platform === 'linux' ? '/dev/stdin' : './data.txt'; const input = fs .readFileSync(path) .toString() .trim() .split(' ') .map((x) => Number(x)); function solve(input) { const M = input.shift(); const N = input.shift(); const arr = [...new Array(N + 1).keys()]; // 0부터 N까지 배열 생성 for (let i = 2; i = M)) { // 배열에서 M보다 큰 애들만 남게 만들기 value ? console.log(va..

[JS] 11653

const fs = require('fs'); const path = process.platform === 'linux' ? '/dev/stdin' : './data.txt'; const input = Number(fs.readFileSync(path).toString().trim()); function solve(input) { let number = input; let numberHalf = Math.ceil(input / 2); let temp = new Array(); if (number === 1) { } for (i = 2; i

[JS] 2581

const fs = require('fs'); const path = process.platform === 'linux' ? '/dev/stdin' : './data.txt'; const input = fs .readFileSync(path) .toString() .trim() .split('\n') .map((x) => Number(x)); function solve(input) { let M = input.shift(); let N = input.shift(); let temp = new Array(); for (i = M; i

[JS] 1978

const fs = require('fs'); const path = process.platform === 'linux' ? '/dev/stdin' : './data.txt'; const input = fs.readFileSync(path).toString().trim().split('\n'); function solve(input) { let count = Number(input.shift()); let numbers = input[0].split(' ').map((x) => Number(x)); for (let number of numbers) { if (number === 1) { count--; } for (i = 2; i