Järjestys

#include<bits/stdc++.h>
using namespace std;
using lint = long long;
const int MAXN = 105;
const lint mod = 1e9 + 7;
 
int a[MAXN];
 
int main(){
	int tc;
	cin >> tc;
	while(tc--){
		int n, x;
		cin >> n >> x;
		for(int i=1; i<=n; ++i){
			cin >> a[i];
		}
		sort(a + 1, a + 1 + n);
		lint ans = 1;
		for(int i=1; i<=n; ++i){
			int j=i;
			while(j - 1 && a[i] - a[j - 1] <= x) --j;
			ans *= i - j + 1;
			ans %= mod;
		}
		cout << ans << '\n';
	}
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 2

Verdict: ACCEPTED