circleshedule.txt

当很多队伍要循环比赛的时候

//循环赛日程表
#include<iostream>
using namespace std;
void Table(int k,int (*DataArray)[9]);

void main()
{
	cout<<"\t\t\t************************************"<<endl;
    cout<<"\t\t\t   递归与分治策略-- 循环赛日程表    "<<endl;
	cout<<"\t\t\t     海川工作室出品(2007,5,12)      "<<endl;      
	cout<<"\t\t\t************************************"<<endl;
	int DataArray[9][9];
	Table(3,DataArray);
	DataArray[0][0];
	for(unsigned short int horizon=1;horizon<=8;horizon++)
	{
		for(unsigned short int row=1;row<=8;row++)
		{
			cout<<DataArray[horizon][row]<<" ";
		}
		cout<<endl;
	}
}
void Table(int exponent,int (*DataArray)[9])
{
	int FormSize=1;
	unsigned short int Row=1;
	unsigned short int Horizon=1;
	for(unsigned short int counter=1;counter<=exponent;counter++)
	{
		 FormSize=FormSize*2;
	}
	for(Row=1;Row<=FormSize;Row++)
	{
		DataArray[1][Row]=Row;
	}
	int Once=1;
	for(counter=1;counter<=exponent;counter++)//本层for进行三次循环
	{
		FormSize= FormSize/2;
		for(int CopyForm=1; CopyForm<= FormSize; CopyForm++)//本层for进行8次循环
		{
			for(int Horizon=Once+1; Horizon<=2*Once; Horizon++)//Once=1时本层进行一次
			{
				for(int Row=Once+1;Row<=2*Once;Row++)//Once=1时，本层进行一次
				{
					DataArray[Horizon][Row+( CopyForm-1)*Once*2]=DataArray[Horizon-Once][Row+( CopyForm-1)*Once*2-Once];
					DataArray[Horizon][Row+( CopyForm-1)*Once*2-Once]=DataArray[Horizon-Once][Row+( CopyForm-1)*Once*2];
				}
	
			}
		}
		Once=Once*2;
	}
}