[백준] 2738 | 행렬 덧셈(java)

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class Main {

	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		
		StringTokenizer st = new StringTokenizer(br.readLine());
		int N = Integer.parseInt(st.nextToken());
		int M = Integer.parseInt(st.nextToken());
		
		int[][] a = new int[N][M];
		int[][] b = new int[N][M];
		int[][] result = new int[N][M];
		
		for(int i=0; i<N; i++){
			StringTokenizer st2 =new StringTokenizer(br.readLine());
			for(int j=0; j<M;j++){
				a[i][j] = Integer.parseInt(st2.nextToken());
			}
		}
		
		for(int i=0; i<N; i++){
			StringTokenizer st2 =new StringTokenizer(br.readLine());
			for(int j=0; j<M;j++){
				b[i][j] = Integer.parseInt(st2.nextToken());
			}
		}
		
		for(int i=0; i<N; i++){
			for(int j=0; j<M; j++){
				result[i][j] = a[i][j]+b[i][j];
				System.out.print(result[i][j]+" ");
			}
			System.out.println();
		}
		
	}

}