![iamge](https://camo.githubusercontent.com/8bac707a82d8860b4e87c21528b1b8f2d8465126cd141c558b4d94331ab7f35f/68747470733a2f2f73332e75732d776573742d322e616d617a6f6e6177732e636f6d2f7365637572652e6e6f74696f6e2d7374617469632e636f6d2f30373264326431382d326133392d343839632d613331342d6439333931333661393764332f556e7469746c65642e706e673f582d416d7a2d416c676f726974686d3d415753342d484d41432d53484132353626582d416d7a2d436f6e74656e742d5368613235363d554e5349474e45442d5041594c4f414426582d416d7a2d43726564656e7469616c3d414b49415437334c324734354549505433583435253246323032333033313725324675732d776573742d322532467333253246617773345f7265717565737426582d416d7a2d446174653d3230323330333137543030313631305a26582d416d7a2d457870697265733d383634303026582d416d7a2d5369676e61747572653d6263356261376662653939363133396538323136376332306636346136386537623232623239346432336532643639313837633236393630613934373933326526582d416d7a2d5369676e6564486561646572733d686f737426726573706f6e73652d636f6e74656e742d646973706f736974696f6e3d66696c656e616d65253344253232556e7469746c65642e706e6725323226782d69643d4765744f626a656374)
10
7 3 6 4 2 9 5 8 1
5 8 9 1 6 7 3 2 4
2 1 4 5 8 3 6 9 7
8 4 7 9 3 6 1 5 2
1 5 3 8 4 2 9 7 6
9 6 2 7 5 1 8 4 3
4 2 1 3 9 8 7 6 5
3 9 5 6 7 4 2 1 8
6 7 8 2 1 5 4 3 9
...
import sys
sys.stdin = open("input3.txt", "r")
def sudoku(num_list):
result = True
for j in range(9):
number = [0]*9
for num in num_list[j]:
number[int(num)-1] += 1
if number[int(num)-1] == 2:
result = False
break
return result
T = int(input())
# 여러개의 테스트 케이스가 주어지므로, 각각을 처리합니다.
for test_case in range(1, T + 1):
# ///////////////////////////////////////////////////////////////////////////////////
# 가로일 때 9개의 숫자가 존재
# 가로의 경우를 만들어준다.
arr = []
for _ in range(9):
arr.append(str(input()).split())
# 세로일 때 9개의 숫자가 존재
# 세로의 경우를 만들어준다.
arr_d = []
for i in range(9):
arr_d.append([arr[j][i] for j in range(9)])
# 3*3일 때 9개의 숫자가 존재
# 사각형일때 경우를 만들어준다.
square = []
for a in range(3):
for b in range(3):
square.append([arr[a*3 + j][b*3 + i] for j in range(3) for i in range(3)])
if sudoku(arr) and sudoku(arr_d) and sudoku(square):
print(f'#{test_case} 1')
else:
print(f'#{test_case} 0')
import sys
sys.stdin = open("input.txt", "r")
def solve(arr):
for lst in arr:
if len(set(lst))!=9:
return 0
arr_t = list(zip(*arr))
for lst in arr_t:
if len(set(lst))!=9:
return 0
for i in (0,3,6):
for j in (0,3,6):
lst = arr[i][j:j+3] + arr[i+1][j:J+3] + arr[i+2][j:J+3]
if len(set(lst))!=9:
return 0
return 1
T = int(input())
for test_case in range(1, T+1):
arr = [list(map(int, input().split())) for _ in range(9)]
ans = solve(arr)
print(f'#{test_case} {ans}')