AtCoder Beginner Contest 159
翻译中…
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.
翻译中…
样例
Input #1
5
1 1 2 1 2
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$.
Input #2
4
1 2 3 4
Output #2
0
0
0
0
No two balls have equal numbers written on them.
Input #3
5
3 3 3 3 3
Output #3
6
6
6
6
6
Any two balls have equal numbers written on them.
Input #4
8
1 2 1 4 2 1 4 1
Output #4
5
7
5
7
7
5
7
5
题目信息
题面与样例版权归 AtCoder 及出题人所有；中文翻译由 AI 生成（CI 管线），如有出入请以原文为准。