Kortit II

#include <bits/stdc++.h>
 
#define F0R(n) for (int i=0; i<n; i++)
#define FOR(i, from, to) for (i = from; i < to; i++)
#define R0F(n) for (int i = n; i>=0; --i)
#define ROF(from, to) for (int i = from; i >= to; --i)
 
#define ll long long
#define mod (ll) (1e9 + 7)
#define vll vector<ll>
using namespace std;
 
ll N = 2501;
 
vll fact_mod(2*N+2, 0);
void build_fact() {
    fact_mod[0] = 1ll;
    ll i;
    FOR (i, 1ll, 2*N+2)
        // fact_mod[i] = fact_mod[i-1]*i;
        (fact_mod[i] = fact_mod[i-1]*i) %= mod;
}
 
ll nCr(ll n, ll k) {
    if (k <= 0) return 1ll;
    ll ans = 1ll, i;
    FOR (i, n-k+1, n+1)
        ans *= i;
    FOR (i, 1, k+1)
        ans /= i;
 
    ans %= mod;
    return ans;
}
 
vector<vll> dp(N, vll(N, 0));
void build() {
    dp[0][0] = 1ll;
    ll a, b;
    FOR (a, 1, N) {
        FOR (b, 1, N) {
            (dp[a][b] = dp[a][b-1]*a) %= mod;
            (dp[a][b] += dp[a-1][b]*b) %= mod;
            (dp[a][b] += dp[a-1][b-1]*(a+b-1ll)) %= mod;
            // (dp[a][b] *= fact_mod[a+b]) %= mod;
        }
    }
}
 
void soln() {
    ll n, a, b, ans;
    cin >> n >> a >> b;
    if (a+b>n) {
        ans = 0;
        cout << ans << "\n";
        return;
    }
 
    ans = dp[a][b];
    ans *= nCr(n, a+b);
    ans %= mod;
    ans *= fact_mod[n];
    ans %= mod;
    cout << ans << "\n";
}
 
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
 
    build_fact();
    build();
 
    int tc;
    cin >> tc;
    while (tc--) soln();
    return 0;
}

Test 1

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

Test 2

Group: 2, 3, 4, 5

Verdict: ACCEPTED

Test 3

Group: 3, 4, 5

Verdict: ACCEPTED

Test 4

Group: 4, 5

Verdict: WRONG ANSWER

Test 5

Group: 5

Verdict: WRONG ANSWER

Test 6

Group: 5

Verdict: WRONG ANSWER