Number of 0/1 colorings of a m X n rectangle which have no monochromatic subrectangles with both dimension greater than 1.

Posted by acbruptenda on Stack Overflow See other posts from Stack Overflow or by acbruptenda
Published on 2012-11-11T04:55:34Z Indexed on 2012/11/11 5:00 UTC
Read the original article Hit count: 223

Filed under:
|
|
|
|

A m x n rectangular matrix is give, and each cell is to be filled with 0/1 colour. I have to find number of colorings possible so that there is no monochromatic coloured (same colour) sub-rectangle whose both dimension is greater than 1 (eg - 2x2, 2x3,4x3)

I have found a slightly different version of it here

But they have said nothing about the algorithm. So, I am looking for an algorithm here !!

© Stack Overflow or respective owner

Related posts about c++

Related posts about algorithm