uva 11806 容斥原理

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;

const int MOD = 1000007;
const int MAX_K = 500;
int M, N, K;

int C[MAX_K+5][MAX_K+5];

void init(){
memset( C, 0, sizeof( C ) );
C[0][0] = 1;
for( int i = 1; i <= MAX_K; 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 main(){
int T, Case = 1;

init();

scanf( "%d", &T );
while( T-- ){
scanf( "%d%d%d", &N, &M, &K );
int sum = 0;
for( int S = 0; S < 16; S++ ){
int r = M, c = N, temp = 0;
if( S & 1 ){ r--, temp++; }
if( S & 2 ){ r--, temp++; }
if( S & 4 ){ c--, temp++; }
if( S & 8 ){ c--, temp++; }
if( temp % 2 ){
sum = ( sum + MOD - C[r*c][K] ) % MOD;
}else{
sum = ( sum + C[r*c][K] ) % MOD;
}
}
printf( "Case %d: %d\n", Case++, sum );
}
return 0;
}