#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <queue>
#include <set>
#include <ctime>
#include <cstdlib>
using namespace std;
#define inf 0x3f3f3f3f
#define N 8020
#define M 1000020
#define LL long long
#define mod 1000000009
#define ls (i << 1)
#define rs (ls | 1)
#define md (ll + rr >> 1)
#define lson ll, md, ls
#define rson md + 1, rr, rs
#define B 350
int C[N][N];
int f[N];
void init() {
for(int i = 0; i < N; ++i) {
C[i][0] = C[i][i] = 1;
for(int j = 1; j < i; ++j) {
C[i][j] = C[i-1][j-1] + C[i-1][j];
if(C[i][j] >= mod) C[i][j] -= mod;
}
}
f[0] = 1;
for(int i = 1; i < N; ++i) f[i] = 1LL * f[i-1] * i % mod;
}
int n, w, b;
int main() {
init();
cin >> n >> w >> b;
int ans = 0;
for(int i = 1; i <= w - 1; ++i) {
ans += 1LL * C[w+b-3][n-3] * C[w][i] % mod * f[i] % mod * f[b] % mod * f[w-i] % mod;
if(ans >= mod) ans -= mod;
}
cout << ans << endl;
return 0;
}
Codeforces 306C White, Black and White Again (简单计数)
最新推荐文章于 2018-08-30 10:05:21 发布