-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathsum_of_siblings_in_matrix.py
52 lines (43 loc) · 1.3 KB
/
sum_of_siblings_in_matrix.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
44
45
46
47
48
49
50
51
52
matrix = []
while True:
entered_value = input()
if entered_value == 'end':
break
matrix.append([int(x) for x in entered_value.split()])
matrix.append('end')
# matrix = [
# [9, 5, 3],
# [0, 7, -1],
# [-5, 2, 9],
# 'end'
# ]
# output = [
# [3, 21, 22],
# [10, 6, 19],
# [20, 16, -1]
# ]
output = []
for key_top_level, i in enumerate(matrix):
if i == 'end':
break
buf = []
for key_inner_level, j in enumerate(i):
left_sibling = i[-1] \
if key_inner_level == 0 \
else i[key_inner_level - 1]
right_sibling = i[0] \
if key_inner_level == len(i) - 1 \
else i[key_inner_level + 1]
bottom_sibling = matrix[0][key_inner_level] \
if key_top_level == len(matrix) - 2 \
else matrix[key_top_level+1][key_inner_level]
upper_sibling = matrix[-2][key_inner_level] \
if key_top_level == 0 \
else matrix[key_top_level - 1][key_inner_level]
# print(left_sibling, right_sibling, bottom_sibling, upper_sibling)
buf.append(left_sibling + right_sibling + bottom_sibling + upper_sibling)
output.append(buf)
for i in output:
for j in i:
print(j, end=" ")
print("")