def diagonalDifference(arr):
diagonal_sum_r = 0
diagonal_sum_l = 0
max_len = len(arr)
for i in range(max_len):
diagonal_sum_r += arr[i][i]
diagonal_sum_l += arr[i][(max_len - 1) -i]
return abs(diagonal_sum_r - diagonal_sum_l)
if __name__ == '__main__':
n = int(input().strip())
arr = []
for _ in range(n):
arr.append(list(map(int, input().rstrip().split())))
result = diagonalDifference(arr)
print(result)
'HackerRank Algorithm' 카테고리의 다른 글
[HackerRank] 17. Counting Valleys (0) | 2020.04.01 |
---|---|
[HackerRank] 16. Day of the programmer (0) | 2020.04.01 |
[HackerRank] 14. Divisible Sum pairs (0) | 2020.03.09 |
[HackerRank] 13. Drawing Book (0) | 2020.03.09 |
[HackerRank] 12. Finding the percentage (0) | 2020.03.09 |
댓글