rueki

SW Expert Academy 2001. 파리 퇴치 본문

python/알고리즘 문제풀이

SW Expert Academy 2001. 파리 퇴치

륵기 2020. 6. 24. 23:24
728x90
반응형

https://swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV5PzOCKAigDFAUq&categoryId=AV5PzOCKAigDFAUq&categoryType=CODE

t = int(input())
for tc in range(1,t+1):
	N, M = map(int, input().split())
	li = []
	for _ in range(N):
		l = list(map(int, input().split()))
		li.append(l)
  

	ms = 0
	for i in range(N-M+1):
		for j in range(N-M+1):
			sc=0
			for x in range(M):
				for y in range(M):
					sc += li[i+x][j+y]
			if ms < sc:
				ms = sc
	print('#{} {}'.format(tc, ms))

 

728x90
반응형
Comments