Kortit II

input/code.cpp: In function 'int main()':
input/code.cpp:26:13: warning: unused variable 'ffinal' [-Wunused-variable]
   26 |         int ffinal;
      |             ^~~~~~
input/code.cpp:27:13: warning: variable 'equal' set but not used [-Wunused-but-set-variable]
   27 |         int equal;
      |             ^~~~~
input/code.cpp:45:49: warning: array subscript 3 is above array bounds of 'int [3]' [-Warray-bounds]
   45 |                 if (d[i][2] == d[i][1] || d[i][3] == d[i][1] || d[i][2] + d[i][3] > d[i][1]) {
      |                                           ~~~~~~^
input/code.cpp:20:5: note: while referencing 'd'
   20 | int d[2005][3];
      |     ^
input/code.cpp:49:44: warning: array subscript 3 is above array bounds of 'int [3]' [-Warray-bounds]
   49 |                 if (d[i][2] == 0 and d[i][3] != 0) {
      |                                      ~~~~~~^
input/code.cpp:20:5: note: while referencing 'd'
   20 | int d[2005][3];
      |     ^
input/code.cpp:55:27: warning:...

#include <iostream>

using namespace std;

int f[2005][2005];

int funktio(int n, int c) {
	int u;
	if (c == 1) {
		return 1;
	}
	else {
		u = c * funktio(n - 1, c) + (n - c) * funktio(n - 1, c - 1) + (n - 1) * funktio(n - 2, c - 1);
		f[n][c] = u;
	}
	return u;
}

int fac[2005];
int d[2005][3];

int main() {
	fac[1] = 1;
	int p = 1e9 + 7;
	int final;
	int ffinal;
	int equal;
	for (int i = 1; i <= 2000; i++) {
		f[i][1] = 1;
	}
	for (int i = 2; i <= 2000; i++) {
		fac[i] = (i * fac[i - 1]) % p;
	}
	int t;
	cin >> t;
	int pass = 0;
	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][1] || d[i][3] == d[i][1] || d[i][2] + d[i][3] > d[i][1]) {
			cout << 0 << "\n";
			pass = 1;
		}
		if (d[i][2] == 0 and d[i][3] != 0) {
			if (pass == 0) {
				cout << 0 << "\n";
				pass = 2;
			}
		}
		if (d[i][3] == 0 and d[i][2] != 0) {
			if (pass == 0) {
				cout << 0 << "\n";
				pass = 3;
			}
		}
		if (pass == 0) {
			equal = d[i][1] - d[i][2] - d[i][3];
			final = funktio(d[i][2] + d[i][3], d[i][2]);
			cout << final;
			}
		pass = 0;
		}
	}

Test 1

Group: 1, 2, 3, 4, 5

Verdict: RUNTIME ERROR

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