Language: C++

#pragma GCC optimize ("O3")
#include <iostream>
#include <iomanip>
#include <istream>
#include <ostream>
#include <sstream>
#include <iterator>
#include <vector>
#include <algorithm>
#include <queue>
#include <deque>
#include <list>
#include <stack>
#include <map>
#include <unordered_map>
#include <set>
#include <bitset>
#include <utility>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <string>
#include <ctime>
#include <cctype>
#include <cstdlib>
#define IINF 10e8
#define INF 1<<30
#define MOD 1000000007
#define mod 1000000007
#define REP(i, a, n) for (ll i = a; i < (ll)(n); i++)
#define REPE(i, a, n) for (ll i = a; i <= (ll)(n); i++)
#define Endl endl
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define mmax(x,y)(x>y?x:y)
#define mmin(x,y)(x<y?x:y)
#define chmax(x,y) x=mmax(x,y)
#define chmin(x,y) x=mmin(x,y)
#define all(x) (x).begin(),(x).end()
#define siz(x) (ll)(x).size()
#define PI acos(-1.0)
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;
typedef long double ld;
typedef pair<int,int>Pin;
typedef pair<ll,ll>Pll;
template<class T> using V=vector<T>;
long long GCD(long long a, long long b) {return b?GCD(b,a%b):a;}
long long LCM(long long a, long long b) {return a/GCD(a,b)*b;}
int dx[4]={-1,0,1,0};
int dy[4]={0,-1,0,1};
int ddx[8]={-1,0,1,0,1,1,-1,-1};
int ddy[8]={0,-1,0,1,1,-1,1,-1};
ll cmp(pair<ll,ll>a,pair<ll,ll> b){
        if(a.se!=b.se)
        return a.se<b.se;
        else
        return a.fi<b.fi;
}
//----------------------------------------------------------------------
const int MAX = 1010000;


long long fac[MAX], finv[MAX], inv[MAX];

// テーブルを作る前処理
void COMinit() {
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < MAX; i++){
        fac[i] = fac[i - 1] * i ;
        inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD;
        finv[i] = finv[i - 1] * inv[i] % MOD;
    }
}

// 二項係数計算
long long COM(int n, int k){
    return n*(n-1)/2;

//----------------------------------------------------------------------
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    //-------------------------------  
    //ll begin_time=clock();
    //-------------------------------
    ull n;cin>>n;
    vector<ull>a(n);
    map<ull,ull>m;
    for(ull i=0;i<n;i++){
        cin>>a[i];
        m[a[i]]++;
    }
    ull total=0;
    COMinit();
    for(ull i=1;i<=n;i++){
        if(m[i]>=2)
        total+=COM(m[i],2);
    }

    for(ull k=1;k<=n;k++){
        ull tmp=total;
        if(m[a[k-1]]>=2)
        tmp-=COM(m[a[k-1]],2);
        if(m[a[k-1]]>=3)
        tmp+=COM(m[a[k-1]]-1,2);
        cout<<tmp<<endl;
    }

    //-------------------------------  
    //ll end_time=clock();cout<<"time="<<end_time-begin_time<<"ms"<<endl;
    //-------------------------------
    return 0;
}
//----------------------------------------------------------------------


































Compiler output:
a.cc: In function 'long long int COM(int, int)':
a.cc:87:9: warning: empty parentheses were disambiguated as a function declaration [-Wvexing-parse]
   87 | int main(){
      |         ^~
a.cc:87:9: note: remove parentheses to default-initialize a variable
   87 | int main(){
      |         ^~
      |         --
a.cc:87:9: note: or replace parentheses with braces to value-initialize a variable
a.cc:87:11: error: a function-definition is not allowed here before '{' token
   87 | int main(){
      |           ^
a.cc:120:2: error: expected '}' at end of input
  120 | }
      |  ^
a.cc:83:28: note: to match this '{'
   83 | long long COM(int n, int k){
      |                            ^