Logo
(追記) (追記ここまで)

7396번 - Lattice Animals 다국어

시간 제한메모리 제한제출정답맞힌 사람정답 비율
2 초 128 MB21161381.250%

문제

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 \times 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ドル \times 4$ rectangle and 3 different octominoes (8-polyominoes) that fit into 3ドル \times 3$ rectangle.

입력

The input file consists of a single line with 3 integer numbers $n,ドル $w,ドル and $h$ (1ドル \le n \le 10,ドル 1ドル \le w, h \le n$).

출력

Write to the output file a single integer number --- the number of distinct free $n$-polyominoes that fit into rectangle $w \times h$.

제한

예제 입력 1

5 1 4

예제 출력 1

0

예제 입력 2

5 2 4

예제 출력 2

5

예제 입력 3

5 3 4

예제 출력 3

11

예제 입력 4

5 5 5

예제 출력 4

12

예제 입력 5

8 3 3

예제 출력 5

3

힌트

출처

ICPC > Regionals > Northern Eurasia > Northern Eurasia Finals > NEERC 2004 L번

(追記) (追記ここまで)

출처

대학교 대회

  • 사업자 등록 번호: 541-88-00682
  • 대표자명: 최백준
  • 주소: 서울시 서초구 서초대로74길 29 서초파라곤 412호
  • 전화번호: 02-521-0487 (이메일로 연락 주세요)
  • 이메일: contacts@startlink.io
  • 통신판매신고번호: 제 2017-서울서초-2193 호

AltStyle によって変換されたページ (->オリジナル) /