分析:
很水的签到题,但是一定要把思路想清楚了再做,否则(T_T) .题解:
设一开始斜对角线为0的矩阵元素之和为Sum0,补全后每一横排元素之和为S,缺失的斜对角线元素之和为X,由题意得 X = S,所以由Sum0 + S = n * S 所以S = Sum0/(n-1) , 然后设缺失时矩阵每行之和为S1~Sn,那么可以得出每行缺失的元素x1~xn = S - S1~Sn . 非常简单!(下次要想清楚再动手!)AC 代码:
#include <iostream>
#include <cmath>
using namespace std;
typedef long long ll;
int n;
ll mat[110][110];
ll Sum(int a)
{
ll sum = 0;
for(int i=1;i<=n;i++)
{
if(i == a) continue;
sum += mat[a][i];
}
//cout << sum << endl;
return sum;
}
void out()
{
for(int i=1;i<=n;i++)
{
for(int j=1;j<n;j++)
{
cout << mat[i][j] << " ";
}
cout << mat[i][n] << endl;
}
}
int main()
{
ll ss = 0;
cin >> n;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
cin >> mat[i][j];
ss += mat[i][j];
}
}
if(n == 1|| n == 2)
out();
else
{
//cout << ss << endl;
ll s = ss/(n-1);
//cout << s << endl;
for(int i=1;i<=n;i++)
{
//cout << s << endl;
mat[i][i] = s - Sum(i);
}
out();
}
}