Pavers

From programming_contest

Revision as of 23:05, 27 December 2017 by imported>Kmk21 (Created page with "This problem asks us the number of ways we can tile a 2xN grid with up to 3-ominos. This is a pretty common/standard DP problem that's given away by the fact that one of the...")

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to navigation Jump to search

This problem asks us the number of ways we can tile a 2xN grid with up to 3-ominos.

This is a pretty common/standard DP problem that's given away by the fact that one of the dimensions is fixed and small. See Tray Bien For more details. In this case we have only 4 possible fronts instead of the 8 listed there.

Retrieved from "https://wiki.speedyguy17.info/index.php?title=Pavers&oldid=1099"