[백준] 2738번 행렬 덧셈

[백준] 2738번 행렬 덧셈 - 자바

문제

해설

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[][] matrix1 = new int[n][m];
        int[][] matrix2 = new int[n][m];
        for(int i=0; i<n;i++){
            st = new StringTokenizer(br.readLine(), " ");
            for(int j=0; j<m;j++){
                matrix1[i][j] = Integer.parseInt(st.nextToken());
            }
        }
        for(int i=0; i<n;i++){
            st = new StringTokenizer(br.readLine(), " ");
            for(int j=0; j<m;j++){
                matrix2[i][j] = Integer.parseInt(st.nextToken());
            }
        }
        for(int i=0; i<n; i++){
            for(int j=0; j<m; j++){
                System.out.print((matrix1[i][j] + matrix2[i][j]) + " ");
            }
            System.out.println();
        }
    }
}