this solution packs all 240 boxes (99.1% efficiency); Rather than entering as many boxes as possible in each level, in the actual contest I used a somewhat more convoluted strategy that attempted to condition the box heights so that they would also pack nicely vertically across sequential levels, but the 2d-packing solver works just as well for these simpler "unconstrained" cases. Here (http://www.kaggle.com/c/packing-santas-sleigh/forums/t/6934/how-d-you-do-it/38414#post38414) is a more detailed description of the method I used in that contest, and you may find a link to the solution code there (as well as in this solution) in case you are interested.
Remove all the words that end with "ain"
Most nonzero elements in row
surface of a spherical planet
the fly, the train, the second train, and their Zeno's paradox
PONG 002: Rectangle, Interactive Download, Easier Play
Maximize Non-Co-Planar Points in an N-Cube
Unique: Enhanced Performance - Avoiding Memory Crash
Genome Sequence 003: DNA Sequence with random positioned segments
Spherical radius given four points
Find the treasures in MATLAB Central and discover how the community can help you!
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office