题目:
小明玩一个数字游戏,取个n行n列数字矩阵(其中n为不超过100的奇数),数字的填补方法为:在矩阵中心从1开始以逆时针方向绕行,逐圈扩大,直到n行n列填满数字,请输出该n行n列正方形矩阵以及其的对角线数字之和.
例如
题解:
做完感觉挺好玩的,发一下代码供参考。
#include <iostream>
#include <iomanip>
#include <cstring>
using namespace std;
const int N = 100;
int a[N][N];
int main()
{
int size, thick;
cin >> size;//可能需要特判1
thick = size / 2;
a[thick + 1][thick + 1] = 1;
for (int i = 1; i <= thick; i++)
a[i][i] = ((thick - i + 1) * 2) * ((thick - i + 1) * 2) + 1;
for (int i = 1; i <= thick; i++)
{
for (int j = i + 1; j <= (size - i + 1); j++)
{
a[i][j] = a[i][j - 1] - 1;
a[j][i] = a[j - 1][i] + 1;
}
}
for (int i = size - thick + 1; i <= size; i++)
{
for (int j = (size + 2 - i); j <= size; j++)
{
a[i][j] = a[i][j - 1] + 1;
if (i != j)
a[j][i] = a[j - 1][i] - 1;
}
}
for (int i = 1; i <= size; i++)
{
for (int j = 1; j <= size; j++)
{
cout << setw(5) << a[i][j];
}
cout << endl;
}
return 0;
}