#include <stdio.h>
#include <math.h>
int table[128][128];
void Tournament (int r, int c, int n)
{
if(n == 1) return ;
int half = n / 2;
table [r + half][c + half] = table [r][c];
table [r][column + half] = table [r][c] + half;
table [r + half][c] = table [r][c] + half;
Tournament (r, c, half);
Tournament (r, c + half, half);
Tournament (r + half, c, half);
Tournament (r + half, c + half, half);
}
int main ()
{
int i, j, n;
scanf ("%d", &n);
table [0][0] = 1;
Tournament (0, 0, pow (2 , n));
for (i = 0; i < pow (2, n); i++)
{
for (j = 0; j < pow (2, n) - 1; j++)
{
printf ("%d ", table [i][j]);
}
printf ("%d", table [i][j]);
printf ("\n");
}
return 0;
}
[NOJ][算法实验一]1243.循环赛日程表
最新推荐文章于 2022-12-20 22:12:36 发布