A Rook Problem

View as PDF

Submit solution

All submissions

Best submissions

Points: 10

Time limit: 1.0s

Memory limit: 64M

Author:

Ninjaclasher

Problem type

Junyi is an avid chess player. He would like to know how many ways it is possible to place $K$ ~K~ rooks on an $N \times N$ ~N \times N~ chessboard such that no rook are in an attacking position.

A rook can only move horizontally and vertically from its current position and two rooks are in an attacking position if one is on the path of the other.

Input Specification

The first line will contain two integers $N, K$ ~N, K~ $(1 \le N \le 10, 1 \le K \le N^2)$ ~(1 \le N \le 10, 1 \le K \le N^2)~.

Output Specification

The number of ways to place $K$ ~K~ rooks on an $N \times N$ ~N \times N~ chessboard such that no rooks are in an attacking position.

Sample Input

4 4

Sample Output

Comments

-6

Dmoj commented on Dec. 9, 2019, 10:48 p.m.

Seems more like a 7 pointer, but I ain't complaining for the free 10 points.

This comment is hidden due to too much negative feedback. Show it anyway.