简单数论题(模的运算)
#include<iostream>
#include<algorithm>
using namespace std;
const int N = 100, M = 1e9 + 7;
int n, a[N];
long long sum = 1;
int cnt;
int main() {
cin >> n;
for (int i = 0; i < n; i++) cin >> a[i];
sort(a, a + n);
for (int i = 0; i < n; i++) {
sum *= (a[i]-cnt++) ;
sum%=M;
}
cout << sum ;
return 0;
}