Description: Container packing problem: given a container, and its length L, width W and height H, the current batch of cylindrical timber, each timber* long are L, but the radius is different for the first i-kan timber radius ri. Asked how the packing, making me be assembled in* the maximum utilization of space? Use greedy algorithm to solve.* Compiler Methods: Open cpp file, compiled at the same time in the establishment of the project, open the settings-
File list (Check if you may need any files):
Download