当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

2170:Lattice Animals

题目描述
Lattice animal is a set of connected sites on a lattice. Lattice animals on a square lattice are especially popular subject of study and are also known as polyominoes. Polyomino is usually represented as a set of sidewise connected squares. Polyomino with n squares is called n-polyomino.
In this problem you are to find a number of distinct free n-polyominoes that fit into rectangle w*h. Free polyominoes can be rotated and flipped over, so that their rotations and mirror images are considered to be the same.
For example, there are 5 different pentominoes (5-polyominoes) that fit into 2*4 rectangle and 3 different octominoes (8-polyominoes) that fit into 3 * 3 rectangle.
输入解释
The input consists of a single line with 3 integer numbers n, w, and h (1 <= n <= 10, 1 <= w, h <= n).
输出解释
Write to the output a single integer number -- the number of distinct free n-polyominoes that fit into rectangle w * h.
输入样例
5 5 5
输出样例
12

该题目是Virtual Judge题目,来自 北京大学POJ

源链接: POJ-2170

最后修改于 2020-10-29T06:25:24+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
5000 65536