백준 - 2차원 배열

백준의 2차원 배열 문제들을 python으로 풀이한 것입니다.

1. 행렬 덧셈

n, m = map(int, input().split())
a, b = [], []

for i in range(n):
    a.append(list(map(int, input().split())))
    
for i in range(n):
    b.append(list(map(int, input().split())))
    
for i in range(n):
    for j in range(m):
        print(a[i][j] + b[i][j], end=' ')
    print()

성공

2. 최댓값

board = []
maxN = 0
x, y = 0, 0
for i in range(9):
    board.append(list(map(int, input().split())))

for i in range(9):
    for j in range(9):
        if maxN <= board[i][j]:
            maxN = board[i][j]
            x, y = i + 1, j + 1

print(maxN)
print(x, y)

성공

3. 색종이

board = [[0 for _ in range(100)] for _ in range(100)]
n = int(input())
cnt = 0

for i in range(n):
    x, y = map(int, input().split())
    for _x in range(x, x + 10):
        for _y in range(y, y + 10):
            board[_x][_y] = 1

for i in board:
    cnt += i.count(1)
print(cnt)

성공