Kortit II

#include<bits/stdc++.h>
using namespace std;
#define forn(i,n) for(int i=0;i<n;++i)
#define forN(i,k,n) for(int i=k;i<n;++i)
#define pb push_back
#define F first
#define S second
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
#define inf ((int)(1.01e9))
#define mod ((int)(1e9+7))
#define N ((int)(2002))

ll n, m, a, b, counter, facta[N];
vector<bool> comb;

ll fact(int n) {
    if (!facta[n])
        facta[n] = (fact(n-1)*n)%mod;
    return facta[n]; 
}

void solve() {
    cin >> n >> a >> b;
    if (n < a + b || ((!b)&&a) || ((!a)&&b)) {
        cout << "0\n";
        return;
    }

    if (a<b) swap(a,b);
    m = a + b;
    comb.resize(m);
    fill(comb.end()-a, comb.end(), 1);
    ll sumk=0;
    do {
        ll k = 1;
        int i = 1;
        forn(j,m) if (comb[j]) {
            //cout << j << ' ' << i << endl;
            k *= j+1 - i++;
        }
        sumk += k;
        sumk %= mod;
        //cout << k << endl << endl;
    } while (next_permutation(comb.begin(), comb.end()));

    cout << (sumk * fact(n))%mod << '\n';
}

int main() {
    cin.tie(0) -> sync_with_stdio(0);
    cout.tie(0);
    facta[0] = facta[1] = 1;

    int t;
    cin >> t;
    while(t--) solve();
}

Test 1

Group: 1, 2, 3, 4, 5

Verdict: WRONG ANSWER

Test 2

Group: 2, 3, 4, 5

Verdict: WRONG ANSWER

Test 3

Group: 3, 4, 5

Verdict: WRONG ANSWER

Test 4

Group: 4, 5

Verdict: TIME LIMIT EXCEEDED

Test 5

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 6

Group: 5

Verdict: TIME LIMIT EXCEEDED