UVA11806 Cheerleaders --- 容斥原理

#include <cstdio>
#include <cstring>
#define MAXK 500
#define MOD 1000007
using namespace std;
int m,n,k;
int C[600][600];

int main() {
    memset(C,0,sizeof(C));
    C[0][0] = 1;
    for(int i = 1;i <= MAXK;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;
        }
    }
    int T;
    scanf("%d",&T);
    for(int kase = 1;kase <= T;kase++) {
        scanf("%d%d%d",&n,&m,&k);
        int sum= 0;
        for(int s = 0;s < (1<<4);s++) {
            int b = 0,r = n,c = m;
            if(s&(1)) {b++;r--;}
            if(s&(1<<1)) {b++;r--;}
            if(s&(1<<2)) {b++;c--;}
            if(s&(1<<3)) {b++;c--;}
            if(b&1) sum = (sum - C[r*c][k] + MOD) % MOD;
            else sum = (sum + C[r*c][k]) % MOD;
        }
        printf("Case %d: %d\n",kase,sum);
    }

    return 0;
}