-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathdiagonal_diff.py
43 lines (32 loc) · 962 Bytes
/
diagonal_diff.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
https://www.hackerrank.com/challenges/diagonal-difference/problem?h_r=profile
#!/bin/python3
import math
import os
import random
import re
import sys
#
# Complete the 'diagonalDifference' function below.
#
# The function is expected to return an INTEGER.
# The function accepts 2D_INTEGER_ARRAY arr as parameter.
#
def diagonalDifference(arr):
# Write your code here
pri_diagonal,sec_diagonal=0,0
for i in range(len(arr)):
for j in range(len(arr[0])):
if i==j:
pri_diagonal+=arr[i][j]
if(i+j==len(arr)-1):
sec_diagonal+=arr[i][j]
return abs(pri_diagonal-sec_diagonal)
if __name__ == '__main__':
fptr = open(os.environ['OUTPUT_PATH'], 'w')
n = int(input().strip())
arr = []
for _ in range(n):
arr.append(list(map(int, input().rstrip().split())))
result = diagonalDifference(arr)
fptr.write(str(result) + '\n')
fptr.close()