#include<iostream>
#include<iomanip>
using namespace std;
const int N = 5;
int main()
{
int i,j,k;
int a[N][N];
cout<<"原始矩阵:"<<endl;
for(i=0; i<N; i++)
{
for(j=0; j<N; j++)
{
a[i][j] = 0;
}
}
i=0;
j=N/2;
a[i][j] = 1;
for(k=2; k<=N*N; k++)
{
i--;
j++;
if( i<0 )
i=N-1;
if( j>N-1 )
j=0;
if( a[i][j] != 0 )
{
i = (i+2) % N;
j = (j-1+N) % N;
}
a[i][j] = k;
}
cout<<"魔方阵的输出结果:"<<endl;
for(i=0; i<N; i++)
{
for(j=0; j<N; j++)
{
cout<<setw(4)<<a[i][j]<<" ";
}
cout<<endl;
}
return 0;
}
魔方图
最新推荐文章于 2022-04-24 23:33:00 发布