循环赛日程表

/**
 * 循环赛日程表
 * @author zy
 *
 */
public class Table2
{

	/**
	 * @param args
	 */
	public static void main(String[] args)
	{
		// TODO Auto-generated method stub
		int k = 3;
		int totalNum = pow(2, k);	//总队伍数量
		int[][] a = new int[totalNum][totalNum];
		table(k, a);
		for (int i = 0; i < a.length; i++)
		{
			for (int j = 0; j < a[0].length; j++)
			{
				System.out.print(a[i][j] + "  ");
			}
			System.out.println();
		}

	}
	public static void table(int k, int a[][])
	{
		//定义初始最小单元
		a[0][0] = 1;
		a[0][1] = 2;
		a[1][0] = 2;
		a[1][1] = 1;

		int n = 2;
		int totalNum = pow(2, k);
		//当n值不超过总队伍数量的时候
		while(n < totalNum)
		{
			int temp = n;
			n *= 2;

			//填充左下角
			for (int i = 0; i < temp; i++)
			{
				for (int j = 0; j < temp; j++)
				{
					a[i+temp][j] = a[i][j] + temp;
				}
			}

			//复制左下角到右上角
			for (int i = temp; i < n; i++)
			{
				for (int j = 0; j < temp; j++)
				{
					a[j][i] = a[i][j];
				}
			}

			//复制左上角到右下角
			for (int i = 0; i < temp; i++)
			{
				for (int j = 0; j < temp; j++)
				{
					a[i+temp][j+temp] = a[i][j];
				}
			}

		}
	}
	/**
	 * 求x的n次方
	 */
	public static int pow(int x, int n)
	{
		if(n==0) return 1;
		return x * pow(x, n-1);
	}
}