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
|
#!/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
cnt=len(arr)
primary=0
secondary=0
for i in range(cnt):
primary+=arr[i][i]
secondary+=arr[cnt-i-1][i]
return abs(primary-secondary)
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()
|
cs |
반응형
'python-algorithm' 카테고리의 다른 글
Hacker rank Mini-Max Sum (0) | 2021.10.26 |
---|---|
Hacker rank Staircase (0) | 2021.10.26 |
Hacker rank A Very Big Sum (0) | 2021.10.26 |
Hacker rank Compare the Triplets (0) | 2021.10.26 |
Hacker rank Simple Array Sum (0) | 2021.10.26 |
댓글