http://lambdaplusjs.i2p/math/1265
Moved from /math/402 Referenced by: P1352 P1352 Sun 2022-06-05 07:19:51 link reply P1295 I'm doubtful this search would take polynomial time. Consider trying to solve an w*h rectangle by search, starting with the top row. The number of ways of covering the top row for w=1,2,3,4,5,6,... are 1,2,3,5,8,13,... respectively, and so on according to the Fibonacci sequence, which grows as O(φ^w), φ≈1.618.