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++)

void f() {
    int n, a, b;
    cin >> n >> a >> b;
    vi s;
    vector<vi> p;
    int c1=0, c2=0, c=0;
    FOR(i,1,n+1) {
        s.push_back(i);
    }
    sort(s.begin(), s.end());
    do {
        p.push_back(s);
    } while (next_permutation(s.begin(), s.end()));
    for (vi i : p) {
        for (vi j : p) {
            for (int k=0; k<n; k++) {
                if (i[k] > j[k]) {
                    c1++;
                }
                else if (i[k] < j[k]) {
                    c2++;
                }
                else {
                }
            }
            if (c1==a && c2==b) {
                c++;
            }
            c1 = 0;
            c2 = 0;
        }
    }
    cout << c << "\n";
}

int main() {
    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: TIME LIMIT EXCEEDED

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