给定一个n×n的方阵，本题要求计算该矩阵除副对角线、最后一列和最后一行以外的所有元素之和。

#include <iostream>
using namespace std;


int main(int argc, char *argv[])
{
	
	int n;
	cin >> n;
	int **a = new int*[n];
	for (int i = 0; i < n; i++)
	{
		a[i] = new int[n];
	}
	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < n; j++)
		{
			cin >> a[i][j];
		}
	}
	int sum = 0;
	for (int i = 0; i < n-1; i++)
	{
		for (int j = 0; j < n-1; j++)
		{
			if (i + j != n - 1)
				sum += a[i][j];
		}
	}
	cout << sum;

	for (int i = 0; i < n; i++)
		delete[]a[i];
	

	return 0;
}