第八届福建省大学生程序设计竞赛 K.Wand【错排+组合数】

 Problem K Wand

Accept: 104    Submit: 709
Time Limit: 1000 mSec    Memory Limit : 262144 KB

 Problem Description

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个数字（1~N），问全排列中，有多少个方案，使得a【i】==i的个数大于等于k.

思路：

错排+组合数学。

设定Dp【i】表示错排的数量。

那么考虑dp转移方程，我们考虑最新加进来的这个数字i：

①如果他放在了位子k上，然后位子k上的这个数字放在了位子i上，那么对应取k个位子有（i-1）种方法，那么有：

Dp【i】=Dp【i-2】*（i-1）；

②如果他放在了位子k上，然后位子k上的这个数字没有放置在位子i上，同时位子k上的数字变成了一个新的问题，那么有：

Dp【i】=Dp【i-1】*（i-1）；

那么Ans=C（n，n-k）*Dp【n-k】即可；

Ac代码：

#include<stdio.h>
#include<string.h>
using namespace std;
#define LL long long int

const int N = 1e5 + 7;
const int MOD = 1e9+7;

/**********************************/

LL qmod(LL a,LL b) {
    LL res = 1ll;
    while(b) {
        if(b&1) res=res*a%MOD;
        b>>=1,a=a*a%MOD;
    }
    return res;
}
LL dp[N];

LL fac[N],inv[N];
void init() {
    fac[0]=1;
    for(LL i=1; i<N; i++) fac[i]=(fac[i-1]*i)%MOD;
    inv[N-1] = qmod(fac[N-1],MOD-2);
    for(LL i=N-2; i>=0; i--) inv[i]=(inv[i+1]*(i+1))%MOD;
}

LL C(int n,int m) {
    return fac[n]*inv[m]%MOD*inv[n-m]%MOD;
}

int main() {
    init();
    dp[0]=1;
    dp[1]=0;
    for(LL i=1; i<=10000; i++) {
        dp[i]=(i-1)*(dp[i-1]+dp[i-2]);
        dp[i]%=MOD;
    }
    int t;
    int n,kk;
    scanf("%d",&t);
    while(t--) {
        scanf("%d%d",&n,&kk);
        LL output=0;
        for(int k=kk; k<=n; k++) {
            output+=C(n,k)*dp[n-k]%MOD;
            output%=MOD;
        }
        printf("%I64d\n",output%MOD);

    }
    return 0;
}