python 毕达哥拉斯三重奏

Posted 2021-05-09

def findTheTriple(n=1000):
    return next({a, b, n - a - b}
        for a in range(1, n // 2)
            for b, m in [divmod(n * (n - 2 * a), 2 * (n - a))]
                if not m)