Ominous Omino: Difference between revisions
Jump to navigation
Jump to search
imported>Plg5 Created page with "=Introduction= https://code.google.com/codejam/contest/6224486/dashboard#s=p3 The problem asks if you can fit an Omino of X blocks into an R by C grid perfectly. An omino is..." |
imported>Plg5 No edit summary |
||
| Line 9: | Line 9: | ||
I'm not smart enough to tell you how to actually solve this problem. However, for the "small" case, the solutions can just be hardcoded. The small case limits X, R, and C to a max of 4. | I'm not smart enough to tell you how to actually solve this problem. However, for the "small" case, the solutions can just be hardcoded. The small case limits X, R, and C to a max of 4. | ||
==X is 1== | |||
The grid can always be filled by 1x1 blocks, no matter the grid size | |||
Revision as of 01:58, 25 April 2015
Introduction
https://code.google.com/codejam/contest/6224486/dashboard#s=p3
The problem asks if you can fit an Omino of X blocks into an R by C grid perfectly.
An omino is a "tetris-like" shape of blocks. You must determine if every type of X omino can be made to fit, using any combination of other X ominos
Solution
I'm not smart enough to tell you how to actually solve this problem. However, for the "small" case, the solutions can just be hardcoded. The small case limits X, R, and C to a max of 4.
X is 1
The grid can always be filled by 1x1 blocks, no matter the grid size