Light OJ 1095 Arrange the Numbers （容斥）

解析：

先从前M个中取出K个，剩下的所有的排列个数为(n-k)!;

然后剩下的M-K中取出1个放在其初始位置，剩下的排列个数为(n-k-1)!;

............

最后容斥原理求解便是。

[code]:

#include<cstdio>
#include<cstring>
#include<cmath>
#include<cstdlib>
#include<algorithm>

using namespace std;
typedef long long LL;
const int maxn = 1005;
const LL MOD = 1e9+7;

int n,m,k;
LL C[1005][1005],dp[1005],Mul[1005];

void init(){
    int i,j;
    C[0][0] = 1;Mul[0] = 1;
    for(i = 1;i < maxn;i++){
        C[i][0] = C[i][i] = 1;
        Mul[i] = (i*Mul[i-1])%MOD;
        for(j = 1;j < i;j++) C[i][j] = (C[i-1][j-1]+C[i-1][j])%MOD;
    }
}
LL solve(){
    int i,j;
    LL ans = 0;
    for(i = 0;i <= m-k;i++){
        if(i&1) ans = ((ans-C[m-k][i]*Mul[n-k-i])%MOD+MOD)%MOD;
        else  ans = ((ans+C[m-k][i]*Mul[n-k-i])%MOD+MOD)%MOD;
    }
    ans = (ans*C[m][k])%MOD;
    return ans;
}
int main(){
    int i,j,cas,T;
    scanf("%d",&cas);
    init();
    for(T = 1;T <= cas;T++){
        scanf("%d%d%d",&n,&m,&k);
        printf("Case %d: ",T);
        printf("%lld\n",solve());
    }

    return 0;
}