题目大意: 题目链接:http://poj.org/problem?id=2411 输出用 1 × 2 1\times2 1×2的骨牌覆盖 n × m n\times m n×m的棋盘的方案数。 思路: 很明显是一道DP题目。 状压DP,每一行肯定是0或1。可以把它转化成十进制,用 p [ i ] p[i] p[i]记录为 i i i的情况能否拼好。 最终答案为 f [ n ] [ 0
Mondriaan’s Dream Time Limit: 3000MS Memory Limit: 65536K Description Squares and rectangles fascinated the famous Dutch painter Piet Mondriaan. One night, after producing the drawings in his ‘toi
Description Squares and rectangles fascinated the famous Dutch painter Piet Mondriaan. One night, after producing the drawings in his ‘toilet series’ (where he had to use his toilet paper to draw on,
原文 原作者:zthgreat Mondriaan’s Dream Description Squares and rectangles fascinated the famous Dutch painter Piet Mondriaan. One night, after producing the drawings in his 'toilet series' (where