How to effectively find the number of ways to cover the n * m matrix with 2x2 , 1x2 , 2x1 rectangles so that all cells are occupied and the rectangles do not intersect?
nata nata
sixteen one
- Similar things were considered by Knut in Volume 4 of the Art of Programming, but don’t ask anything like that ... - Harry
- You can brute force, you can dynamic programming ("dynamics of the profile"), but in general very much depends on the task. If this is a challenge from the competition, please provide a link to the full condition (with all restrictions and so on). - yeputons
|