魔方阵

import java.util.Scanner;
public class MagicSquare { 
public static void main(String[] args) { 
 // TODO 自动生成的方法存根  
Scanner mscan=new Scanner(System.in); 
 System.out.println("please input odd num order:");
  int n=mscan.nextInt();  
int [][]magic=new int[n][n];  
  int rank=(n+1)/2-1; 
 int row=0; 
 magic[0][rank]=1;  
for(int x=2;x<=n*n;x++){ 
  row--;   
rank--;   
if((row==-1)&&(rank==-1)) {  
  row=row+2;  
  rank=rank+1;  
 }   else { 
  if(row==-1)  
 row=n-1;  
 if(rank==-1)  
rank=n-1;  
 }  
 if(magic[row][rank]!=0) { 
   row=row+2; 
   rank=rank+1; 
  }  
 magic[row][rank]=x;  
   } 
 for(int i=0;i<magic.length;i++) {
   for(int j=0;j<magic[i].length;j++) { 
   System.out.print(magic[i][j]+" "); 
  }  
 System.out.println(); 
 }  
}}