源代码:
#include<iostream>
using namespace std;
int main()
{
int n, a[100][100]={1};
cin >> n;
for (int m = 0; m < 2*n-1 ;m ++)
{
for (int i = 1; i <= 2*n-1-m; i ++)
{
if (i <= (2*n-m)/2)
{
a[i-1][i+m-1] = i;
a[i+m-1][i-1] = i;
}
else
{
a[i-1][i+m-1] = 2*n-m-i;
a[i+m-1][i-1] = 2*n-m-i;
}
}
}
for (int i = 0; i < 2*n-1; i ++)
{
for(int j=0;j<2*n-1;j++)
{
cout << a[i][j] << " ";
}
cout << endl;
}
return 0;
}