Description: Given n circles of varying sizes c, c,, cn 1 2 , now to the n rows into a round rectangle, and require each circle and tangent to the bottom edge of the rectangle. Circular permutation problem requires from all permutations of n circles to find a minimum length, arranged in a circle. For example, when n = 3, and the three given radius of the circle, respectively 1,1,2, this minimum length of three round circle arrangement shown in Fig. The minimum length is 2+ 4 2.
To Search:
File list (Check if you may need any files):
bit yuanpailie.txt
Download