博文的专栏

Problem Description Tom wants to cover a rectangular floor by identical L-shape tiles without overlap. As shown below, the floor can be split into many small squares, and the L-shape tile consists of

Problem Description 设有N个选手进行循环比赛，其中N=2^M，要求每名选手要与其他N-1名选手都赛一次，每名选手每天比赛一次，循环赛共进行N-1天，要求每天没有选手轮空。 Input 输入第一行为T，表示数据组数，对于每组数据就一个M(1<=M<=10)。 Output 对于每组输入的M，输出表格形式的比赛安排表 Sample Input 1 3

代码： #include #include #include #include using namespace std; struct mm { int a; int b; }x[1005]; int main() { int t,max,i,j,n; string s; scanf("%d",&t); getchar(); while(t