UVA 11481 Arrange the Numbers (容斥)

思路：我们能用容斥来做的...代码很短，具体可以看代码。

代码：

#include <iostream>
#include <vector>
#include <algorithm>
#include <string.h>
#include <cstring>
#include <stdio.h>
#include <cmath>
#include <math.h>
#define rep(i,a,b) for(int i=(a);i<(b);++i)
#define rrep(i,b,a) for(int i = (b); i >= (a); --i)
#define clr(a,x) memset(a,(x),sizeof(a))
#define LL long long
#define eps 1e-10
using namespace std;
const int maxn = 1000 + 5;
const int mod = 1e9 + 7;
LL C[maxn][maxn];
LL A[maxn];

void pre_init()
{
    A[0] = 1;
    rep(i,1,maxn) A[i] = A[i-1] * i % mod;

    rep(i,0,maxn) {
        C[i][0] = 1;
        rep(j,1,i+1) C[i][j] = (C[i-1][j] + C[i-1][j-1]) % mod;
    }
}

int main()
{
    //Getinput();return 0;
    #ifdef ACM
        freopen("in.txt", "r", stdin);
       // freopen("out.txt","w",stdout);
    #endif // ACM
    pre_init();
    int T; cin >> T;
    rep(cas,1,T+1) {
        int N, M, K; scanf("%d%d%d",&N,&M,&K);
        printf("Case %d: ",cas);
        LL ans = A[N-K];
        rep(i,1,M-K+1) {
            if (i & 1) ans -= C[M-K][i] * A[N-K-i] % mod;
            else ans += C[M-K][i] * A[N-K-i] % mod;
            if (ans < 0) ans += mod;
            if (ans >= mod) ans -= mod;
        }
        ans = ans * C[M][K] % mod;
        printf("%lld\n",ans);
    }
}