[python] SWEA : 파리퇴치

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV5PzOCKAigDFAUq 

SW Expert Academy

[문제 풀이]

for tc in range(1, int(input())+1):
    answer = 0
    n, m = map(int, input().split())
    maps = [list(map(int, input().split())) for _ in range(n)]
   
    
    for i in range(n-m+1):
        for j in range(n-m+1):
            check = 0
            # 영역에 해당하는 파리 갯수 구하기  
            for a in range(i, i+m):
                for b in range(j, j+m):
                    check += maps[a][b]

            answer = max(answer, check)
    print(f'#{tc}', answer)