矩阵如下:
1 2 3 4 5
16 17 18 19 6
15 24 25 20 7
14 23 22 21 8
13 12 11 10 9
#include <iostream>
using namespace std;
int a[10][10];
void Fun(int n)
{
int m=1,i,j;
for (i=0; i<n/2; i++)
{
//四个for循环,表示四个方向
for (j=0; j<n-i; j++)
{
if ( a[i][j]==0)
a[i][j] = m++;
}
for (j=i+1; j <n-i; j++)
{
if (a[j][n-1-i] ==0)
a[j][n-1-i]=m++;
}
for (j=n-i-1; j>i; j--)
{
if (a[n-i-1][j] == 0)
a[n-i-1][j] =m++;
}
for (j=n-i-1; j>i; j--)
{
if (a[j][i] == 0)
a[j][i]=m++;
}
}
if (n%2==1)
a[n/2][n/2]=m;
}
int main()
{
int n,i,j;
cin >>n;
for ( i=0; i <n; i++)
{
for ( j=0; j<n; j++)
a[i][j] ==0;
}
Fun(n);
for (i=0; i <n; i++)
{
for (int j=0; j<n; j++)
{
cout << a[i][j] <<" ";
}
cout << endl;
}
return 0;
}
1 2 3 4 5
16 17 18 19 6
15 24 25 20 7
14 23 22 21 8
13 12 11 10 9
#include <iostream>
using namespace std;
int a[10][10];
void Fun(int n)
{
int m=1,i,j;
for (i=0; i<n/2; i++)
{
//四个for循环,表示四个方向
for (j=0; j<n-i; j++)
{
if ( a[i][j]==0)
a[i][j] = m++;
}
for (j=i+1; j <n-i; j++)
{
if (a[j][n-1-i] ==0)
a[j][n-1-i]=m++;
}
for (j=n-i-1; j>i; j--)
{
if (a[n-i-1][j] == 0)
a[n-i-1][j] =m++;
}
for (j=n-i-1; j>i; j--)
{
if (a[j][i] == 0)
a[j][i]=m++;
}
}
if (n%2==1)
a[n/2][n/2]=m;
}
int main()
{
int n,i,j;
cin >>n;
for ( i=0; i <n; i++)
{
for ( j=0; j<n; j++)
a[i][j] ==0;
}
Fun(n);
for (i=0; i <n; i++)
{
for (int j=0; j<n; j++)
{
cout << a[i][j] <<" ";
}
cout << endl;
}
return 0;
}