#include <bits/stdc++.h>
using namespace std;
int main() {
int t;
cin>>t;
vector<long long int> v1;
vector<long long int> v2;
v1.push_back(1);
v2.push_back(1);
long long int mod = 1e9 + 7;
for(long long int i=1;i<1e6;i++)
{
// v1.push_back(v1[i-1]+1);
v2.push_back((v2[i-1]*(i+1))%mod);
}
while(t--)
{
int n;
cin>>n;
int a[n];
for(int i=0;i<n;i++)
{
cin>>a[i];
}
sort(a,a+n);
long long int ans=0;
for(int long long i=0;i<n;i++)
{
ans+=(v2[a[i]-1]%1000000007);
}
ans=ans%1000000007;
cout<<ans<<"\n";
}
return 0;
}
Preview:
downloadDownload PNG
downloadDownload JPEG
downloadDownload SVG
Tip: You can change the style, width & colours of the snippet with the inspect tool before clicking Download!
Click to optimize width for Twitter