[The 1000 point problem on SRM 209, Div I]
At some stage, the problem reduces to the following:
Given blocks of three square units, like below, which can be rotated in any manner, how many ways are there to fill a rectangular block of given size.
| x | x |
| x |
For example, for a block of 3x4, there are 4 ways of arranging these blocks. I am looking for a way to attack this problem, and not the actual solution. How do I go about finding the number of ways. There are so many ways that it could happen, and I do not see overlapping sub problems for a DP approach either.
Any insights are welcome.