본문 바로가기

백준알고리즘/Bronze V

2738번: 행렬 덧셈

import java.util.Scanner; 

public class Main { 
	public static void main(String[] args)
	
	{ 
		Scanner sc = new Scanner(System.in);

		int N = sc.nextInt();
		int M = sc.nextInt();
		int[][] arr = new int[N][M];

		for (int i = 0; i < 2; i++) {
			for (int j = 0; j < N; j++) {
				for (int j2 = 0; j2 < M; j2++) {
					arr[j][j2] += sc.nextInt();
				}
			}
		}

		for (int i = 0; i < N; i++) {
			for (int j = 0; j < M; j++) {
				System.out.print(arr[i][j] + " ");
			}
			System.out.println();
		}
	}
}

'백준알고리즘 > Bronze V' 카테고리의 다른 글

2741번: N 찍기  (0) 2022.06.23
2739번: 구구단  (0) 2022.06.23
2558번: A+B - 2  (0) 2022.06.23
2557번: Hello World  (0) 2022.06.23
2475번: 검증수  (0) 2022.06.23