UVA - 11806 Cheerleaders 容斥+二进制枚举

#include<iostream>
#include<algorithm>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<map>

using namespace std;
const int maxn = 500 + 7;
const int MOD = 1000007;
int c[maxn][maxn], T, n , m, k;

void init() {
    memset(c, 0, sizeof c);
    for(int i = 0; i < 500; ++i) {
        c[i][0] = c[i][i] = 1;
        for(int j = 1; j < i; ++j)
            c[i][j] = ( c[i-1][j] + c[i-1][j-1] ) % MOD;
    }
}

void solve() {
    int ans = 0;
    for(int i = 0; i < 16; ++i) {
        int cnt = 0, r = m, c_= n;
        if(i & 1) { r--; cnt++; }
        if(i & 2) { r--; cnt++; }
        if(i & 4) { c_--; cnt++; }
        if(i & 8) { c_--; cnt++; }
        if(cnt & 1)
            ans = (ans + MOD - c[r*c_][k]) % MOD;
        else
            ans = (ans + c[r*c_][k]) % MOD;
    }
    cout << ans << endl;
}

int main() {
    init();
    scanf("%d", &T);
    int kase = 1;
    while(T--) {
        scanf("%d%d%d", &m, &n, &k);
        printf("Case %d: ", kase++);
        solve();
    }
    return 0;
}