1757: 矩阵对角求和

解题思路:

注意事项:

参考代码:

#include <iostream>

using namespace std;

int main()

{

    int n, sum=0, num=0;

    int arr[100][100];

    cin >> n;

    for (int i = 0; i < n; ++i)

    {

        for (int j = 0; j < n; ++j)

        {

            cin >> arr[i][j];

            if (i == j)

            {

                sum += arr[i][j];

            }

            if (i + j == n - 1)

            {

                num += arr[i][j];

            }

        }

    }

    cout << sum << endl;

    cout << num << endl;

    return 0;

}