循环日程表问题（分治法）

//Author:FF-W
//Date: 24, Sep, 2018
//Purpose:循环日程表


#include <iostream>

using namespace std;

void copy_dataTime(int, int**);
void recursive_arrangement(int**,int);
void print_data(int**, int);

void recursive_arrangement(int **dataArray,int playerNumber ){

   if(playerNumber==1)
   {
       dataArray[0][0]=1;
       return;
   }
   recursive_arrangement(dataArray,playerNumber/2);
   copy_dataTime(playerNumber,dataArray);


}
void copy_dataTime(int playerNumber,int **dataArray){

    int m=playerNumber/2;
    for(int i=0;i<m;i++)
    {
        for(int j=0;j<m;j++)
        {
            dataArray[i][j+m]=dataArray[i][j]+m;
            dataArray[i+m][j]=dataArray[i][j+m];
            dataArray[i+m][j+m]=dataArray[i][j];
        }
    }

}
void print_data(int **dataArray, int playerNumber){

     for(int i=0;i<playerNumber;i++)
     {
         for(int j=0;j<playerNumber;j++)
         {
             cout<<dataArray[i][j]<<" ";

         }
         cout<<endl;
     }


}

int main()
{
    cout << "输入选手总个数" << endl;
    int playerNumber;
    cin>>playerNumber;
    int **dataArray=new int*[playerNumber];
    for(int i=0;i<playerNumber;i++)
    {
        dataArray[i]=new int[playerNumber];
    }
    recursive_arrangement(dataArray,playerNumber);
    cout<<"日程表安排如下："<<endl;
    print_data(dataArray,playerNumber);

    return 0;
}