Järjestys

#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
 
ll M = 1e9 + 7;
int a[1000000];
 
void testCase() {
    int n, x;
    cin >> n >> x;
    for (int i = 0; i < n; i++) cin >> a[i];
    sort(a,a+n);
    reverse(a,a+n);
    ll ans = 1;
    for (int i = 1; i < n; i++) {
        ll kohtia = 1;
        for (int j = 0; j < i; j++) {
            if (a[j]-a[i] <= x) kohtia++;
        }
        ans *= kohtia;
        ans %= M;
    }
    cout << ans << "\n";
}
 
int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    int t;
    cin >> t;
    for (int i = 0; i < t; i++) {
        testCase();
    }
}
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: ACCEPTED

Test 3

Group: 2

Verdict: ACCEPTED