Kortit II

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

const int N=109;
const int MOD=1000000007;
int deck[N],deck2[N];

int C(int m,int n){
	int res=1;
	for(int i=1,j=m;i<=m-n;i++,j--){
		res*=j;
		res/=i;
		res%=MOD;
	}
	return res;
}
int A(int m,int n){
	int res=1;
	for(int i=n;i>n-m;i--){
		res*=i;
		res%=MOD;
	}
	return res;
}

void query(int n,int a,int b){
	int c=a+b;
	int d=n-c;
	int ans=1;
	ans*=C(n,d);ans%=MOD;
	ans*=C(c+1,d);ans%=MOD;
	ans*=A(d,d);ans%=MOD;
	ans*=A(c,c);ans%=MOD;
	cout<<ans<<endl;
}

int main(){
	int Q;
	cin>>Q;
	while(Q--){
		int n,a,b;
		cin>>n>>a>>b;
		query(n,a,b);
	}
	return 0;
}

Test 1

Group: 1, 2, 3, 4, 5

Verdict: WRONG ANSWER

Test 2

Group: 2, 3, 4, 5

Verdict: WRONG ANSWER

Test 3

Group: 3, 4, 5

Verdict: WRONG ANSWER

Test 4

Group: 4, 5

Verdict: WRONG ANSWER

Test 5

Group: 5

Verdict: WRONG ANSWER

Test 6

Group: 5

Verdict: WRONG ANSWER