杭电1998--奇数阶魔方（模拟）

Problem Description

一个 n 阶方阵的元素是1,2,...,n^2,它的每行，每列和2条对角线上元素的和相等，这样
的方阵叫魔方。n为奇数时我们有1种构造方法，叫做“右上方” ，例如下面给出n=3，5，7时
的魔方.
3
8 1 6
3 5 7
4 9 2
5
17 24 1 8 15
23 5 7 14 16
4 6 13 20 22
10 12 19 21 3
11 18 25 2 9
7
30 39 48 1 10 19 28
38 47 7 9 18 27 29
46 6 8 17 26 35 37
5 14 16 25 34 36 45
13 15 24 33 42 44 4
21 23 32 41 43 3 12
22 31 40 49 2 11 20
第1行中间的数总是1，最后1行中间的数是n^2,他的右边是2，从这三个魔方，你可看出“右
上方”是何意。

Input

包含多组数据，首先输入T,表示有T组数据.每组数据1行给出n(3<=n<=19)是奇数。

Output

对于每组数据，输出n阶魔方，每个数占4格，右对齐

Sample Input

2 3 5

Sample Output

8 1 6 3 5 7 4 9 2 17 24 1 8 15 23 5 7 14 16 4 6 13 20 22 10 12 19 21 3 11 18 25 2 9

 

累死我了，一道模拟题，搞了大半天，……不说了，自己看吧！ 

# include<stdio.h>

# include<string.h>

int map[40][40],mark[40][40];

int main()

{

       int t,n,i,j,ii,jj,count;

       scanf("%d",&t);

       while(t--)

       {

              scanf("%d",&n);

              memset(map,0,sizeof(map));

              memset(mark,0,sizeof(mark));

              count=1;

              map[1][n/2+1]=1;

              while(count<n*n)

              {

                     for(j=1;j<n;j++)

                     {

                            if(map[1][j]>0&&mark[1][j]==0)

                            {

                                   if(map[n][j+1]==0)

                                   {

                                          map[n][j+1]=map[1][j]+1;

                                          mark[1][j]=1;

                                          count++;

                                   }

                            }

                     }

                     for(i=2;i<=n;i++)

                     {

                            if(map[i][n]>0&&mark[i][n]==0)

                            {

                                   if(map[i-1][1]==0)

                                   {

                                          map[i-1][1]=map[i][n]+1;

                                          mark[i][n]=1;

                                          count++;

                                   }

                            }

                     }

                     for(i=2;i<=n;i++)

                     {

                            if(map[i][1]&&mark[i][1]==0)

                            {

                                   ii=i;jj=1;

                                   while(ii>=2&&jj<n)

                                   {

                                          if(map[ii-1][jj+1]==0)

                                          {

                                                 map[ii-1][jj+1]=map[ii][jj]+1;

                                                 ii--;

                                                 jj++;

                                                 mark[i][1]=1;

                                                 count++;

                                          }

                                          else if(ii+1<=n&&map[ii+1][jj]==0)

                                          {

                                                 map[ii+1][jj]=map[ii][jj]+1;

                                                 ii++;

                                                 mark[i][1]=1;

                                                 count++;

                                                

                                          }

                                          else

                                                 break;

                                   }

                            }

                     }

                     for(j=1;j<n;j++)

                     {

                            if(map[n][j]&&mark[n][j]==0)

                            {

                                   ii=n;jj=j;

                                   while(ii>1&&jj<n)

                                   {

                                          if(map[ii-1][jj+1]==0)

                                          {

                                                 map[ii-1][jj+1]=map[ii][jj]+1;

                                                 ii--;

                                                 jj++;

                                                 mark[n][j]=1;

                                                 count++;

                                          }

                                          else if(ii+1<=n&&map[ii+1][jj]==0)

                                          {

                                                 map[ii+1][jj]=map[ii][jj]+1;

                                                 ii++;

                                                 mark[n][j]=1;

                                                 count++;

                                          }

                                          else

                                                 break;

                                   }

                            }

                     }

                     if(map[1][n]&&mark[1][n]==0)

                     {

                            map[2][n]=map[1][n]+1;

                            mark[1][n]=1;

                            count++;

                     }

              }

              for(i=1;i<=n;i++)

              {

                     for(j=1;j<=n;j++)

                            printf("M",map[i][j]);

                     printf("\n");

              }

       }

       return 0;

}

 

通过奇数阶魔方的分析，其中的数字有如下的规律：

(1)自然数出现在第一行的正中间；(map[1][n/2+1]=1);

(2）若填入的数字在第一行（不在第n列），则下一个数字在第n行（最后一行）且列数加一 (map[n][j+1]=map[1][j]);

(3)若填入的数字在该行的最后一列，则下一个数字在上一行的最左侧（map[i][1]=map[i+1][n]）;

(4)一般的，下一个数字在前一个数字的右上方（map[i-1][j+1]=map[i][j]）;

(5)若要填的数字已经有数字或在方阵之外，则下一个数字在前一个数字的下方（if（map[i-1][j+1]!=0||i-1<1||j>n）,map[i+1][j]=map[i][j]）;