알고리즘
1098 : [기초-종합+배열] 설탕과자 뽑기
이온시옥
2019. 6. 7. 04:38
반응형
# Python3
# 1098 : [기초-종합+배열] 설탕과자 뽑기
# https://codeup.kr/problem.php?id=1098
A, B = map(int, input().split())
result = [[0 for i in range(B)] for j in range(A)]
n = int(input())
for i in range(n):
l, d, x, y = map(int, input().split())
for j in range(l):
if d == 0: #가로막대
result[x-1][y-1+j] = 1
elif d == 1:
result[x-1+j][y-1] = 1
for i in range(A):
for j in range(B):
print(result[i][j], end=' ')
print(end='\n')
반응형