[Codetree] 1이 3개 이상 있는 위치 Python

https://www.codetree.ai/missions/5/problems/place-more-than-3-ones/description

코드트리 | 코딩테스트 준비를 위한 알고리즘 정석

 

import sys

input = sys.stdin.readline

dx = [0, 0, 1, -1]
dy = [1, -1, 0, 0]

n = int(input())


graph = []

for _ in range(n):
    temp = list(map(int, input().rstrip().split(" ")))
    graph.append(temp)

result = 0



for i in range(n):
    for j in range(n):
        cnt = 0
        for k in range(4):
            nx = i + dx[k]
            ny = j + dy[k]

            if 0 <= nx and nx <n and 0<= ny and ny < n:
                if graph[nx][ny] == 1:
                    cnt += 1
        
        if cnt >= 3:
            result += 1
            
            

print(result)