AtCoder Beginner Contest 143
B
TAKOYAKI FESTIVAL 2019
AtCoder
⌀ 0
原题
← AC →
翻译中…

Problem Statement

翻译中…

It's now the season of TAKOYAKI FESTIVAL!

翻译中…

This year, $N$ takoyaki (a ball-shaped food with a piece of octopus inside) will be served. The deliciousness of the $i$-th takoyaki is $d_i$.

翻译中…

As is commonly known, when you eat two takoyaki of deliciousness $x$ and $y$ together, you restore $x \times y$ health points.

翻译中…

There are $\frac{N \times (N - 1)}{2}$ ways to choose two from the $N$ takoyaki served in the festival. For each of these choices, find the health points restored from eating the two takoyaki, then compute the sum of these $\frac{N \times (N - 1)}{2}$ values.

翻译中…

Constraints

翻译中…
  • All values in input are integers.
  • $2 \leq N \leq 50$
  • $0 \leq d_i \leq 100$
翻译中…

Input

翻译中…

Input is given from Standard Input in the following format:

翻译中…

N
d_1 d_2 ... d_N

翻译中…

Output

翻译中…

Print the sum of the health points restored from eating two takoyaki over all possible choices of two takoyaki from the $N$ takoyaki served.

翻译中…

样例

Input #1
3
3 1 2
Output #1
11
There are three possible choices: - Eat the first and second takoyaki. You will restore $3$ health points. - Eat the second and third takoyaki. You will restore $2$ health points. - Eat the first and third takoyaki. You will restore $6$ health points. The sum of these values is $11$.
Input #2
7
5 0 7 8 3 3 2
Output #2
312
题目信息
题号
abc143_b
时间限制
2 s
内存限制
1024 MB

题面与样例版权归 AtCoder 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。