1005 - Rooks [组合数学]

1005 - Rooks

PDF (English)

Statistics

Forum

Time Limit: 1 second(s)

Memory Limit: 32 MB

A rook is a piece used in the game of chess which is played on a board of square grids. A rook can only move vertically or horizontally from its current position and two rooks attack each other if one is on the path of the other. In the following figure, the dark squares represent the reachable locations for rook R₁ from its current position. The figure also shows that the rook R₁ and R₂ are in attacking positions where R₁ and R₃ are not. R₂ and R₃ are also in non-attacking positions.

Now, given two numbers n and k, your job is to determine the number of ways one can put k rooks on an n x n chessboard so that no two of them are in attacking positions.

Input

Input starts with an integer T (≤ 350), denoting the number of test cases.

Each case contains two integers n (1 ≤ n ≤ 30) and k (0 ≤ k ≤ n²).

Output

For each case, print the case number and total number of ways one can put the given number of rooks on a chessboard of the given size so that no two of them are in attacking positions. You may safely assume that this number will be less than 10¹⁷.

Sample Input	Output for Sample Input
8 1 1 2 1 3 1 4 1 4 2 4 3 4 4 4 5	Case 1: 1 Case 2: 4 Case 3: 9 Case 4: 16 Case 5: 72 Case 6: 96 Case 7: 24 Case 8: 0

 

---

PROBLEM SETTER: JANE ALAM JAN

这题我也不知道为什么LightOJ要放在动态规划分类里面。。姑且就当做组合数学来做了。。

题目的大概意思是，象棋里的车是可以横竖随便走的，那么给你n×n的棋盘，问你把k个车摆在这个棋盘上的不同种摆法有多少。

题目的意思很明确了，我们可以先将这n行中选出k行来，然后再在这n列中选出这k列来，这时候沿着这k×k的棋盘的对角线摆下去，然后呢，再看这不同的排列有多少个，总结下来就是这样

C(n,k)*C(n,k)*A(k,k)

也就是C(n,k)*A(n,k)

其中C(n,k)和A(n,k)都是可以在线性的时间里求出来的

代码：

#include <cstdio>
using namespace std;
typedef long long LL;

int T;
int n,k;

int main(){
    scanf("%d",&T);
    for(int t=1;t<=T;t++){
        scanf("%d%d",&n,&k);
        LL c = 1;
        // 这里是线性的求组合数  公式是C(n,k) = C(n,k-1)*(n-k+1)/k 递推出来
        for(int i=1;i<=k;i++){
            c = c * (n-i+1)/i;
        }
        LL a = 1;
        // 这里是线性的求A(n,k)
        for(int i=0;i<k;i++){
            a = a*(n-i);
        }
        // LightOJ要用lld
        printf("Case %d: %lld\n",t,c*a);
    }
    return 0;
}