Created
October 12, 2023 10:00
-
-
Save Shtihl/e24e3be772f05358b40ab95f3f4324e8 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
matrix = [] | |
string = input() | |
while string != "end": | |
matrix_row = list(map(int, string.split())) | |
matrix.append(matrix_row) | |
string = input() | |
new_matrix = [[0 for j in range(len(matrix[i]))] for i in range(len(matrix))] | |
for i in range(len(matrix)): | |
for j in range(len(matrix[i])): | |
cell_sum = 0 | |
if len(matrix) == 1: | |
if len(matrix[i]) == 1: | |
cell_sum = matrix[i][j] * 4 | |
elif len(matrix[i]) == 2: | |
cell_sum = matrix[i][j] * 2 + matrix[i][j - 1] * 2 | |
else: | |
if j != len(matrix[i]) - 1: | |
cell_sum = matrix[i][j] * 2 + matrix[i][j - 1] + matrix[i][j + 1] | |
else: | |
cell_sum = matrix[i][j] * 2 + matrix[i][j - 1] + matrix[i][0] | |
elif len(matrix) == 2: | |
if len(matrix[i]) == 1: | |
cell_sum = matrix[i][j] * 2 + matrix[i - 1][j] * 2 | |
elif len(matrix[i]) == 2: | |
cell_sum = matrix[i - 1][j] * 2 + matrix[i][j - 1] * 2 | |
else: | |
if j != len(matrix[i]) - 1: | |
cell_sum = ( | |
matrix[i - 1][j] * 2 + matrix[i][j - 1] + matrix[i][j + 1] | |
) | |
else: | |
cell_sum = matrix[i - 1][j] * 2 + matrix[i][j - 1] + matrix[i][0] | |
else: | |
if i != len(matrix) - 1: | |
if len(matrix[i]) == 1: | |
cell_sum = matrix[i - 1][j] + matrix[i + 1][j] + matrix[i][j] * 2 | |
elif len(matrix[i]) == 2: | |
cell_sum = ( | |
matrix[i][j - 1] * 2 + matrix[i - 1][j] + matrix[i + 1][j] | |
) | |
else: | |
if j != len(matrix[i]) - 1: | |
cell_sum = ( | |
matrix[i - 1][j] | |
+ matrix[i][j + 1] | |
+ matrix[i + 1][j] | |
+ matrix[i][j - 1] | |
) | |
else: | |
cell_sum = ( | |
matrix[i - 1][j] | |
+ matrix[i][j - 1] | |
+ matrix[i][0] | |
+ matrix[i + 1][j] | |
) | |
else: | |
if len(matrix[i]) == 1: | |
cell_sum = matrix[i - 1][j] + matrix[0][j] + matrix[i][j] * 2 | |
elif len(matrix[i]) == 2: | |
cell_sum = matrix[i - 1][j] + matrix[0][j] + matrix[i][j - 1] * 2 | |
else: | |
if j != len(matrix[i]) - 1: | |
cell_sum = ( | |
matrix[i - 1][j] | |
+ matrix[0][j] | |
+ matrix[i][j - 1] | |
+ matrix[i][j + 1] | |
) | |
else: | |
cell_sum = ( | |
matrix[i - 1][j] | |
+ matrix[0][j] | |
+ matrix[i][j - 1] | |
+ matrix[i][0] | |
) | |
new_matrix[i][j] = cell_sum | |
for i in range(len(new_matrix)): | |
print(*new_matrix[i]) |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment