[SW Expert Academy] 1974. 스도쿠 검증

solution.py

def check(graph):
  for i in range(9): # 행
    ck = []
    for j in range(9):
      if ck:
        if graph[i][j] in ck:
          return '0'
      ck.append(graph[i][j])
      
  for i in range(9): # 열
    ck = []
    for j in range(9):
      if ck:
        if graph[j][i] in ck:
          return '0'
      ck.append(graph[j][i])
      
  for i in range(0,9,3): # 3*3
    for j in range(0,9,3):
      ck = []
      for n in range(3):
        for k in range(3):
          if ck:
            if graph[i+n][j+k] in ck:
              return '0'
          ck.append(graph[i+n][j+k])
  return '1'

T = int(input())
# 여러개의 테스트 케이스가 주어지므로, 각각을 처리합니다.
for test_case in range(1, T + 1):
  graph = [list(map(int, input().split())) for _ in range(9)] #9*9
  print("#{} {}".format(test_case, check(graph)))