Kortit II

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define N 2123
#define M 1000000007
 
int t,p[N],ncr[N][N],F[N];
 
int main(){
	cin.tie(0)->sync_with_stdio(0);
	for(int i=0;i<=2000;++i) ncr[i][0]=ncr[i][i]=1;
	for(int i=1;i<=2000;++i){
		for(int j=1;j<=2000;++j){
			ncr[i][j]=ncr[i-1][j-1]+ncr[i-1][j];
		}
	}
	for(int i=0;i<2000;++i) p[i]=i;
	F[0]=1;
	for(int i=1;i<=2000;++i) F[i]=i*F[i-1];
 
	cin>>t;
	while(t--){
		int n,a,b;
		cin>>n>>a>>b;
		ll r=0;
		do{
			int A=0,B=0;
			for(int i=0;i<n;++i){
				if(p[i]<i) ++A;
				else if(p[i]>i) ++B;
			}
			if(A==a&&B==b) ++r;
		} while(next_permutation(p,p+n));
		r*=F[n];
		r%=M;
		cout<<r<<'\n';
	}
}

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: TIME LIMIT EXCEEDED

Test 4

Group: 4, 5

Verdict: TIME LIMIT EXCEEDED

Test 5

Group: 5

Verdict: TIME LIMIT EXCEEDED

Test 6

Group: 5

Verdict: TIME LIMIT EXCEEDED