cf：A. Print a Pedestal (Codeforces logo?)【简单遍历模拟】

分析

找到一个总和为n的 然后三个数不同的 然后最大数最小的 遍历即可

Ac code

for _ in range(int(input())):
    n = int(input())
    k = n // 3
    flag = False
    for i in range(k + 1, n):
        target = n - i
        for j in range(1, min(i, target)):
            if j != target - j and j < i and target - j < i and j != 0 and target - j != 0:
                print(max(j, target - j), i, min(j, target - j))
                flag = True
            if flag:
                break
        if flag:
            break

总结

简单遍历