ex05-07.cpp

数据结构常用算法合集

//EX05-07.cpp
#include <iostream.h>	//cout,cin
#include <conio.h>		// getch()
const int N=5;
void main()
{ int magic[N][N],i,j,k;
  for (i=0;i<N;i++)		//Set 0
  for (j=0;j<N;j++)
  magic[i][j]=0;
  i=1;
  j=(N/2)-1;
  for (k=1;k<=N*N;k++)
  { i--;
    j++;
    if ((i==-1) && (j==N))
    { i=1;
      j=N-1;
    } else
    { if (i==-1) i=N-1;
      else
      if (j==N) j=0;
    }
    if (magic[i][j]!=0)
    { i+=2;
      j--;
    }
    magic[i][j]=k;
  }
  cout << "Magic array as followings:\n";
  for (i=0;i<N;i++)
  { for (j=0;j<N;j++)
    { cout.width(3);
      cout<<magic[i][j];
    }
    cout << endl;
  }
  getch();
}