# swea 1974 '스도쿠 검증'
T = int(input())
for t in range(1, T+1):
MAP = []
for _ in range(9):
MAP.append(list(map(int, input().split())))
row_check = [[False for num in range(10)] for row in range(9)]
col_check = [[False for num in range(10)] for col in range(9)]
box_check = [[False for num in range(10)] for box in range(9)]
result = 1
for row in range(9):
for col in range(9):
num = MAP[row][col]
box = 3*(row // 3) + (col // 3)
if row_check[row][num] or col_check[col][num] or box_check[box][num]:
result = 0
break
row_check[row][num] = True
col_check[col][num] = True
box_check[box][num] = True
if result == 0:
break
print('#{} {}'.format(t, result))
'알고리즘 문제 풀이 > SWEA' 카테고리의 다른 글
[SWEA 1859 python] 백만 장자 프로젝트 (0) | 2021.08.16 |
---|---|
[SWEA 5432 python] 쇠막대기 자르기 (0) | 2021.08.16 |
[SWEA 4408 python] 자기 방으로 돌아가기 (0) | 2021.08.16 |
[SWEA 1206 python] View (0) | 2021.08.13 |
[SWEA 10804 python] 문자열의 거울상 (0) | 2021.08.13 |