const line = require("fs").readFileSync("/dev/stdin", "utf8"); let input = line.trim().split("\n"); let map = []; let destination = []; let result = 0; let size = 0; //나이트가 이동할 수 있는 경우의 수 const moves = [ [-2, -1], [-2, 1], [2, -1], [2, 1], [-1, -2], [-1, 2], [1, -2], [1, 2], ]; chess(); function chess() { test = parseInt(input.splice(0, 1)); for (i = 0; i < test; i++) { let cnt = 0; size = parse..
const line = require("fs").readFileSync("/dev/stdin", "utf8"); let input = line.trim().split("\n"); //3차원이므로 dz부분을 추가하고 위,아래,동,서,남,북 6가지로 나타내었다. const dx = [1, -1, 0, 0, 0, 0]; const dy = [0, 0, 1, -1, 0, 0]; const dz = [0, 0, 0, 0, 1, -1]; const [m, n, h] = input[0].split(" ").map(Number); input.splice(0, 1); let totalBox = []; let tomatos = []; let queue = []; let zero = 0; let cnt = 0; minimu..
const line = require("fs").readFileSync("/dev/stdin", "utf8"); let input = line.trim().split("\n"); const dx = [1, -1, 0, 0]; const dy = [0, 0, 1, -1]; const [m, n] = input[0].split(" ").map(Number); let tomatos = []; let queue = []; let zero = 0; let cnt = 0; minimumDate(); function minimumDate() { //토마토밭을 만드는 for문 for (let i = 1; i < n + 1; i++) { tomatos.push(input[i].split(" ").map(Number));..
const readline = require("readline"); let input = []; let maze = []; const rl = readline.createInterface({ input: process.stdin, output: process.stdout, }); rl.on("line", (line) => input.push(line.trim())).on("close", () => { //현재위치 1,1 //큐에 아래, 옆 1이면 저장 //아래부터 시작해서 //아래 위 const [n, m] = input[0].split(" ").map(Number); input.splice(0, 1); for (let i = 0; i < n; i++) { maze.push(input[i].split("..
const readline = require("readline"); let input = []; let cabbageField = []; let result = []; const rl = readline.createInterface({ input: process.stdin, output: process.stdout, }); rl.on("line", (line) => input.push(line.trim())).on("close", () => { const test = parseInt(input[0]); input.splice(0, 1); //여러 밭이 나올 수 있어 for문으로 반복 for (let repeat = 0; repeat < test; repeat++) { let count = 0; const..
const readline = require("readline"); let input = []; let map = []; let result = []; let [total, count] = [0, 0]; const rl = readline.createInterface({ input: process.stdin, output: process.stdout, }); rl.on("line", (line) => input.push(line.trim())).on("close", () => { const size = parseInt(input[0]); input.splice(0, 1); for (let i of input) { map.push(i.split("").map(Number)); } // 위는 입력받는 코드 ..
const readline = require("readline"); let input = []; let arr = []; let visited = []; let infection = []; const rl = readline.createInterface({ input: process.stdin, output: process.stdout, }); rl.on("line", (line) => input.push(line.trim())).on("close", () => { const [computers, pairs] = [parseInt(input[0]), parseInt(input[1])]; input.splice(0, 2); arr = Array.from(Array(computers + 1), () => A..
const readline = require("readline"); let arr = []; let dfsVisited = []; let bfsVisited = []; let dfsResult = []; let bfsResult = []; let input = []; // readline안에서는 배열을 let으로 선언 const rl = readline.createInterface({ input: process.stdin, output: process.stdout, }); rl.on("line", (line) => input.push(line.trim())).on("close", () => { const [n, m, v] = input[0].split(" ").map(Number); input = inp..
- GROUP BY
- nodemailer error
- 숫자야구게임
- nodejs
- 토마토3차원
- 백준 7569 node
- tolowercase
- 코딩테스트
- Split
- 회원가입
- smtp error
- sort
- 로그인
- slice
- 카카오2018[1차]
- Level 1
- Express
- 바이러스 dfs
- SQL
- AWS
- Replace
- 백준
- 정규표현식
- 백준 7562 node
- JavaScript
- left join
- JOIN
- 534 error
- 프로그래머스
- 코드테스트
- Total
- Today
- Yesterday