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, 0, 0},
        {0, 0, 0, 0, 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, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
        {0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
        {0, 1, 7, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
        {0, 1, 21, 21, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
        {0, 1, 51, 161, 51, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
        {0, 1, 113, 813, 813, 113, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
        {0, 1, 239, 3361, 7631, 3361, 239, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
        {0, 1, 493, 12421, 53833, 53833, 12421, 493, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
        {0, 1, 1003, 42865, 320107, 607009, 320107, 42865, 1003, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
        {0, 1, 2025, 141549, 1704693, 5494017, 5494017, 1704693, 141549, 2025, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
        {0, 1, 4071, 453905, 8422679, 42924113, 72605303, 42924113, 8422679, 453905, 4071, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
        {0, 1, 8165, 1426725, 39474449, 302458313, 802028813, 802028813, 302458313, 39474449, 1426725, 8165, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0},
        {0, 1, 16355, 4422913, 178065811, 1977056433, 7789852851, 12172272321, 7789852851, 1977056433, 178065811, 4422913, 16355, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0},
        {0, 1, 32737, 13579309, 780889437, 12218582561, 68767041385, 158753132437, 158753132437, 68767041385, 12218582561, 780889437, 13579309, 32737, 1, 0, 0, 0, 0, 0, 0, 0, 0},
        {0, 1, 65503, 41408833, 3352853151, 72353683777, 564443920415, 1847023092289, 2722634203807, 1847023092289, 564443920415, 72353683777, 3352853151, 41408833, 65503, 1, 0, 0, 0, 0, 0, 0, 0},
        {0, 1, 131037, 125667333, 14166996377, 414496887689, 4378051365013, 19673873512333, 40944331580049, 40944331580049, 19673873512333, 4378051365013, 414496887689, 14166996377, 125667333, 131037, 1, 0, 0, 0, 0, 0, 0},
        {0, 1, 262107, 380081105, 59131278331, 2313653894913, 32472283466555, 195471226248529, 555692780332635, 783282749905601, 555692780332635, 195471226248529, 32472283466555, 2313653894913, 59131278331, 380081105, 262107, 1, 0, 0, 0, 0, 0},
        {0, 1, 524249, 1146795693, 244488341893, 12651113305985, 232372145411601, 1836770909908597, 6949855454616893, 13343470520917641, 13343470520917641, 6949855454616893, 1836770909908597, 232372145411601, 12651113305985, 244488341893, 1146795693, 524249, 1, 0, 0, 0, 0},
        {0, 1, 1048535, 3454279345, 1003523639655, 68046385946609, 1615307882756743, 16495207645575537, 81354047854560359, 207097807515364657, 281751782666559239, 207097807515364657, 81354047854560359, 16495207645575537, 1615307882756743, 68046385946609, 1003523639655, 3454279345, 1048535, 1, 0, 0, 0},
        {0, 1, 2097109, 10392196645, 4095753221345, 361178074805385, 10965565351859293, 142728206785855181, 902005500427136793, 2979125950985344081, 5362463119752956437, 5362463119752956437, 2979125950985344081, 902005500427136793, 142728206785855181, 10965565351859293, 361178074805385, 4095753221345, 10392196645, 2097109, 1, 0, 0},
        {0, 1, 4194259, 31238454241, 16642612291235, 1896592175222545, 73001215412920707, 1197502393316767265, -8886105814733398461, 3353151921947539345, 1489476198628593059, -5236232445404075679, 1489476198628593059, 3353151921947539345, -8886105814733398461, 1197502393316767265, 73001215412920707, 1896592175222545, 16642612291235, 31238454241, 4194259, 1, 0}};

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

ll bin(ll n, ll k) {
    ll bin = (fac(n)%mod/(fac(k)%mod*fac(n-k)%mod))%mod;
    return bin;
}

void f() {
    ll n, a, b, t, tm, jm, vm, r;
    cin >> n >> a >> b;
    t = n-a-b;
    if (t<0) {
        cout << 0 << "\n";
        return;
    }
    tm = bin(n, t);
    jm = fac(n);
    vm = v[n-t][a]%mod;
    r=((tm%mod*jm%mod)%mod*vm%mod)%(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: ACCEPTED

Test 3

Group: 3, 4, 5

Verdict: WRONG ANSWER

Test 4

Group: 4, 5

Verdict: RUNTIME ERROR

Test 5

Group: 5

Verdict: RUNTIME ERROR

Test 6

Group: 5

Verdict: RUNTIME ERROR