Problem:
Score : 400 points

Problem Statement

We have N balls. The i-th ball has an integer A_i written on it.

For each k=1, 2, ..., N, solve the following problem and print the answer.

Find the number of ways to choose two distinct balls (disregarding order) from the N-1 balls other than the k-th ball so that the integers written on them are equal.

Constraints

3 \leq N \leq 2 \times 10^5

1 \leq A_i \leq N

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N
A_1 A_2 ... A_N

Output

For each k=1,2,...,N, print a line containing the answer.

Sample Input 1

5
1 1 2 1 2

Sample Output 1

2
2
3
2
3

Consider the case k=1 for example. The numbers written on the remaining balls are 1,2,1,2.

From these balls, there are two ways to choose two distinct balls so that the integers written on them are equal.

Thus, the answer for k=1 is 2.

Sample Input 2

4
1 2 3 4

Sample Output 2

0
0
0
0

No two balls have equal numbers written on them.

Sample Input 3

5
3 3 3 3 3

Sample Output 3

6
6
6
6
6

Any two balls have equal numbers written on them.

Sample Input 4

8
1 2 1 4 2 1 4 1

Sample Output 4

5
7
5
7
7
5
7
5

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Accepted)

import java.io.*;
import java.util.*;

public class Main {


    private  static void solver(InputReader sc, PrintWriter out) throws Exception {
      int  n = sc.nextInt();
      long arr[] = new long[n];
      HashMap<Long,Long> hm = new HashMap<>();
      for(int i=0; i<n; i++){
          long x = sc.nextLong();
          arr[i]= x;
          if(hm.containsKey(x)){
              long get =hm.get(x);
              ++get;
              hm.put(x,get);
          }else{
              hm.put(x,1L);
          }

      }
      long sum =0;
     for(Map.Entry<Long,Long> map : hm.entrySet()){
         if(map.getValue()==1){
             hm.put(map.getKey(),0L);
         }else{
             long z = map.getValue();
             sum += (z * (z-1))/2;
         }
     }
    /*// out.println(sum);
    // HashMap<Long,Long> fin = new HashMap<>();
        for(Map.Entry<Long,Long> map : hm.entrySet()){
            out.println(map.getKey()+" "+map.getValue());
        }
        out.println(sum);*/
        for(Map.Entry<Long,Long> map : hm.entrySet()){
            if(map.getValue()!=0) {
                long temp = sum;
                long val = map.getValue();
                //  out.println(val);
                long ans = (val * (val - 1)) / 2;
                temp -= ans;
                --val;
                ans = (val * (val - 1)) / 2;
                temp += ans;
                hm.put(map.getKey(), temp);
            }else
                hm.put(map.getKey(),sum);
        }
        for(int i=0; i<n; i++){
            if(hm.containsKey(arr[i])){
            long ans = hm.get(arr[i]);
             out.println(ans);
            }
            else
                out.println("0");
        }

    }

    public static void main(String[] args) throws Exception{
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        solver(in,out);
        out.close();
    }
    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }
        public long nextLong(){
            return Long.parseLong(next());
        }

        public long[] readLongArr(int n){
            long arr[] = new long[n];
            for(int i=0; i<n; i++){
                arr[i] = nextLong();
            }
            return arr;
        }
        public int[] readIntArr(int n){
            int arr[] = new int[n];
            for(int i=0; i<n; i++){
                arr[i] = nextInt();
            }
            return arr;
        }
    }
}