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



Sample input:
5
1 1 2 1 2


Sample output:
2
2
3
2
3

Submission status: Accepted

Solution code:
N=int(input())
alist=list(map(int,input().split()))
#print(alist)

dic_a={}
for a in alist:
  if not a in dic_a:
    dic_a[a]=1
  else:
    dic_a[a]+=1
    
all_pair=0
for val in dic_a.values():
  all_pair+=val*(val-1)//2

#print(dic_a,all_pair)
for a in alist:
  answer=all_pair-dic_a[a]+1
  print(answer)

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    n= int(input())
    s = [int(i) for i in input().split(" ")]
    dict = {}
    for i in s:
        if i in dict:
            dict[i] = dict[i]+1
        else:
            dict[i] = 1
    sum = 0
    for i in dict.values():
        if i > 1:
            sum = sum + (i-1)*i//2

    for i in s:
        num = sum
        if i in dict :
            num = num -dict[i] +1
        print(num)

Submission status: Accepted

Solution code:
n,*a=map(int,open(0).read().split())
m=[0]*n
for i in a:
  m[i-1]+=1
w=0
for i in range(n):
  w+=(m[i]*(m[i]-1))//2
for i in a:
  print(w+1-m[i-1])

Submission status: Accepted

Solution code:
import sys,math
sys.setrecursionlimit(10**9)
from collections import defaultdict
 
IA = lambda: map(int,input().split())
IAS= lambda: map(str,input().split())

n=int(input())
N=200005

def f(n):
    if n<2:return 0
    return n*(n-1)//2

a=list(IA())

vis=[0 for i in range(0,n+1)]

for it in a:
    vis[it]+=1

    
sum1=0

for i in range(1,n+1):
    sum1+=f(vis[i])
ans=[int(-1) for i in range(0,n+1)]
for it in a:
    if ans[it]==-1:
        ans[it]=sum1-f(vis[it])+f(vis[it]-1)
    print(ans[it])

Submission status: Accepted

Solution code:
N, *A = map(int, open(0).read().split())

C = [0]*(N+1)
for a in A:
    C[a] += 1

total = 0
for c in C:
    total += c*(c-1)//2

for a in A:
    n = C[a]
    if n >= 2:
        ans = total - n + 1
    else:
        ans = total
    print(ans)

Submission status: Accepted

Solution code:
from collections import Counter
def comb(n, r = 2):
    if n < 2:
        return 0
    return n * (n - 1) // 2
def solve():
    n = int(input())
    A = list(map(int, input().split()))
    C = Counter(A)
    All = [0] * (n + 1)
    All_1 = [0] * (n + 1)
    for k, v in C.items():
        All[k] = comb(v)
        All_1[k] = comb(v - 1)
    sum_all = sum(All)
    for a in A:
        print(sum_all - (All[a] - All_1[a]))
solve()

Submission status: Accepted

Solution code:
from collections import Counter
N = int(input())
A = list(map(int, input().split()))

balls = Counter(A)
s = 0
for k, v in balls.most_common():        
    if v >= 2:
        s += v * (v - 1) // 2

for i in range(N):
    c = balls[A[i]]
    d = (c * (c - 1) / 2) - ((c - 1) * (c - 2) / 2)
    print(int(s-d))

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
printV = lambda x: print(*x, sep="\n")
printH = lambda x: print(" ".join(map(str,x)))
def IS(): return sys.stdin.readline()[:-1]
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LII(rows_number): return [II() for _ in range(rows_number)]
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]

def main():
	N = II()
	A = LI1()
	L = [0]*N
	b = [0]*N
	t = 1
	for i,a in enumerate(A):
		L[a]+=1
		if(i==0):
			b[0]=t
		else:
			b[i]=b[i-1]+t
		t+=1
	L_s = L.copy()
	L_s.sort(reverse=True)
	max_c = 0
	for l in L_s:
		if l <= 1:
			break
		else:
			max_c += b[l-2]
	ans = [max_c]*N
	for i,a in enumerate(A):
		if(L[a]>=2):
			ans[i]+=(-L[a]+1)
	printV(ans)


