본문 바로가기

Programming [Python]/백준 알고리즘 솔루션

#248 백준 파이썬 [2563] 색종이

https://www.acmicpc.net/problem/2563

 

Python Code

N = int(input())
paper = [[0 for _ in range(101)] for _ in range(101)]

for _ in range(N):
    x, y = map(int, input().split())
    for i in range(x, x+10):
        for j in range(y, y+10):
            paper[i][j] = 1

answer = 0
for row in paper:
    answer += row.count(1)
print(answer)