int i, j;
int sum = 0;
int repair_index = 3 - 1;
for (i = 0; i < 3; i++) {
int right = arr[i][i];
int left = arr[2 - i][2 - i];
if (right == left) {
sum += right;
} else {
sum = sum + (right + left);
}
}
printf("对角线元素之和是:%d\n", sum);
int sum = 0;
int repair_index = 3 - 1;
for (i = 0; i < 3; i++) {
int right = arr[i][i];
int left = arr[2 - i][2 - i];
if (right == left) {
sum += right;
} else {
sum = sum + (right + left);
}
}
printf("对角线元素之和是:%d\n", sum);
2019-10-17