填充规则:从第一行最后一列开始逆时针填充数字
//如果输入数据过大修改setw(n)改变输出位数
//该方法逐行逐列计算对应数 故写法较简短
#include<iostream>
#include<iomanip>
int main()
{
int n;
std::cout << "请输入矩阵大小n" << std::endl;
std::cin >> n;
int** a = new int* [n];
for (int i = 0, j; i < n; i++, std::cout << std::endl){
for (j = 0, a[i] = new int[n]; j < n; std::cout << std::setw(4) << std::setiosflags(std::ios::left) << a[i][j], j++){
if (j >= i && j <= n - i)
a[i][j] = 4 * (i * n - i * i) + n - j - i;
else if (j < i && j < n - i)
a[i][j] = a[j][j] + i - j;
else if (j > i)
a[i][j] = a[n - j][j] - i + n - j;
else
a[i][j] = a[i][n - i - 1] + j + i - n + 1;
}
}
return 0;
}
//粘贴转载无需过问