FZU 2282 K - Wand (费马小定理乘法逆元求组合数取模 + 交错排列数)

最新推荐文章于 2022-07-14 21:16:16 发布

Error Man

最新推荐文章于 2022-07-14 21:16:16 发布

阅读量261

点赞数

分类专栏： # 组合数

本文链接：https://blog.csdn.net/no_O_ac/article/details/81873504

版权

组合数专栏收录该内容

5 篇文章 0 订阅

订阅专栏

K - Wand

N wizards are attending a meeting. Everyone has his own magic wand. N magic wands was put in a line, numbered from 1 to n(Wand_i owned by wizard_i). After the meeting, n wizards will take a wand one by one in the order of 1 to n. A boring wizard decided to reorder the wands. He is wondering how many ways to reorder the wands so that at least k wizards can get his own wand.

For example, n=3. Initially, the wands are w1 w2 w3. After reordering, the wands become w2 w1 w3. So, wizard 1 will take w2, wizard 2 will take w1, wizard 3 will take w3, only wizard 3 get his own wand.

Input

First line contains an integer T (1 ≤ T ≤ 10), represents there are T test cases.

For each test case: Two number n and k.

1<=n <=10000.1<=k<=100. k<=n.

Output

For each test case, output the answer mod 1000000007(10^9 + 7).

Sample Input

2
1 1
3 1

Sample Output

1
4

题意：给定两个整数 n 和 k, 代表有 n 个人，每个人有一根相应的棍子，求至少 k 个人得到相应棍子的方案数

思路：这个结果很明显，答案是 $\sum_{k}^{n}$ C(n,k) * a[n - k] , 其中 a[n - k] 表示 n - k 个人都拿不到相应棍子的方案数。关于 a 这个数组，有结论

a[1]=0
a[2]=1
a[n]=(n-1)*(a[n-1]+a[n-2])

所以这个题就变成了板子题。。先暴力出 1e4 的所有阶乘取模，然后利用费马小定理求出 C，在乘上相应的 a 求和再加1 即是答案。为什要加1，因为最后 k 达到 n 的时候 a[1] == 0, 但是这情况是成立的。；

AC代码：

#include<cstdio>
using namespace std;

typedef long long LL;
const LL maxn = 1e4 + 100,mod = 1e9 + 7;

LL Jc[maxn];
LL a[maxn];

void calJc()    //求maxn以内的数的阶乘
{
    Jc[0] = Jc[1] = 1;
    for(LL i = 2; i < maxn; i++)
        Jc[i] = Jc[i - 1] * i % mod;
}

//费马小定理求逆元
LL pow(LL a, LL n, LL p)    //快速幂 a^n % p
{
    LL ans = 1;
    while(n)
    {
        if(n & 1)
            ans = ans * a % p;
        a = a * a % p;
        n >>= 1;
    }
    return ans;
}

LL niYuan(LL a, LL b)   //费马小定理求逆元
{
    return pow(a, b - 2, b);
}

LL C(LL a, LL b)    //计算C(a, b)
{
    return Jc[a] * niYuan(Jc[b], mod) % mod
           * niYuan(Jc[a - b], mod) % mod;
}

int main()
{
    int t; scanf("%d",&t);
    calJc();
    a[1] = 0; a[2] = 1;
    for(int i = 3;i < maxn;i ++){
        a[i] = ((i - 1) * (a[i-1] + a[i-2]) % mod) % mod;
    }
    while(t --){
        int n,k; scanf("%d%d",&n,&k);
        LL sum = 1;
        for(int i = k;i < n;i ++)
            sum = (sum % mod + ((C(n,i) % mod) * (a[n - i] % mod)) % mod) % mod;
        printf("%I64d\n",sum);
    }
    return 0;
}