if __name__ == '__main__':
	main()

Submission status: Accepted

Solution code:
from collections import Counter
from math import factorial
n = int(input())
a = list(map(int,input().split()))
t = Counter(a)
ans = 0
for v in t.values():
    ans += v*(v-1)//2
for i in range(n):
    tmp = ans
    tmp = tmp - ((t[a[i]]*(t[a[i]]-1))//2) + (((t[a[i]]-1)*(t[a[i]]-2))//2)
    print(tmp)

Submission status: Accepted

Solution code:
import collections

N = int(input())
A = list(map(int, input().split()))

c = collections.Counter(A)

sum_dict = {}
sum_dict_n = {}

sum = 0
sum_n = 0

for key in c.keys():
    coll = c[key] * (c[key] - 1) // 2
    sum_dict[key] = coll
    sum += coll
    value_k = c[key] - 1
    coll_n = value_k * (value_k - 1) // 2
    sum_dict_n[key] = coll_n

for a in A:
    ans = sum
    ans = ans - sum_dict[a] + sum_dict_n[a]
    print(ans)

Submission status: Accepted

Solution code:
import collections

N = int(input())
A = [int(i) for i in input().split()]

c = collections.Counter(A)

def count_list(c):
    modify = {}
    ret = 0
    for k, v in c.items():
        a = v*(v-1)//2
        b = (v-1)*(v-2)//2
        ret += a
        modify[k] = -a + b
    return ret, modify

counts, modify = count_list(c)
for a in A:
    print(counts + modify[a])

Submission status: Accepted

Solution code:
import collections

N = int(input())
A = list(map(int, input().split()))
C = collections.Counter(A)
Sans = 0
for num in C.values():
    Sans += num*(num-1)//2

for a in A:
    num = C[a] - 1
    ans = Sans - C[a]*(C[a]-1)//2 + num*(num-1)//2
    print(ans)

Submission status: Accepted

Solution code:
def main(sample_file = ''):

    """ convenient functions
    # for i, a in enumerate(iterable)
    # q, mod = divmod(a, b)
    # divmod(x, y) returns the tuple (x//y, x%y)
    # Higher-order function: reduce(operator.mul, xyz_count, 1)
    # manage median(s) using two heapq https://atcoder.jp/contests/abc127/tasks/abc127_f
    """

    """convenient decorator
    # @functools.lru_cache():
    # to facilitate use of recursive function
        # ex:
        # from functools import lru_cache
        # import sys
        # sys.setrecursionlimit(10**9)
        # @lru_cache(maxsize=None)
        # def fib(n):
        #     if n < 2:
        #         return n
        #     return fib(n-1) + fib(n-2)
        # print(fib(1000))
    """
    
    # import numpy as np
    import sys
    sys.setrecursionlimit(10**7)
    from itertools import accumulate, combinations, permutations, product # https://docs.python.org/ja/3/library/itertools.html
    # accumulate() returns iterator! to get list: list(accumulate())
    from math import factorial, ceil, floor, sqrt
    def factorize(n):
        """return the factors of the Arg and count of each factor
        
        Args:
            n (long): number to be resolved into factors
        
        Returns:
            list of tuples: factorize(220) returns [(2, 2), (5, 1), (11, 1)]
        """
        fct = []  # prime factor
        b, e = 2, 0  # base, exponent
        while b * b <= n:
            while n % b == 0:
                n = n // b
                e = e + 1
            if e > 0:
                fct.append((b, e))
            b, e = b + 1, 0
        if n > 1:
            fct.append((n, 1))
        return fct
    def combinations_count(n, r):   
        """Return the number of selecting r pieces of items from n kinds of items.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        # TODO: How should I do when n - r is negative?
        if n < 0 or r < 0:
            raise Exception('combinations_count(n, r) not defined when n or r is negative')
        if n - r < r: r = n - r
        if r < 0: return 0
        if r == 0: return 1
        if r == 1: return n
        numerator = [n - r + k + 1 for k in range(r)]
        denominator = [k + 1 for k in range(r)]
        for p in range(2,r+1):
            pivot = denominator[p - 1]
            if pivot > 1:
                offset = (n - r) % p
                for k in range(p-1,r,p):
                    numerator[k - offset] /= pivot
                    denominator[k] /= pivot
        result = 1
        for k in range(r):
            if numerator[k] > 1:
                result *= int(numerator[k])
        return result
    def combinations_with_replacement_count(n, r):
        """Return the number of selecting r pieces of items from n kinds of items allowing individual elements to be repeated more than once.
        
        Args:
            n (long): number
            r (long): number
        
        Raises:
            Exception: not defined when n or r is negative
        
        Returns:
            long: number
        """
        if n < 0 or r < 0:
            raise Exception('combinations_with_replacement_count(n, r) not defined when n or r is negative')
        elif n == 0:
            return 1
        else:
            return combinations_count(n + r - 1, r)
    from bisect import bisect_left, bisect_right
    from collections import deque, Counter, defaultdict # https://docs.python.org/ja/3/library/collections.html#collections.deque
    from heapq import heapify, heappop, heappush, heappushpop, heapreplace,nlargest,nsmallest # https://docs.python.org/ja/3/library/heapq.html
    from copy import deepcopy, copy # https://docs.python.org/ja/3/library/copy.html
    import operator
    from operator import itemgetter #sort 
    # ex1: List.sort(key=itemgetter(1))
    # ex2: sorted(tuples, key=itemgetter(1,2))
    from functools import reduce, lru_cache
    def chmin(x, y):
        """change minimum
        if x > y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current minimum value
            y (long): potential minimum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x > y:
            x = y
            return (x, True)
        else:
            return (x, False)
    def chmax(x, y):
        """change maximum
        if x < y, x = y and return (x, True).
        convenient when solving problems of dp[i]
        
        Args:
            x (long): current maximum value
            y (long): potential maximum value
        
        Returns:
            (x, bool): (x, True) when updated, else (x, False)
        """
        if x < y:
            x = y
            return (x, True)
        else:
            return (x, False)

    from fractions import gcd # Deprecated since version 3.5: Use math.gcd() instead.
    def gcds(numbers):
        return reduce(gcd, numbers)
    def lcm(x, y):
        return (x * y) // gcd(x, y)
    def lcms(numbers):
        return reduce(lcm, numbers, 1)
    def make_divisors(n, reversed=False):
        """create list of divisors
        
        Args:
            number (int): number from which list of divisors is created
            reversed (bool, optional): ascending order if False. Defaults to False.
        
        Returns:
            list: list of divisors
        """
        divisors = set()
        for i in range(1, int(n**0.5)+1):
            if n % i == 0:
                divisors.add(i)
                divisors.add(n//i)
        return sorted(list(divisors),reverse=reversed)
    
    # first create factorial_list
    # fac_list = mod_factorial_list(n)
    INF = 10 ** 18
    MOD = 10 ** 9 + 7
    AtoZ = list('abcdefghijklmnopqrsruvwxyz')
    modpow = lambda a, n, p = MOD: pow(a, n, p) # Recursive function in python is slow!
    def modinv(a, p = MOD):
        # evaluate reciprocal using Fermat's little theorem:
        # a**(p-1) is identical to 1 (mod p) when a and p is coprime
        return modpow(a, p-2, p)
    def modinv_list(n, p = MOD):
        if n <= 1:
            return [0,1][:n+1]
        else:
            inv_t = [0,1]
            for i in range(2, n+1):
                inv_t += [inv_t[p % i] * (p - int(p / i)) % p]
            return inv_t
    def modfactorial_list(n, p = MOD):
        if n == 0:
            return [1]
        else:
            l = [0] * (n+1)
            tmp = 1
            for i in range(1, n+1):
                tmp = tmp * i % p
                l[i] = tmp
            return l
    def modcomb(n, k, fac_list = [], p = MOD):
        # fac_list = modfactorial_list(100)
        # print(modcomb(100, 5, modfactorial_list(100)))
        from math import factorial
        if n < 0 or k < 0 or n < k: return 0
        if n == 0 or k == 0: return 1
        if len(fac_list) <= n:
            a = factorial(n) % p
            b = factorial(k) % p
            c = factorial(n-k) % p
        else:
            a = fac_list[n]
            b = fac_list[k]
            c = fac_list[n-k]
        return (a * modpow(b, p-2, p) * modpow(c, p-2, p)) % p
    def modadd(a, b, p = MOD):
        return (a + b) % MOD
    def modsub(a, b, p = MOD):
        return (a - b) % p
    def modmul(a, b, p = MOD):
        return ((a % p) * (b % p)) % p
    def moddiv(a, b, p = MOD):
        return modmul(a, modpow(b, p-2, p))

    class UnionFindTree:
        """union find tree class
        TODO: fix this description...
        how to use (example):
        >>  uf = UnionFindTree(N) 
        >>  if uf.find_root(a) == uf.find_root(b):
        >>      do something
        >>  else:
        >>      do something
        >>      uf.unite(a, b)
        """
        def __init__(self, N):
            self.root = [-1] * (N+1)
            self.rank   = [0]  * (N+1)
            self.connected_num = [1] * (N+1)
    
        def find_root(self,x):
            root = self.root
            while root[x] != -1:
                x = root[x]
            return x
    
        def unite(self,x,y):
            root = self.root
            rank = self.rank
            connected_num = self.connected_num
            find_root = self.find_root
    
            rx = find_root(x)
            ry = find_root(y)
            if rx != ry:
                if rank[rx] < rank[ry]:
                    root[rx] = ry
                    rx,ry = ry,rx
                else:
                    if rank[rx] == rank[ry]:
                        rank[rx] += 1
                    root[ry] = rx       
                connected_num[rx] += connected_num[ry]

    # Graph: https://en.wikipedia.org/wiki/Directed_graph
    # Bellman-Ford: O(|V||E|). Use this if there exists an edge with negative length in the graph
    # After N steps, the shortest path has converded if there doesn't exist an cycle of edges with negative
    # Watch out: d[N] == d[2*N] doesn't necessarily mean the graph doesn't have negative cycle
    # ref: https://www.youtube.com/watch?v=1Z6ofKN03_Y

    def BellmanFord(N, M, ABC, vertex_start, vertex_end, value_if_inf = -1, find_shortest = False):
        """to calculate furthest or shortest length between vertex_start and vertex_end using BellmanFord algorithm
        
        Args:
            N (int): number of vertices
            M (int): number of edges
            ABC (list): [(ai, bi, ci) for _ in range(N)] where i-th edge is directed from vertex ai to vertex bi and the length is ci 
            vertex_start (int): start vertex. usually use 0.
            vertex_end (int): end vertex. usually use N-1.
            value_if_inf (int or string as you like, optional): value you want when the furthest (or shortest) distance is infinite (or -infinite). Defaults to -1.
            find_shortest (bool, optional): choose False to find furthest path. Defaults to False.
        
        Returns:
            int or string: normally int (but can be str if you set value_if_inf to str)
            
        Example:
                N, M, P = R()
                ABC = [R() for _ in range(M)]
                ABC = [(a-1, b-1, c-P) for a, b, c in ABC]
                print(BellmanFord(N, M, ABC, 0, N-1, value_if_inf = 'inf'))

        """

        def make_reachable_list(N, M, ABC, vertex_start, vertex_end):
            reachable_to_direct = defaultdict(list)
            reachable_from_direct = defaultdict(list)
            reachable_from_start = [False] * N
            reachable_to_end = [False] * N
            reachable_from_start[vertex_start] = True
            reachable_to_end[vertex_end] = True
            reachable_from_both_sides = [False] * N
            dfs_from_start = []
            dfs_to_end = []
            for a, b, c in ABC:
                reachable_to_direct[a].append(b)
                reachable_from_direct[b].append(a)
                if a == vertex_start:
                    dfs_from_start.append(b)
                    reachable_from_start[b] = True
                if b == vertex_end:
                    dfs_to_end.append(a)
                    reachable_to_end[a] = True
            while dfs_from_start:
                v = dfs_from_start.pop()
                for i in reachable_to_direct[v]:
                    if not reachable_from_start[i]:
                        reachable_from_start[i] = True
                        dfs_from_start.append(i)
            while dfs_to_end:
                v = dfs_to_end.pop()
                for i in reachable_from_direct[v]:
                    if not reachable_to_end[i]:
                        reachable_to_end[i] = True
                        dfs_to_end.append(i)
            for i in range(N):
                reachable_from_both_sides[i] = reachable_from_start[i] and reachable_to_end[i]
            return reachable_from_both_sides
        
        reachable_from_both_sides = make_reachable_list(N, M, ABC, vertex_start, vertex_end)
        
        if find_shortest:
            dist = [INF for i in range(N)]
        else:
            dist = [-INF for i in range(N)]
        
        dist[vertex_start] = 0
        for i in range(N):
            updated = False
            for a, b, c in ABC:
                if not reachable_from_both_sides[a]:
                    continue
                elif find_shortest:
                    update_condition = dist[a] + c < dist[b]
                else:
                    update_condition = dist[a] + c > dist[b]
                if dist[a] != INF and update_condition:
                    dist[b] = dist[a] + c
                    updated = True
                    if i == N-1:
                        return value_if_inf
            if not updated:
                break
        return dist[vertex_end]

    """ initialize variables and set inputs
    # initialize variables
        # to initialize list, use [0] * n
        # to initialize two dimentional array:
            # ex) [[0] * N for _ in range(N)]
            # ex2) dp = [[0] * (N+1) for _ in range(W*2)]
    # set inputs
        # put inputs between specific values (almost as quickly)
        # ex) S = [-INF] + [int(r()) for _ in range(A)] + [INF]
        # open(0).read() is sometimes useful:
        # ex) n, m, *x = map(int, open(0).read().split())
        #     min(x[::2]) - max(x[1::2])
        # ex2) *x, = map(int, open(0).read().split())
        #     don't forget to add comma after *x if only one variable is used
    # preprocessing
        # transpose = [x for x in zip(*data)]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [(1, 4, 7), (2, 5, 8), (3, 6, 9)]
        # flat = [flatten for inner in data for flatten in inner]
        # ex) [[1, 2, 3], [4, 5, 6], [7, 8, 9]] => [1, 2, 3, 4, 5, 6, 7, 8, 9]
    # calculate and output
        # output pattern
        # ex1) print(*l) => when l = [2, 5, 6], printed 2 5 6
    """

    # functions to read input
    r = lambda: sys.stdin.readline().strip()
    r_int = lambda: int(r())
    r_float = lambda: float(r())
    R = lambda: list(map(int, r().split()))
    R_str = lambda: r().split()
    R_map = lambda: map(int, r().split())
    R_float = lambda: list(map(float, r().split()))
    R_tuple = lambda: tuple(map(int, r().split()))

    """ how to treat input
    # single int: int(r())
    # single string: r()
    # single float: float(r())
    # line int: R()
    # line string: r().split()
    # line (str, int, int): [j if i == 0 else int(j) for i, j in enumerate(r().split())]
    # lines int: [R() for _ in range(n)]
    """

    # for test
    if sample_file:
        sys.stdin = open(sample_file)
        
    # ----------------------------------
    # main
    #%%
    N = r_int()
    A = R()
    sumup = Counter(A)
    preans = sum([combinations_count(i, 2) for i in sumup.values()])
    for a in A:
        print(preans - combinations_count(sumup[a], 2) + combinations_count(sumup[a]-1, 2))
    
    #%%
    # end of main
    # ----------------------------------

    """memo: how to use defaultdict of list
    # initialize
    Dic = defaultdict(list)
    # append / extend
    Dic[x].append(y)
    # three methods for loop: keys(), values(), items()
    for k, v in Dic.items():
    """
    
    """memo: how to solve binary problems
    # to make binary digits text
    >>> a = 5
    >>> bin_str_a = format(a, '#06b')
    >>> print(bin_str_a)
    0b0101 # first 2 strings (='0b') indicates it is binary
    """
    
    """memo: how to solve the problem
    creating simple test/answer
    greed
    simple dp
    graph
    """

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from collections import Counter

def main():
    inp = lambda: [int(x) for x in input().split()]
    f = lambda x: x * (x - 1) // 2

    n = int(input())
    a = inp()
    counter = Counter(a)
    ans = sum([f(counter[c]) for c in counter])
    for key in a:
        val = counter[key]
        print(ans - (f(val) - f(val-1)))
    

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def combination(n,r):
  n1,r = n+1, min(r,n-r)
  numer = denom = 1
  for i in range(1, r+1):
    numer = numer*(n1-i)
    denom = denom*i
  return numer // denom

n = int(input())
a = [int(i) for i in input().split()]

d = dict()
for i in a:
  if i in d:
    d[i] += 1
  else:
    d[i] = 1

total = 0
for i in d:
  if d[i] > 1:
    total += combination(d[i],2)

for i in a:
  ans = total - (d[i]-1)
  print(ans)

Submission status: Accepted

Solution code:
N = int(input())
a = list(map(int, input().split()))
alst = [0] * 200005
cmb1 = [0] * 200005

for i in range(N):
    alst[a[i]] += 1

for i in range(N):
    cmb1[i + 1] = cmb1[i] + ((alst[i + 1] * (alst[i + 1] - 1)) // 2)

for i in range(N):
    tmp1 = (alst[a[i]] * (alst[a[i]] - 1)) // 2
    tmp2 = ((alst[a[i]] - 1) * (alst[a[i]] - 2)) // 2
    ans = cmb1[N] - tmp1 + tmp2
    print(ans)

Submission status: Accepted

Solution code:
n=int(input())
a=list(map(int,input().split()))
l=[0 for i in range(n+1)]

for i in a:
  l[i]+=1
cmb1=[0 for i in range(n+1)]
cmb2=[0 for i in range(n+1)]

for i in range(1,n+1):
  cmb1[i]=(l[i]*(l[i]-1))//2
  cmb2[i]=((l[i]-1)*(l[i]-2))//2

kei1=0
for i in range(1,n+1):
  kei1+=cmb1[i]

for i in range(1,n+1):
  print(kei1-cmb1[a[i-1]]+cmb2[a[i-1]])

Submission status: Accepted

Solution code:
M=int(input())
N=list(input().split())
check=[0]*M
for i in range(M):
    check[int(N[i])-1]+=1
num=0
for i in range(M):
    num+=check[i]*(check[i]-1)//2
for i in range(M):
    if check[int(N[i])-1]!=2:
        print(num-(check[int(N[i])-1]-1))
    else:
        print(num-1)

Submission status: Accepted

Solution code:
from collections import Counter

n = int(input())
A = list(map(int, input().split()))

c = Counter(A)
d_1 = {k:v*(v-1)//2 for k,v in c.items()}
d_2 = {k:(v-1)*(v-2)//2 for k,v in c.items()}
d_value_sum = sum([i for i in d_1.values()])

for i in range(n):
  x = A[i]
  v_1 = d_1[x]
  v_2 = d_2[x]
  print(d_value_sum-v_1+v_2)

Submission status: Accepted

Solution code:
n = int(input())
a = [int(n) for n in input().split()]
lst = [0 for _ in range(2 * 100000)]
ans = 0
for i in a:
    lst[i] = lst[i] + 1
for i in lst:
    if i != 0:
        ans = ans + (i * (i - 1) / 2)
for i in a:
    x = lst[i]
    if x != 0 or x != 1:
        print((ans - (x * (x - 1) / 2) + ((x - 1) * (x - 2) / 2)).__int__())

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int,input().split()))
Array = [0] * N
Array_C = [0] * N
for i in range(N):
    Array[A[i] -1] += 1
for i in range(N):
    Array_C[i] = (Array[i]) * (Array[i] - 1) // 2
SUM_ARRAY = sum(Array_C)

for i in range(N):
    print(SUM_ARRAY - Array_C[A[i] - 1] + (Array_C[A[i] - 1] * (Array[A[i] - 1]-2) // Array[A[i] - 1]))

Submission status: Accepted

Solution code:
from collections import Counter
import math
def comb(n, r):
    # print(n, r)
    return (n * (n-1))//2
    # return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

n = int(input())
a = list(map(int, input().split()))
c = Counter(a)

# All combination
total = 0
for (key, val) in c.items():
    # print('\n', key, val)
    if val > 1:
        total += comb(val, 2)

# print('all:', total)

for i in range(n):
    num = a[i]
    org = c[num]
    # print(org)
    # total - orgC2 + (org-1)C2
    if org > 2:
        ans = total - comb(org, 2) + comb(org-1, 2)
    elif org == 1 or org == 0:
        ans = total
    else:
        ans = total - comb(org, 2)
    print(ans)

Submission status: Accepted

Solution code:
N = int(input())
A = list(map(int, input().split()))
B = [-1 for i in range(2*100000)]

ans = 0
for a in A:
    B[a-1] += 1

    if B[a-1] != 0:
        ans += B[a-1]


A.append(0)
ans -= B[A[0] - 1]
for k in range(N):
    print(ans)
    ans += B[A[k] - 1] - B[A[k+1] - 1]

Submission status: Accepted

Solution code:
from collections import Counter

N = int(input())
A = [int(_) for _ in input().split()]

counter = Counter(A)

ans = 0
dic = {}
for k, v in counter.items():
    ans += v * (v - 1) // 2
    dic[k] = v * (v - 1) // 2
# print(dic)
# print(ans)
for i, a in enumerate(A):
    tmp = counter[a]
    tmp_2 = dic[a]
    print(ans - tmp_2 + (tmp - 1) * (tmp - 2) // 2)

Submission status: Accepted

Solution code:
N = int(input())
a_list = list(map(int, input().split()))
dic_A = {}
for i in range(N):
    if a_list[i] in dic_A:
        dic_A[a_list[i]] += 1
    else:
        dic_A[a_list[i]] = 1
ans = 0
for k, v in dic_A.items():
    ans += v*(v-1)//2
#print(dic_A, ans)
for i in range(N):
    tmp = dic_A[a_list[i]]
    if tmp <= 1:
        print(ans)
    else:
        print(ans-tmp*(tmp-1)//2+(tmp-1)*(tmp-2)//2)

Submission status: Accepted

Solution code:
from collections import Counter


n = int(input())
A = list(map(int, input().split()))
c = Counter(A)
cc = c.most_common()
ans = 0
for i in range(len(cc)):
    n = cc[i][1]
    if n < 2:
        break
    ans += n * (n-1) // 2

for i in A:
    cnt = c[i]
    if cnt == 1:
        print(ans)
    else:
        ans_ = ans + (cnt-1)*(cnt-2) // 2 - cnt*(cnt-1)//2
        print(ans_)

Submission status: Accepted

Solution code:
def main():
    N=int(input())
    L=[0]*(N+1)
    A=[int(_) for _ in input().split()]
    P=[0]*(N+1)
    ans=[0]*(N+1)

    for i in A:
        L[i]+=1

    a=set(A)

    for i in a:
        P[i]=L[i]*(L[i]-1)//2

    sums=sum(P)

    for i in a:
        if L[i]>=2:
            ans[i]=sums-P[i]+(L[i]-1)*(L[i]-2)//2
        else:
            ans[i]=sums

    for i in A:
        print(ans[i])

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import collections
import sys
n=int(input())
a=list(map(int,input().split()))
b=collections.Counter(a)
c=list(b.items())

if len(set(a))==len(a):
  for i in range(n):
    print(0)
  sys.exit()
  
cnt=0
for i in range(len(c)):
  if c[i][1]>1:
    cnt+=(c[i][1]*(c[i][1]-1))//2
  else:
    cnt=cnt
for i in range(n):
  d=b[a[i]]
  if d<2:
    print(cnt)
  else:
    print(cnt-(d*(d-1)//2)+((d-1)*(d-2))//2)

Submission status: Accepted

Solution code:
import collections

N = int(input())
A = list(map(int,input().split()))
AS = set(A)

def comb(n):
    return n*(n-1)//2

L = collections.Counter(A)

ans_tmp = 0
for a in AS:
    ans_tmp += comb(L[a])

for i in range(N):
    ans = ans_tmp
    ans += (comb(L[A[i]]-1) - comb(L[A[i]]))

    print(ans)

Submission status: Accepted

Solution code:
from collections import Counter



n = int(input())
a = list(map(int, input().split()))
count = Counter(a)
b = sum((v - 1) * v // 2 for  v in count.values())
for i in a:
    print(b + 1 - count[i])

Submission status: Accepted

Solution code:

n = int(input())
a = map(int, input().split())
a = list(a)

c = {}
for k in a:
    if c.get(k) is None:
        c[k] = 1
    else:
        c[k] += 1


def nc2(x):
    return (x*(x-1)) // 2


ans = 0
for cn in c.values():
    ans += nc2(cn)

for k in a:
    print(ans - (nc2(c[k]) - nc2(c[k]-1)))

Submission status: Accepted

Solution code:
n = int(input())
a = list(map(int, input().split()))
s = [0]*n
for i in range(n):
	s[a[i]-1] += 1
k = 0
for i in range(n):
	if s[i] >= 2:
		k += ((s[i]*(s[i]-1))//2)
for i in range(n):
	if s[a[i]-1] >= 2:
		print(k-(s[a[i]-1]-1))
	else:
		print(k)

Submission status: Accepted

Solution code:
from collections import Counter

N = int(input())
A_array = list(map(int, input().split()))
Ai_dict = Counter(A_array)


def calc_comb(dct):
    num = 0
    for k,v in dct.items():
        num += v*(v-1)/2
    return int(num)


res_dict = dict([])
TotalComb = calc_comb(Ai_dict)

for n in A_array:
    if not n in res_dict.keys():
        res_dict[n] = TotalComb - Ai_dict[n]+1
    print(res_dict[n])

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**6)
from collections import defaultdict

N = int(input())
A = list(map(int, input().split()))

d = defaultdict(int)

for i in range(N):
    d[A[i]] += 1

#print(d)
a = defaultdict(int)
b = defaultdict(int)
for key, value in d.items():
    a[key] = value * (value - 1) //2
    b[key] = value * (value - 1) //2 - (value - 1) * (value - 2) // 2
#print(a)
#print(b)
total = 0
for key, value in a.items():
    total += value
#print(total)
for i in range(N):
    ans = total - b[A[i]]
    print(ans)

Submission status: Accepted

Solution code:
from collections import Counter
# from scipy.special import comb
from scipy.misc import comb
n = int(input())
a = [int(x) for x in input().split()]
aa = Counter(a)
cnt = []
for i in range(1, n + 1):
    cnt.append(comb(aa[i], 2, exact=True))
s = sum(cnt)
for i in range(n):
    print(s - comb(aa[a[i]], 2, exact=True) + comb(aa[a[i]] - 1, 2, exact=True))