[Python] SWEA 2001 - 파리 퇴치

[2022.02.18]

 

T = int(input())

def catch(y,x):
    fly = 0
    for i in range(M):
        for j in range(M):
            fly += board[i+y][j+x]
    return fly

for tc in range(T):
    N,M = map(int,input().split())
    board = [list(map(int,input().split())) for _ in range(N)]

    maxfly = 0
    for i in range(N-M+1):
        for j in range(N-M+1):
            tmp = catch(i,j)
            if tmp > maxfly:
                maxfly = tmp

    print(f'#{tc+1} {maxfly}')