|시간 제한||메모리 제한||제출||정답||맞힌 사람||정답 비율|
|1 초||512 MB||26||16||16||61.538%|
Call a set of positive integers triangular if it has size at least three and, for all triples of distinct integers from the set, a triangle with those three integers as side lengths can be constructed.
Given a set of positive integers, compute the number of its triangular subsets.
The first line of input contains a single integer $n$ ($1 \le n \le 50$), which is the number of integers in the set.
Each of the the next $n$ lines contains a single integer $x$ ($1 \le x \le 10^9$). These are the elements of the set. They are guaranteed to be distinct.
Output a single integer, which is the number of triangular subsets of the given set.
5 3 1 5 9 10
10 27 26 17 10 2 14 1 12 23 39