P1313 [NOIP2011 提高组] 计算系数

#include "cstdio"
#define N 1003
#define mod 10007
#define int long long
int a, b, k, n, m, f[N][N], A = 1, B = 1;
signed main() {
    scanf("%lld %lld %lld %lld %lld", &a, &b, &k, &n, &m);
    for (int i = 0; i <= k; i ++ )
        for (int j = 0; j <= i; j ++ )
            if (j == 0 || j == i)
                f[i][j] = 1;
            else
                f[i][j] = (f[i - 1][j - 1] + f[i - 1][j]) % mod;
    for (int i = 1; i <= n; i ++ ) A = A * a % mod;
    for (int i = 1; i <= m; i ++ ) B = B * b % mod;
    printf("%lld\n", (f[k][n] * A * B) % mod);
}