ABC175 B - Making Triangle

提出

code: python

n = int(input())

l = list(map(int, input().split()))

ans = 0

for i in range(n):

for j in range(i+1, n):

for k in range(j+1, n):

most_max = max(max(li, lj), lk)

if (most_max < li + lj + lk - most_max and li != lj and lj != lk and li != lk):

ans += 1

print(ans)

テーマ