백준 2738 행렬 덧셈 - 자바 풀이

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

2738번: 행렬 덧셈

 

import java.util.Scanner;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		//N은 세로 M은 가로
		int N = sc.nextInt();
		int M = sc.nextInt();
		int[][] A = new int[N][M];
		int[][] B = new int[N][M];
				
		for(int i=0; i<N; i++) {
			for(int j=0; j<M; j++) {
				A[i][j] = sc.nextInt();
			}
		}
		for(int i=0; i<N; i++) {
			for(int j=0; j<M; j++) {
				B[i][j] = sc.nextInt();
			}
		}
		for(int i=0; i<N; i++) {
			for(int j=0; j<M; j++) {
				System.out.print(A[i][j]+B[i][j]+" ");
				if(j == M-1) {
					System.out.println();
				}
			}
		}
	}
}