Submission
# | When | Author | Problem | Language | CPU | Memory | |
---|---|---|---|---|---|---|---|
21051 | 2024-09-13 21:27:58 | MU_INTRA_TEAM_01 | Beautiful Triangle | C++ 17 | 128 ms | 3544 kb | Accepted |
Source Code
#include <bits/stdc++.h> using namespace std; #define endl '\n'; #define ll long long ll ncr(ll n, ll r){ if(n == r) return 1; ll top = (n) * (n - 1) * (n - 2); ll ans = top / 6; return ans; } void solve() { ll n; cin >> n; map<ll, ll> mp; for(ll i = 0; i < n; i++){ ll temp; cin >> temp; mp[temp]++; } ll ans = 0; for(auto a: mp){ if(a.second >= 3){ ans += ncr(a.second, 3); } } cout << ans << endl; } int main() { ios::sync_with_stdio(0); cin.tie(0); int tc = 1; cin >> tc; //cout << ncr(10000, 3) << endl; while(tc--){ solve(); } }