[코딩테스트][백준] 2738. 행렬 덧셈

문제

https://www.acmicpc.net/problem/2738

python

n,m=map(int,input().split())
arr1=[]
arr2=[]
for i in range(n):
    arr1.append(list(map(int,input().split())))
for j in range(n):
    arr2.append(list(map(int,input().split())))
for i in range(n):
    for j in range(m):
        arr1[i][j]+=arr2[i][j]
for i in range(n):
    for j in range(m):
        print(arr1[i][j],end=' ')
    print()

java

import java.util.*;
import java.lang.*;
import java.io.*;
import java.math.*;

// The main method must be in a class named "Main".
class Main {
    public static void main(String[] args) {
        Scanner sc=new Scanner(System.in);
        int n=sc.nextInt();
        int m=sc.nextInt();
        int[][] arr1=new int[n][m];
        int[][] arr2=new int[n][m];
        for(int i=0;i<n;i++){
            for(int j=0;j<m;j++){
                arr1[i][j]=sc.nextInt();
            }
        }
        for(int i=0;i<n;i++){
            for(int j=0;j<m;j++){
                arr2[i][j]=sc.nextInt();
            }
        }
        for(int i=0;i<n;i++){
            for(int j=0;j<m;j++){
                arr1[i][j]+=arr2[i][j];
            }
        }
        for(int i=0;i<n;i++){
            for(int j=0;j<m;j++){
                System.out.printf("%d ",arr1[i][j]);
            }
            System.out.println();
        }
    }
}

내 생각

• 풀이시간 5분
• 각 2차원 배열을 받아서 그 2차원 원소의 위치에 따라 합을 구해주면 되는 문제.