QOJ.ac

QOJ

Time Limit: 1 s Memory Limit: 128 MB Total points: 100

#15151. No Kings

The problem was used in the following contests:

2005 四川省代表队选拔赛 (SCOI 2005) Day 1

AI Translation — This statement was translated using AI and may contain inaccuracies. Please refer to the original statement if in doubt.

Place $K$ kings on an $N \times N$ chessboard such that no two kings attack each other. How many ways are there to place them? A king can attack the squares adjacent to it in all 8 directions: up, down, left, right, and the four diagonals (top-left, bottom-left, top-right, bottom-right).

Input

The input consists of a single line containing two integers $N$ and $K$ ($1 \le N \le 9$, $0 \le K \le N \times N$).

Output

The number of ways to place the kings.

Examples

Input 1

3 2

Output 1

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0

No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
Do not submit duplicated issues.
Issues must be filed in English or Chinese only.

Active Issues 0

No issues in this category.

Closed/Resolved Issues 0

No issues in this category.