题目描述
设有n=2k个球队参加循环赛,要求设计一个满足以下要求比赛日程表:
(1) 每支球队必须与其他n-1支球队各赛一次;
(2) 每支球队一天只能参赛一次;
(3) 循环赛在n-1天内结束。
一个整数k(0 <= k <= 6 )
输入
一个整数k(0 <= k <= 6)
输出
输出一个n行n列的表,在表中的第i行,第j列处填入为第i个球队在第j天所遇到的球队。8个球队的比赛日程如样例输出所示
样例输入 Copy
3
样例输出 Copy
1 2 3 4 5 6 7 8
2 1 4 3 6 5 8 7
3 4 1 2 7 8 5 6
4 3 2 1 8 7 6 5
5 6 7 8 1 2 3 4
6 5 8 7 2 1 4 3
7 8 5 6 3 4 1 2
8 7 6 5 4 3 2 1
#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#include<string>
#define INF 999999999
#define N 1001
#define MOD 1000000007
using namespace std;
int a[N][N];
int main()
{
int m;
int k = 1, half = 1;
cin >> m;
int n = 1 << m;
a[0][0] = 1;
while (k <= m)
{
for (int i = 0; i < half; i++)
for (int j = 0; j < half; j++)
a[i][j + half] = a[i][j] + half;
for (int i = 0; i < half; i++)
for (int j = 0; j < half; j++)
{
a[i + half][j] = a[i][j + half];
a[i + half][j + half] = a[i][j];
}
half *= 2;
k++;
}
for (int i = 0; i < n; i++)
{
for (int j = 0; j < n; j++)
printf("%d ", a[i][j]);
cout << endl;
}
return 0;
}