T = int(input())
for t in range(1, T+1):
N, K = map(int, input().split())
MAP = [[0 for _ in range(N+2)] for _ in range(N+2)]
for i in range(1, N+1):
MAP[i][1:-1] = map(int, input().split())
cnt_list = [0 for _ in range(N + 1)]
for i in range(1, N+1):
# row
j = 1
while j <= N:
cnt = 0
while MAP[i][j]:
cnt += 1
j += 1
cnt_list[cnt] += 1
j += 1
# col
j = 1
while j <= N:
cnt = 0
while MAP[j][i]:
cnt += 1
j += 1
cnt_list[cnt] += 1
j += 1
print('#{} {}'.format(t, cnt_list[K]))
'알고리즘 문제 풀이 > SWEA' 카테고리의 다른 글
[SWEA 1206 python] View (0) | 2021.08.13 |
---|---|
[SWEA 10804 python] 문자열의 거울상 (0) | 2021.08.13 |
[SWEA 1966 python] 숫자를 정렬하자 (0) | 2021.08.13 |
[SWEA 1210 python] Ladder1 (0) | 2021.08.13 |
[SWEA 2001 python] 파리 퇴치 (0) | 2021.08.13 |