알고리즘 문제 풀기/HackerRank
HackerRank - Diagonal Difference
bug_maker
2019. 1. 11. 10:21
https://www.hackerrank.com/challenges/diagonal-difference/problem
HackerRank - Diagonal Difference
#!/bin/python3import mathimport osimport randomimport reimport sysdef diagonalDifference(arr): firstDiagonal = 0 secondDiagonal = 0 for i in range(0, len(arr)): firstDiagonal += arr[i][i] for i in range(0, len(arr)): secondDiagonal += arr[i][len(arr)-1-i] diagonalDifference = firstDiagonal - secondDiagonal if(diagonalDifference < 0): diagonalDifference = diagonalDifference * -1 return diagonalDifferenceif __name__ == '__main__': fptr = open(os.environ['OUTPUT_PATH'], 'w') n = int(input()) arr = [] for _ in range(n): arr.append(list(map(int, input().rstrip().split()))) result = diagonalDifference(arr) fptr.write(str(result) + '\n') fptr.close()