Help the seller to pack oranges efficiently. How many oranges can be put into a box in one layer without squeezing them?
Given dimension(s) return the maximum number. Assume that oranges are perfect spheres with unitary diameter.
Solution Stats
Problem Comments
4 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers11
Suggested Problems
-
Project Euler: Problem 7, Nth prime
1748 Solvers
-
Convert hex color specification to MATLAB RGB
253 Solvers
-
Check if number exists in vector
13788 Solvers
-
Replace secondary diagonal elements of a square array
182 Solvers
-
Find the sides of an isosceles triangle when given its area and height from its base to apex
2135 Solvers
More from this Author40
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
May be I am wrong. But, are test 7 and 8 correct?
Looks like 7 and 8 should use fit(x), not fit(x,y).
Sorry for that. Fixed now.
Every test is correct. The problem with the circle packing algorithm is precision. Set the precision wrongly and we will miss a lot of circles (It was fun to revisit this kind of problem). And btw, the upper bound for circle packing in the plane is pi/sqrt(12) of the total area. Ignore the spheres in the question, it's a circle packing problem ("easy" version, since we already have the radii).