程序代码：

#define RIGHT__ 0 
#define LEFT__  1
#define UP__    2
#define DOWN__  3

#define N 9

typedef void (*DragonArrayMoveMethodFn)(unsigned short Array[N][N],unsigned short*,unsigned short*);


void MoveDown(unsigned short Array[N][N],unsigned short *CurrentX,unsigned short *CurrentY)
{
    Array[*CurrentX+1][*CurrentY] = Array[*CurrentX][*CurrentY] + 1;
    (*CurrentX)++;
    return;
}
void MoveUp(unsigned short Array[N][N],unsigned short *CurrentX,unsigned short *CurrentY)
{
    Array[*CurrentX-1][*CurrentY] = Array[*CurrentX][*CurrentY] + 1;
    (*CurrentX)--;
    return;
}
void MoveLeft(unsigned short Array[N][N],unsigned short *CurrentX,unsigned short *CurrentY)

{
    Array[*CurrentX][*CurrentY-1] = Array[*CurrentX][*CurrentY] + 1;
    (*CurrentY)--;
    return;
}
void MoveRight(unsigned short Array[N][N],unsigned short *CurrentX,unsigned short *CurrentY)
{
    Array[*CurrentX][*CurrentY+1] = Array[*CurrentX][*CurrentY] + 1;
    (*CurrentY)++;
    return;
}

DragonArrayMoveMethodFn Move[]={
    MoveRight,
    MoveLeft,
    MoveUp,
    MoveDown
};

unsigned short GetNewAction(unsigned short LastAction)
{
    //clockwise
    switch (LastAction)
    {
    case RIGHT__:
        return DOWN__;
    case LEFT__:
        return UP__;
    case UP__:
        return RIGHT__;
    case DOWN__:
        return LEFT__;
    }
}

bool IsNeedChangeAction(unsigned short Array[N][N],unsigned short CurrentX,unsigned short CurrentY,unsigned short LastAction)
{
    switch (LastAction)
    {
    case DOWN__:
        return (CurrentX == N-1) || Array[CurrentX+1][CurrentY] != 0;
    case UP__:
        return (CurrentX == N-1) || Array[CurrentX-1][CurrentY] != 0;
    case RIGHT__:
        return (CurrentY == N-1) || Array[CurrentX][CurrentY+1] != 0;
    case LEFT__:
        return (CurrentY == N-1) || Array[CurrentX][CurrentY-1] != 0;
    }
}

void GenDragonArray()
{
    unsigned short CurrentX = 0; 
    unsigned short CurrentY = 0;
    unsigned short DragonArray[N][N] = {0};
    unsigned short CurrentAction = RIGHT__;
    unsigned short Count = 0;

    DragonArray[0][0] = 1;
    while(Count<(N*N)-1)
    {
        //Determine whether need change action
        if (IsNeedChangeAction(DragonArray,CurrentX,CurrentY,CurrentAction))
        {
            //Change Move Action
            CurrentAction = GetNewAction(CurrentAction);
        }

        //Move
        Move[CurrentAction](DragonArray,&CurrentX,&CurrentY);

        Count++;
    }

    {
        int i=0;
        int j=0;
        for (i=0;i<N;i++)
        {
            for (j=0;j<N;j++)
            {
                printf("%02d ",DragonArray[i][j]);
            }
            printf("\n");
        }
    }
}

程序代码：

main()
{
   int i,n[100];
   scanf("%d",&n[0]);
   for(i=1;i<=n[0];i++)
      scanf("%d",&n[i]);
   for(i=1;i<=n[0];i++)
      GenDragon(n[i]);
}
int GenDragon(int n)
{
   int a[25][25]={0},i=1,j=1,iold,jold,d=1,x;
   for(x=1;x<=n*n;x++)
   {
       a[i][j]=x;
       iold=i;
       jold=j;
       if(d%4==1)j++;
       if(d%4==2)i++;
       if(d%4==3)j--;
       if(d%4==0)i--;
       if( i>n || j>n || i*j==0 || a[i][j]!=0 )
       {
          d++;
          i=iold;
          j=jold;
          if(d%4==1)j++;
          if(d%4==2)i++;
          if(d%4==3)j--;
          if(d%4==0)i--;
       }
   }
   for(i=1;i<=n;i++)
   {
      for(j=1;j<=n;j++)
         printf("%4d",a[i][j]);
      printf("\n");
   }
   printf("\n");
}

程序代码：

3
1
2
5
    1

    1    2
    4    3

    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