论文部分内容阅读
为 n个球队的单循环赛事作出安排 ,我们用拼凑和穷举的方法可以解决 ,但 n较大时就很困难了 (如 n6时 ) ,而利用下面的方法却能轻易找到问题的解 .将 n个球队编号 1 ,2 ,3,… ,n.( 1 )当 n为奇数时 ,共分 n轮 ,每轮 n- 1个队参加 ,一个队轮空 .下面举例以 n=5和 n=7进行说明 :
Arranging for a single round of events for n teams, we can use patchwork and exhaustive methods to solve, but when n is large, it is very difficult (such as n6), and the solution to the problem can be easily found by the following method. The n teams numbered 1, 2, 3,..., n. (1) When n is odd, it is divided into n rounds, each round n - 1 team to participate, one team turns empty. The following example with n = 5 And n=7 to explain: