Problem 2622. Packing oranges - one layer

Created by Jan Orwat

Solve Later

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.

Solve

Solution Stats

50 Solutions
10 Solvers

Last Solution submitted on Aug 09, 2024

Last 200 Solutions

Problem Comments

4 Comments

4 Comments

Show 1 older comment

rifat on 12 Oct 2014

May be I am wrong. But, are test 7 and 8 correct?

Tim on 13 Oct 2014

Looks like 7 and 8 should use fit(x), not fit(x,y).

Jan Orwat on 13 Oct 2014

Sorry for that. Fixed now.

Rafael S.T. Vieira on 28 Jun 2020

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).

Solution Comments

Show comments

Problem Recent Solvers10

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 2622. Packing oranges - one layer

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers10

Suggested Problems

More from this Author40

Problem Tags

Community Treasure Hunt

Problem 2622. Packing oranges - one layer

Solution Stats

Last 200 Solutions

Problem Comments

Solution Comments

Problem Recent Solvers10

Suggested Problems

More from this Author40

Problem Tags

Community Treasure Hunt

Players

WeChat