2차원 배열

const fs = require("fs");
const input = fs.readFileSync("./input.txt").toString().trim().split("\n");
const [N, M] = input[0].split(' ').map(Number);
let matrixA = [];
let matrixB = [];
let answer = ' ';

for (let i = 1; i <= N; i++) {
  matrixA.push(input[i].split(' ').map(Number));
}
for (let i = N+1; i <= 2*N; i++) {
  matrixB.push(input[i].split(' ').map(Number));
}

for (let i = 0; i < N; i++) {
  for (let j = 0; j < M; j++) {
    answer += String(matrixA[i][j]+matrixB[i][j]) + ' ';
  }
  answer += '\n';
}

console.log(answer.trim());

const fs = require("fs");
const input = fs.readFileSync("./input.txt").toString().trim().split('\n');
let arr = [];
let max = 0;
let locationMax = '';

for (let i = 0; i < 9; i++) {
  arr.push(input[i].split(" ").map(Number));
}

for (let i = 0; i < 9; i++) {
  for (let j = 0; j < 9; j++) {
    if (max <= arr[i][j]) {
      max = arr[i][j];
      locationMax = (i+1) + ' ' + (j+1);
    }
  }
}

console.log(max);
console.log(locationMax);

const fs = require("fs");
const input = fs.readFileSync("./input.txt").toString().trim().split('\n');
const paperNum = parseInt(input[0]);
let colorPaperArr = [];
let paper = [];
let x = 0;
let y = 0;
let count = 0;

input.shift();

for (let i = 0; i < paperNum; i++) { // input값을 colorPaperArr에 정리
  colorPaperArr.push(input[i].split(' ').map(Number));
}

for (let i = 0; i < 100; i++) { // 도화지 생성
  let oneLine = new Array(100);
  oneLine.fill(false);
  paper.push(oneLine);
}

for (let i = 0; i < paperNum; i++) { // 색종이가 붙어있는 위치는 true로 변경
  x = colorPaperArr[i][0];
  y = colorPaperArr[i][1];
  for (let j = x; j < x+10; j++) {
    for (let k = y; k < y+10; k++) {
      paper[j][k] = true;
    }
  }
}

for (let i = 0; i < 100; i++) { // true 개수 count
  for (let j = 0; j < 100; j ++) {
    if (paper[i][j]) {
      count++;
    }
  }
}

console.log(count);