AcWing 754. 平方矩阵 II
原题链接
简单
作者:
wjie
,
2021-01-21 12:40:11
,
所有人可见
,
阅读 327
#include <iostream>
#include <cstdio>
#include <cmath>
using namespace std;
int arr[105][105];
void out(int n)
{
for (int i = 1; i <= n; ++i)
{
for (int j = 1; j <= n; ++j)
{
printf("%d ", arr[i][j]);
}
puts("");
}
puts("");
}
int main()
{
int n;
while (scanf("%d", &n) && n)
{
for (int i = 1; i <= n; ++i)
{
for (int j = 1; j <= i; ++j) arr[i][j] = n - abs(n-i) - abs(j) + 1;
for (int j = i+1; j <= n; ++j) arr[i][j] = n - abs(i) - abs(n-j) + 1;
}
out(n);
}
return 0;
}