4.4.cpp

解决经典的奇数阶魔方阵的问题,相信大家对这个问题都比较熟悉了,看看我的这个实现是不是很经典,请支持,谢谢!

/*奇数阶魔方阵问题*/
#include<iostream>
using namespace std;
const int MAX=50;
void main()
{
	int matrix[MAX][MAX];
	int count;
	int row;
	int column;
	int order;
	cout<<"请输入阶数:";
	cin>>order;
	if(order%2==0)
	{
		cout<<"阶数必须是一个奇数,请重新输入!"<<endl;
	} else
	{
	   row=0;
	   column=order/2;
	   for(count=1;count<=order*order;count++)
	   {
		   matrix[row][column] = count;
		   if (count % order == 0)
		   {
			   row++;
		   }
		   else 
           {        
               row    = (row == 0) ? order - 1 : row - 1;
               column = (column == order-1) ? 0 : column + 1;
           }
	   }

	    for (row = 0; row < order; row++) 
		{
          for (column = 0; column < order; column++)
		  {
		    
            cout<<"\t"<<matrix[row][column];
		  }
	     cout<<endl;
		}
      

	}
         
          
}