ABC143 D - Triangles

提出

TLE

code: python

import itertools

n = int(input())

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

ans = 0

for sticks in itertools.combinations(l, 3):

ans += 1

print(ans)

解答

code: python

from bisect import bisect_left

N = int(input())

L = sorted(list(map(int, input().split())))

ans = 0

for i in range(N): # 最短

for j in range(i + 1, N): # 真ん中

print(ans)

テーマ

メモ

aが最大辺のとき三角形の成立条件は b+c < a

TLE

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):

max_side = max(side1, max(side2, side3))

if (max_side < (side1 + side2 + side3) - max_side):

ans += 1

print(ans)

提出

code: python

n = int(input())

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

l.sort(reverse=True)

restl = []

for i in range(n-1, 0, -1):

# 最小の組み合わせだがそれ以外は条件を満たすとは限らない

print(l)

print(restl)