[백준 2738번] 행렬 덧셈 - Java

---

 

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
    Scanner scanner = new Scanner(System.in);
    int n = scanner.nextInt();
    int m = scanner.nextInt();
    
    int[][] array = new int[n][m];
    int[][] array2 = new int[n][m];
    int[][] array3 = new int[n][m];

    
    for(int i=0; i<n; i++) {
    	 for(int j=0; j<m; j++) {
    		int k = scanner.nextInt();
    	    array[i][j] = k;
    	 	}
    	}
    for(int i=0; i<n; i++) {
   	 	for(int j=0; j<m; j++) {
   	 		int k = scanner.nextInt();
   	 		array2[i][j] = k;
   	 		}
   		}
    for(int i=0; i<n; i++) {
   	 	for(int j=0; j<m; j++) {
   	 		array3[i][j] = array[i][j] + array2[i][j];
 			}
		}
    for(int i=0; i<n; i++) {
   	 	for(int j=0; j<m; j++) {
   	 		System.out.print(array3[i][j]+" ");
   	 		}
   	 System.out.println();
   		}
 	}
}

---