mirror of
https://git.sb/baoshuo/OI-codes.git
synced 2024-12-24 18:31:59 +00:00
P1866 编号
R52232232
This commit is contained in:
parent
4fbd999f3a
commit
e7613a7db1
20
Luogu/problem/P1866/P1866.cpp
Normal file
20
Luogu/problem/P1866/P1866.cpp
Normal file
@ -0,0 +1,20 @@
|
|||||||
|
#include <bits/stdc++.h>
|
||||||
|
|
||||||
|
using namespace std;
|
||||||
|
|
||||||
|
int n, a[55];
|
||||||
|
long long ans = 1;
|
||||||
|
|
||||||
|
int main() {
|
||||||
|
cin >> n;
|
||||||
|
for (int i = 1; i <= n; i++) {
|
||||||
|
cin >> a[i];
|
||||||
|
}
|
||||||
|
sort(a + 1, a + n + 1);
|
||||||
|
for (int i = 1; i <= n; i++) {
|
||||||
|
ans *= a[i] - i + 1;
|
||||||
|
ans %= 1000000007;
|
||||||
|
}
|
||||||
|
cout << ans << endl;
|
||||||
|
return 0;
|
||||||
|
}
|
Loading…
Reference in New Issue
Block a user