东华大学oj特殊的矩阵算法

 很孬，数组名是在看了鬼畜视频之后取的，不要在意

#include <cmath>
#include <iomanip>
#include <iostream>
using namespace std;
int main()
{
	int m, n,ram;
	cin >> m >> n;
	while (m--)
	{
		int rem[9][9] = {0};
		int sxc[9] = { 0 }, jss[9] = { 0 };

		for (int x = 0; x < n; x++)//对二维数组进行赋值
		{
			for (int y = 0; y < n; y++)
			{
				cin >> ram;
				rem[x][y] = ram;
			}
		}
		int h=0,i=0;
		for (int c = 0; c < n; c++)//将俩条对角线化为一维数组
		{
			for (int d = 0; d < n; d++)
			{
				if (c == d)
				{
					sxc[h] = rem[c][d];
					h++;
				}
				if (c + d == n - 1)
				{
					jss[i] = rem[d][c];
					i++;
				}
			}
		}

		int cxk=0, lbw=0;
		for (int e = 0; e < n; e++)
		{
			cxk =cxk+ sxc[e] * jss[e] ;
			lbw =lbw+sxc[e]/jss[e];
		}
		cout << cxk << " "<<lbw << endl;
	}
	return 0;
}