循環比賽日程表

題目描述

設有n個選手進行循環比賽，其中n = 2m，要求每名選手要與其餘n - 1名選手都賽一次，每名選手天天比賽一次，循環賽共進行n - 1天，要求天天沒有選手輪空。

 

輸入

一行，包含一個正整數m。

 

輸出

表格形式的比賽安排表（n行n列），每一個選手的編號佔三個字符寬度，右對齊。

 

樣例輸入

3

 

樣例輸出

  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<bits/stdc++.h>

using namespace std;

int n,a[1050][1050],yi=1;

void tian()

{

         int c=1,jih=2,ci=0,jil=1;

         while(c<n)

         {

                   for(int i=0;i<c;i++)

                   {

                            ci=0;jil=1;

                            while(jil<=n)

                            {

                                     if(ci==0)

                                     {

                                               for(int j=0;j<c;j++)

                                               {

                                                        a[i+jih][j+jil]=a[i+jih-c][j+jil+c];

                                               }

                                               jil+=c;

                                               ci=1;

                                     }

                                     else

                                     {

                                               for(int j=0;j<c;j++)

                                               {

                                                        a[i+jih][j+jil]=a[i+jih-c][j+jil-c];

                                               }

                                               jil+=c;ci=0;

                                     }

                            }

                           

                   }

                   jih+=c;c*=2;

         }

}

int main()

{

         cin>>n;

         n=(1<<n);

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

         {

                   a[1][i]=i;

         }

         tian();

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

         {

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

                   {

                            cout<<setw(3)<<a[i][j];

                   }

                   printf("\n");

         }

}

我寫的暴力枚舉法，沒打找規律

就這題耗了半個小時才寫完