https://www.codetree.ai/missions/2/problems/best-place-of-33/description
import sys
input = sys.stdin.readline
n = int(input())
graph = []
# visited = [[0 for _ in range(n)] for _ in range(n)]
cnt = 0
max_val = 0
for _ in range(n):
temp = list(map(int, input().rstrip().split(" ")))
graph.append(temp)
def countOne(start_x, start_y):
cnt = 0
for i in range(start_x, start_x+3):
for j in range(start_y, start_y+3):
if graph[i][j] == 1:
cnt += 1
return cnt
if n ==3:
print(countOne(0, 0))
else:
for i in range(n-2):
for j in range(n-2):
max_val = max(max_val, countOne(i, j))
print(max_val)
728x90
반응형
'🔻PS > Codetree' 카테고리의 다른 글
[Codetree] 컨베이어 벨트 Python (0) | 2024.07.27 |
---|---|
[Codetree] 행복한 수열의 개수 Python (1) | 2024.07.23 |
[Codetree] 뿌요뿌요 Python (0) | 2024.07.19 |
[Codetree] 안전 지대 Python (0) | 2024.07.19 |
[Codetree] 마을 구분하기 Python (0) | 2024.07.19 |