骨牌覆盖的已有研究
摘要：
Problem： Count the ways to tile an MxN rectangle with 1x2 dominos. Solve： The number of ways to tile an MxN rectangle with 1x2 dominos is 2^(M*N/2) times the product of { cos^2(m*pi/(M+1)) + cos^2(n... 阅读全文
posted @ 2008-10-09 13:15
光光GG
阅读(312)
评论(0)
推荐(0)
浙公网安备 33010602011771号