c++任意数循环赛另一种递归实现方…

//动态申请比较难调试，谁需要请私信~

#include"iostream"

#include"cstdlib"

#include"vector" 

using namespace std;

//vector> a;

int n;//运动员数

//int ** a;//二维数组名

int a[100][100];

 

void round_robin(int low,int digit);//low是低位，digit是low之后多少位 

int main(int argc,char * argv[])

{

while(1)

{

cout<<"Please input the number of the athletes(Input 0 to break):";

cin>>n;

if(n==0)

break;

//动态申请

//矩阵第一列为选手编号，所以申请空间多了一列 

//初始化 

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

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

a[i][j]=-1;//元素均初始化为-1，便于调试

for(int i=0;i

a[i][0]=i+1;

round_robin(0,n);

//结果输出 

cout<<"The result is:"<<endl; 

for(int i=0;i

{

for(int j=0;j

{

cout<<a[i][j]<<' ';

}

cout<<endl;

}

//释放指针

}

system("pause");

return 0;

}

void round_robin(int low,int digit)

{

if(digit==2)

{

a[low][1]=a[low+1][0];

// cout<<"a["<<low<<"]["<<1<<"]="<<a[low+1][0]<<endl;

a[low+1][1]=a[low][0];

// cout<<"a["<<low+1<<"]["<<1<<"]="<<a[low][0]<<endl;

}

else if(digit%2==1)//奇数的结果就是n+1的结果，把第n+1队员的编号改成0，并且去掉最后一行的结果 

{

int t=a[low+digit][0];

a[low+digit][0]=0;

a[0][low+digit]=0;

round_robin(low,digit+1);

a[low+digit][0]=t;

 

}

else if(digit%2==0)

{

int digit_1=digit/2;

round_robin(low,digit_1);

round_robin(low+digit_1,digit_1);

if(digit_1%2==1)

{

for(int i=low;i

{

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

{

if(a[i][j]==0)

{

a[i][j]=a[i+digit_1][0];

// cout<<"a["<<i<<"]["<<j<<"]="<<a[i+digit_1][0]<<endl;

a[i+digit_1][j]=a[i][0];

// cout<<"a["<<i+digit_1<<"]["<<j<<"]="<<a[i][0]<<endl;

}

}

}

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

{

for(int j=digit_1+1;j

{

int transfer=(i+j-1)%digit_1+digit_1+1;

// cout<<"transfer="<<transfer<<endl;

a[low+i-1][j]=a[transfer+low-1][0];

// cout<<"a["<<low+i-1<<"]["<<j<<"]="<<a[transfer+low-1][0]<<endl;

a[low+transfer-1][j]=a[i+low-1][0];

// cout<<"a["<<low+transfer-1<<"]["<<j<<"]="<<a[i+low-1][0]<<endl;

}

}

}

else if(digit_1%2==0)

{

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

{

for(int j=digit_1;j<=digit-1;j++)

{

int transfer=(i+j-1)%digit_1+digit_1+1;

// cout<<"transfer="<<transfer<<endl;

a[low+i-1][j]=a[transfer+low-1][0];

// cout<<"a["<<low+i-1<<"]["<<j<<"]="<<a[transfer+low-1][0]<<endl;

a[low+transfer-1][j]=a[i+low-1][0];

// cout<<"a["<<low+transfer-1<<"]["<<j<<"]="<<a[i+low-1][0]<<endl;

}

} 

}

}

}