不管是递归求所有三角形还是三个for循环嵌套都时间超限 这咋办嘛 def isObtuse(a, b, c): return ((b[0] - a[0]) * (c[0] - a[0]) + (b[1] - a[1]) * (c[1] - a[1]) < 0) and ((b[0] - a[0]) * (c[1] - a[1]) - (c[0] - a[0]) * (b[1] - a[1]) != 0) def solve(): n = int(input()) locations = [] count = 0 for _ in r...