# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
857469 | 2023-10-06T09:02:28 Z | lbadea1000 | W (RMI18_w) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; const int NMAX = 3e5 + 5; int v[NMAX]; int main() { int n; cin >> n; for(int i = 0; i < n; i++) cin >> v[i]; sort(v, v + n); int cnt1 = 0; int i = 0; while(i < n && v[i] == v[0]) { i++; cnt1++; } int cnt2 = 0; while(i < n && v[i] == v[n - 1]) { i++; cnt2++; } cout << 1LL * (cnt2 - 2) * (cnt2 - 1) / 2 % MOD * (cnt1 - 1) % MOD; return 0; }