二维数组排列对角线求和-C描述
#define N 3
int a[N][N] = { 0 };
int num = 1;
for (int i = 0; i < N*N; i++)
{
a[i / N][i%N] = num++;
}
int sum1 = 0;
int sum2 = 0;
for (int i = 0; i < N; i++)
{
for (int j = 0; j < N; j++)
{
printf("%4d",a[i][j]);
if (i ==j)
sum1 = sum1+ a[i][j];
if (i + j == N - 1)
sum2 = sum2 + a[i][j];
}
printf("\n");
}
printf("\nsum1 = %d ,sum2 = %d", sum1,sum2);
getchar(); #define N 3
int a[N][N
