Description: Given n-size circle c1, c2, c3 ,..., cn, is a circular to this n into a rectangular box, and asked to circle and tangent to the bottom edge of the rectangular box. With the issue of yen from the n-all arranged in a circle to identify the length of the circle with the smallest. Programming tasks: for a given round of the n-designed algorithm to calculate the best n-round with programs to minimize the length. Input: the first line there is a positive integer n (the number of round 1 ≤ n ≤ 20) then there is n number of line 1, that n the radius of a circle Output: the minimum will be calculated with the length of a round (reservations 2 decimal) For example: Input: 3 1 1 2 output: 7.66
To Search:
File list (Check if you may need any files):
圆排列
......\Debug
......\.....\圆排列.exe
......\.....\圆排列.ilk
......\.....\圆排列.pdb
......\圆排列
......\......\Debug
......\......\.....\BuildLog.htm
......\......\.....\mt.dep
......\......\.....\vc90.idb
......\......\.....\vc90.pdb
......\......\.....\圆排列.exe.intermediate.manifest
......\......\.....\圆排列.obj
......\......\圆排列.cpp
......\......\圆排列.vcproj
......\......\圆排列.vcproj.CJTC1989-PC.caojun.user
......\圆排列.ncb
......\圆排列.sln
Download