This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main()
{
const long long mod=1000000007;
int n, l;
cin >> n >> l;
vector<int> a;
for(int i=0; i<n; i++)
{
int x;
cin >> x;
a.push_back(x);
}
sort(a.begin(), a.end());
long long kiek=0;
do
{
int sum=0;
for(int i=0; i<n-1; i++)
{
sum+=abs(a[i]-a[i+1]);
}
if(sum<=l)
{
kiek++;
kiek=kiek%mod;
}
}while(next_permutation(a.begin(), a.end()));
cout << kiek;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |