Kortit II

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef vector<int> vi;

#define F first
#define S second
#define PB push_back
#define MP make_pair
#define FOR(i,a,b) for (ll i = a; i < b; i++)

ll mod=1e9+7;
vector<vector<ll>> v = {
        {1, 0, 0, 0, 0, 0, 0, 0, 0, 0},
        {0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
        {0, 1, 0, 0, 0, 0, 0, 0, 0, 0},
        {0, 1, 1, 0, 0, 0, 0, 0, 0, 0},
        {0, 1, 7, 1, 0, 0, 0, 0, 0, 0},
        {0, 1, 21, 21, 1, 0, 0, 0, 0, 0},
        {0, 1, 51, 161, 51, 1, 0, 0, 0, 0},
        {0, 1, 113, 813, 813, 113, 1, 0, 0, 0},
        {0, 1, 239, 3361, 7631, 3361, 239, 1, 0, 0},
        {0, 1, 493, 12421, 53833, 53833, 12421, 493, 1, 0}};

ll pow(ll n) {
    ll f=1;
    FOR(i,1,n+1) {
        f = (f*i)%mod;
    }
    return f;
}


ll bin(ll n, ll k) {
    ll bin = pow(n)/(pow(k)*pow(n-k));
    return bin;
}

/*ll count(ll n, ll a) {
    vi v;
    ll tc=0, c=0;
    bool no = false;
    FOR(i,0,n) {
        v.push_back(i);
    }
    do {
        FOR(i,0,n) {
            if (v[i]==i) {
                no = true;
                break;
            }
            if (v[i]>i) {
                tc++;
            }
        }
        if (tc==a && !no) {
            c++;
        }
        no = false;
        tc=0;
    } while (next_permutation(v.begin(), v.end()));
    return c;
}*/

void f() {
    ll n, a, b, t, tm, jm, vm, r;
    cin >> n >> a >> b;
    t = n-a-b;
    tm = bin(n, t);
    jm = pow(n);
    vm = v[n-t][a];
    r=(tm*jm*vm)%(mod);
    cout << r << "\n";
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int t;
    cin >> t;
    FOR(i,0,t) {
        f();
    }
}

Test 1

Group: 1, 2, 3, 4, 5

Verdict: ACCEPTED

Test 2

Group: 2, 3, 4, 5

Verdict: RUNTIME ERROR

Test 3

Group: 3, 4, 5

Verdict: RUNTIME ERROR

Test 4

Group: 4, 5

Verdict: RUNTIME ERROR

Test 5

Group: 5

Verdict: RUNTIME ERROR

Test 6

Group: 5

Verdict: RUNTIME ERROR