Järjestys

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

const ll mod=1e9+7;

void solve(){
	int n,x;
	cin>>n>>x;
	vector<int> a(n);
	for (int i=0;i<n;i++){
		cin>>a[i];
	}
	sort(a.begin(), a.end());
	ll ans=1;
	for (int i=0;i<n;i++){
		ll pos=1;
		for (int j=0;j<i;j++){
			if (a[i]-a[j]<=x){
				pos++;
			}
		}
		ans*=pos;
		ans%=mod;
	}
	cout<<ans<<endl;
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int tcs;
	cin>>tcs;
	for (int t=0;t<tcs;t++){
		solve();
	}
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 2

Verdict: ACCEPTED