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()
'알고리즘 문제 풀기 > HackerRank' 카테고리의 다른 글
| HackerRank - Staircase (0) | 2019.01.13 |
|---|---|
| HackerRank - Plus Minus (0) | 2019.01.12 |
| HackerRank - A Very Big Sum (0) | 2019.01.10 |
| HackerRank - Compare the Triplets (0) | 2019.01.09 |
| Hackerrank - Simple Array Sum (0) | 2019.01.08 |