Problem 2036. Santa's Cards
This Challenge is inspired by the Packing Santa's Sleigh contest at kaggle that runs until January 26, 2014. Will Elfonso win another kaggle contest? The kaggle contest is a 3-D fitting/optimization.
This Challenge is to place Santa Cards in a minimum area given a board width(columns) and a set of N cards of (rows,columns). Cards can not be rotated.
Input: Card_Array, W ; Card_Array(N,2) and W=width of M array
Output: M ; An X by W array of values 0:N, 0 is unused space
Scoring: Number of rows required to place all cards
Example:
[2 2;3 3;1 2], 5
M
1 1 2 2 2 1 1 2 2 2 3 3 2 2 2
Scores a 3, number of rows
Contest Results: Alfonso put in a tremendous 40,000 point reduction in the last days and appeared unsurpassable. However, a pair of Polish Professors in Mathematics and Computer Science, Marek and Cygan, submitted an astounding further 34,000 point improvement for the win. Alfonso won the Matlab category prize.
Solution Stats
Problem Comments
-
1 Comment
and thanks for the heads-up :)
Solution Comments
Show commentsProblem Recent Solvers3
Suggested Problems
-
Find the sum of the elements in the "second" diagonal
1141 Solvers
-
512 Solvers
-
Choose the best fitting dominoes
206 Solvers
-
Given a window, how many subsets of a vector sum positive
850 Solvers
-
Matrix with different incremental runs
487 Solvers
More from this Author308
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!