АВТ
Язык:

Дистанционный практикум по программированию

Задачи On-line статус ЧаВо Турниры
Для авторов:
 
Здравствуйте, Гость! Войдите с паролем или зарегистрируйтесь.

54. Клетка с животными

Ограничение времени: 2 секунды
Ограничение памяти:64000КБ
Баллы:10
Статистика Послать на проверку Задачу добавил Administrator

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 wxh. 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 2x4 rectangle and 3 different octominoes (8-polyominoes) that fit into 3x3 rectangle.

Исходные данные

The input file consists of a single line with 3 integer numbers n, w, and h (1<=n<=10, 1<=w,h<=n).

Результат

Write to the output file a single integer number - the number of distinct free n-polyominoes that fit into rectangle wxh.

Примеры

Исходные данныеРезультат
5 1 40
5 2 45
5 3 411
5 5 512
8 3 33

Статистика Послать на проверку Автор/источник:
Задачи с соревнований / Чемпионат ACM / NEERC-2004 /
53. K - Королевство магии 54.
 
время генерации 0.063 сек.
© Copyright ВоГТУ, АВТ, Носов Д.А.