BAEKJOON/JavaScript (35) 썸네일형 리스트형 [BAEKJOON] 덱 (10866번) // const input = require("fs").readFileSync("/dev/stdin").toString().trim().split("\n"); const input = require("fs").readFileSync("testCase/testCase.txt").toString().trim().split("\r\n"); function deque(input) { let deque = []; let answer = []; for(let i = 1; i [BAEKJOON] 소수 찾기 (1978번) // const input = require("fs").readFileSync("/dev/stdin").toString().trim().split("\n"); const input = "4\n1 3 5 7".toString().trim().split("\n"); // const input = "60\n1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60".toString().trim().split("\n"); function isPrimeNum(testCa.. [BAEKJOON] 수 정렬하기 2 (2751번) // const input = require("fs").readFileSync("/dev/stdin").toString().trim().split("\n"); const input = require("fs").readFileSync("testCase/testCase.txt").toString().trim().split("\r\n"); function sortNumber(input) { input.shift(); let numArr = input.map(element => Number(element)); let sortArr = numArr.sort((a, b) => a - b); console.log(sortArr.join("\n")); } sortNumber(input); [BAEKJOON] 설탕 배달(2839번) // const input = require("fs").readFileSync("/dev/stdin").toString().trim(); const input = "18".toString().trim(); // const input = "4".toString().trim(); // const input = "6".toString().trim(); // const input = "9".toString().trim(); // const input = "11".toString().trim(); function sugerDelivery(input) { let kg = Number(input); let bongji = 0; while(true) { if(kg % 5 === 0) { bongji += (kg / 5.. [BAEKJOON] 스택 (10828번) const input = require("fs").readFileSync("/dev/stdin").toString().trim().split("\n"); // const input = require("fs").readFileSync("testCase/testCase.txt").toString().trim().split("\r\n"); function stack(input) { let stack = []; let answer = []; for(let i = 1; i [BAEKJOON] 크로아티아 알파벳 (2941번) // const input = require("fs").readFileSync("/dev/stdin", "utf-8").trim().toString(); const input = "ljes=njak".trim().toString(); // const input = "ddz=z=".trim().toString(); // const input = "nljj".trim().toString(); // const input = "c=c=".trim().toString(); // const input = "dz=ak".trim().toString(); function croatiaLanguage(input) { // ▽문자열을 이용▽ let RegExp = /c=|c-|dz=|d-|lj|nj|s=|z=/g; let.. [BAEKJOON] 단어 정렬 (1181번) // const input = require("fs").readFileSync("/dev/stdin").toString().trim().split("\n"); const input = require("fs").readFileSync("testCase/testCase.txt").toString().trim().split("\r\n"); function sortWords(input) { input.shift(); let sortArr = input.sort().sort((x, y) => x.length - y.length); let answerArr = []; for(let i = 0; i < sortArr.length; i++) { if(answerArr.includes(sortArr[i])) { cont.. [BAEKJOON] 달팽이는 올라가고 싶다 (2869번) // const testCase = require("fs").readFileSync("/dev/stdin").toString().trim().split(" "); // const testCase = "2 1 5".toString().trim().split(" "); // const testCase = "5 1 6".toString().trim().split(" "); const testCase = "100 99 1000000000".toString().trim().split(" "); function snailWantsToClimb(testCase) { let dayTime = testCase[0]; let nightTime = testCase[1]; let height = testCase[2]; let.. 이전 1 2 3 4 5 다음