1889831_ac_0ms_60k.c

来自「北大大牛代码 1240道题的原代码 超级权威」· C语言 代码 · 共 17 行

# include <stdio.h>

int main()
{
 int m, n, i;
 int card[14][14]={{0},{1},{2,1},{3,1,2},{2,1,4,3},{3,1,4,5,2},{4,1,6,3,2,5},{5,1,3,4,2,6,7},{3,1,7,5,2,6,8,4},{7,1,8,6,2,9,4,5,3},{9,1,8,5,2,4,7,6,3,10},{5,1,6,4,2,10,11,7,3,8,9},{7,1,4,9,2,11,10,8,3,6,5,12},{4,1,13,11,2,10,6,7,3,5,12,9,8}};
 
 scanf("%d",&m);
 while(m--)
 {
  scanf("%d",&n);
  for(i = 0; i < n - 1; i++)
   printf("%d ",card[n][i]);
   printf("%d\n",card[n][n-1]);
 }
 return 1;
}