목록알고리즘 (103)
언젠가는 펼쳐 볼 아카이브
사용언어 : javascript - node.js # 제출코드 const fs = require('fs'); const filePath = process.platform === 'linux' ? '/dev/stdin' : './input.txt'; const input = fs.readFileSync(filePath).toString().trim().split('\n'); solution(input); function solution(input) { const num = +input.shift().trim(); let paper = new Array(100).fill().map((item) => new Array(100).fill(false)); for (let i = 0; i < num; i++) { ..
사용언어 : javascript - node.js #제출코드 const fs = require('fs'); const filePath = process.platform === 'linux' ? '/dev/stdin' : './input.txt'; const input = fs.readFileSync(filePath).toString().trim().split('\n'); solution(input); function solution(input) { let answer = ''; let map = {}; for (let i = 0; i < input.length; i++) { let tempStr = input[i].trim(); for (let j = 0; j < tempStr.length; j++) {..
사용언어 : javascript - node.js #제출코드 const fs = require('fs'); const filePath = process.platform === 'linux' ? '/dev/stdin' : './input.txt'; const input = fs .readFileSync(filePath) .toString() .trim() .split('\n') .map((line) => line.split(' ').map((item) => +item)); solution(input); function solution(input) { let max = -1; let x = 0; let y = 0; for (let i = 0; i < 9; i++) { for (let j = 0; j < 9;..
사용언어 : javascript - node.js #제출 코드 const fs = require('fs'); const filePath = process.platform === 'linux' ? '/dev/stdin' : './input.txt'; const input = fs.readFileSync(filePath).toString().trim().split('\n'); solution(input); function solution(input) { const [n, m] = input .shift() .split(' ') .map((item) => +item); let arrA = []; let arrB = []; let resultArr = []; let answer = ''; for (let i =..