light oj 1005 Rooks(组合数)

最新推荐文章于 2021-12-31 18:00:00 发布

hzasrd

最新推荐文章于 2021-12-31 18:00:00 发布

阅读量286

点赞数

分类专栏： Lightoj

本文链接：https://blog.csdn.net/zs120197/article/details/77449981

版权

Lightoj 专栏收录该内容

18 篇文章 0 订阅

订阅专栏

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

1 1

2 1

3 1

4 1

4 2

4 3

4 4

4 5

Sample Output

Case 1: 1

Case 2: 4

Case 3: 9

Case 4: 16

Case 5: 72

Case 6: 96

Case 7: 24

Case 8: 0

题意：给你一个n*n的棋盘和k个车，要求将k个车全部放在棋盘中，使得每两个车不能互相攻击，问有多少种放法。

一眼想到搜索，就写了一发，T了，搜索通不过。然后感觉有规律，就手推了下规律，发现方案数是个组合数，即总共的方案数为 C(n,k)*C(n,k)*k！。后来又优化了下公式，发现其实是C(n,k)*A(n,k)。

坑点：当k等于0的时候，方案数为1，当k>n时，方案数为0。

下面贴上超时的代码：

#include <bits/stdc++.h>
#define N 500
using namespace std;
typedef long long ll;
ll sum;
int rol[50],row[50];
int t,n,k;

void dfs(int l,int step)
{
    if(step==k+1)
    {
        sum++;
        return;
    }
    for(int i=l; i<=n; i++)
        for(int j=1; j<=n; j++)
        {
            if(rol[i]==0&&row[j]==0)
            {
                rol[i]=row[j]=1;
                dfs(i,step+1);
                rol[i]=row[j]=0;
            }
        }
    return;
}

int main()
{
    cin>>t;
    for(int cas=1; cas<=t; cas++)
    {
        cin>>n>>k;
        sum=0;
        memset(rol,0,sizeof(rol));
        memset(row,0,sizeof(row));
        dfs(1,1);
        cout<<"Case "<<cas<<": "<<sum<<endl;
    }
    return 0;
}

没优化前的组合数代码：

#include <bits/stdc++.h>
#define N 500
using namespace std;
typedef long long ll;

ll dp[50][50],a[50][50];

void init()
{
    for(int i=1; i<=35; i++)
        a[i][1]=i;
    for(int i=1; i<=35; i++)
        for(int j=1; j<=i; j++)
            a[i][j+1]=a[i][j]*(i-j)/(j+1);//求C(n,k)

    memset(dp,0,sizeof(dp));
    dp[0][0]=1;
    for(int i=1; i<=35; i++)
    {
         dp[i][i]=dp[i-1][i-1]*i;
         dp[i][0]=1;
    }

    for(int i=1; i<=35; i++)
        for(int j=1; j<=i; j++)
            dp[i][j]=a[i][j]*a[i][j]*dp[j][j];//C(n,k)*C(n,k)*k！
}

int main()
{
    init();
    int t,n,k;
    cin>>t;
    for(int cas=1;cas<=t;cas++)
    {
        cin>>n>>k;
        cout<<"Case "<<cas<<": "<<dp[n][k]<<endl;
    }
    return 0;
}

优化后的组合数代码：

#include <bits/stdc++.h>
#define N 500
using namespace std;
typedef long long ll;

ll dp[50][50];

void init()
{
    ll i,j;
    for(i=1; i<=35; i++)
        dp[i][1]=i*i,dp[i][0]=1;
    for(i=1; i<=35; i++)
        for(j=1; j<=i; j++)
            dp[i][j+1]=dp[i][j]*(i-j)/(j+1)*(i-j);//递推求解C(n,k)*A(n,k)
}

int main()
{
    init();
    int t,n,k;
    cin>>t;
    for(int cas=1;cas<=t;cas++)
    {
        cin>>n>>k;
        cout<<"Case "<<cas<<": "<<dp[n][k]<<endl;
    }
    return 0;
}