论文部分内容阅读
例题讲解１２９．一个国家的国王打算建ｎ个城市且修（ｎ－１）条道路，使每条道路连结两个城市而不经过其它城市，每两个城市都可以互相到达，其间的最短距离恰是１，２，…，Ｃ２ｎ＝１２ｎ（ｎ－１）这些数，问在下列情况下，国王的打算能否实现：（ｉ）ｎ＝６；（ｉ）...
Example explanation 129. The king of a country intends to build n cities and repair (n-1) roads so that each road connects two cities without passing through other cities. Every two cities can reach each other. The shortest distance between them is exactly 1. 2,..., C2n=12n(n-1) These numbers ask whether the King’s plan can be achieved if: (i) n=6; (i)...