Kortit II

input/code.cpp: In function 'int main()':
input/code.cpp:51:37: warning: array subscript 3 is above array bounds of 'int [3]' [-Warray-bounds]
   51 |                 if (d[i][2] + d[i][3] > d[i][1]) {
      |                               ~~~~~~^
input/code.cpp:8:5: note: while referencing 'd'
    8 | int d[1050][3];
      |     ^
input/code.cpp:55:44: warning: array subscript 3 is above array bounds of 'int [3]' [-Warray-bounds]
   55 |                 if (d[i][2] == 0 and d[i][3] == 0) {
      |                                      ~~~~~~^
input/code.cpp:8:5: note: while referencing 'd'
    8 | int d[1050][3];
      |     ^
input/code.cpp:60:46: warning: array subscript 3 is above array bounds of 'int [3]' [-Warray-bounds]
   60 |                         ab = d[i][2] + d[i][3];
      |                                        ~~~~~~^
input/code.cpp:8:5: note: while referencing 'd'
    8 | int d[1050][3];
      |     ^
input/code.cpp:48:23: warning: array subscript 3 is above array bou...

#include <iostream>
using namespace std;

long long p = 1e9 + 7;
long long fact[2005];
long long bino[2005][2005];
long long f[2005][2005];
int d[1050][3];
int pass = 0;
long long final;
long long ab;
long long equali;
long long val1;
long long val2;
long long val3;

int main () {
	for (int i = 0; i <= 2004; i++) {
		bino[i][0] = 1;
		bino[i][i] = 1;
	}
	for (int i = 2; i <= 2004; i++) {
		for (int j = 1; j <= i - 1; j++) {
			bino[i][j] = (bino[i - 1][j - 1] + bino[i - 1][j])%p;
		}
	}
	fact[0] = 1;
	for (int i = 1; i <= 2004; i++) {
		fact[i] = (i * fact[i - 1]) % p;
	}
	for (int i = 1; i <= 2004; i++) {
		f[i][1] = 1;
		f[i][0] = 0;
		f[i][i] = 0;
	}
	for (int i = 3; i <= 2004; i++) {
		for (int j = 2; j <= i - 1; j++) {
			f[i][j] = (j * f[i - 1][j] + (i - j) * f[i - 1][j - 1] + (i - 1) * f[i - 2][j - 1])%p;
		}
	}
	int t;
	cin >> t;
	for (int i = 1; i <= t; i++) {
		int a, b, n;
		cin >> n >> a >> b;
		d[i][1] = n;
		d[i][2] = a;
		d[i][3] = b;
	}
	for (int i = 1; i <= t; i++) {
		if (d[i][2] + d[i][3] > d[i][1]) {
			cout << 0 << "\n";
			pass = 1;
		}
		if (d[i][2] == 0 and d[i][3] == 0) {
			cout << fact[d[i][1]] << "\n";
			pass = 2;
		}
		if (pass == 0) {
			ab = d[i][2] + d[i][3];
			equali = d[i][1] - d[i][2] - d[i][3];
			val1 = (bino[d[i][1]][equali] * bino[d[i][1]][equali]) % p;
			val2 = (fact[ab] * val1) % p;
			val3 = (val2 * fact[equali]) % p;
			final = (val3 * f[ab][d[i][2]]) % p;
			cout << final << "\n";
		}
		pass = 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: ACCEPTED

Test 5

Group: 5

Verdict: ACCEPTED

Test 6

Group: 5

Verdict: ACCEPTED