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.
Project Euler: Problem 8, Find largest product in a large string of numbers
Multiply to the limit?
Wind outward from the center ...
Are all the three given point in the same line?
Extract Built In Functions and Toolbox Functions from String or Function Handle
Genome Sequence 003: DNA Sequence with random positioned segments
Tiles Contest: Perfect Solutions for Large Unique Tile Boards
Usage of mkdir and copyfile
Genome Sequence 003R: Sequence DNA of random positioned and flipped segments
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