| Run ID | 作者 | 问题 | 语言 | 测评结果 | Time | Memory | 代码长度 | 提交时间 |
|---|---|---|---|---|---|---|---|---|
| 78453 | 彭士宝 | 对角线之和 | Python3 | Wrong Answer | 31 MS | 3768 KB | 515 | 2024-06-22 09:30:34 |
def calculate_diagonal_sum(n): diagonal_sum = 0 matrix = [[0] * n for _ in range(n)] i = 1 for row in range(n): for col in range(n): matrix[row][col] = i i += 1 for i in range(n): diagonal_sum += matrix[i][i] for i in range(n): diagonal_sum += matrix[i][n-i-1] if n % 2 == 1: diagonal_sum -= matrix[n//2][n//2] return diagonal_sum n = 4 result = calculate_diagonal_sum(n) print("对角线之和是:", result)
------Input------
5 289 405 453 530 261 553 893 500 893 724 873 313 343 885 933 268 495 115 355 340 729 833 962 654 886
------Answer-----
5144
------Your output-----