[Python] SWEA 13702 - 델타검색

[2022.02.15]

def makePartSum(y,x):
    dx = [0,1,0,-1]
    dy = [1,0,-1,0]
    result = 0
    for idx in range(4):
        nx = x + dx[idx]
        ny = y + dy[idx]

        if 0 <= nx < N and 0 <= ny < N:
            result += abs(arr[ny][nx]-arr[y][x])
    return result


for tc in range(10):
    N = int(input())
    arr = [list(map(int,input().split())) for _ in range(N)]
    answer = 0
    for i in range(len(arr)):
        for j in range(len(arr[i])):
            answer += makePartSum(i,j)

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