题解 | #尼科彻斯定理#
尼科彻斯定理
http://www.nowcoder.com/practice/dbace3a5b3c4480e86ee3277f3fe1e85
m = int(input()) j = [] n = m ** 3 for i in range(1, n + 1, 2): j.append(i) out = [] total = 0 for i in range(len(j) - 1): out.append(j[i]) total += j[i] for v in range(i + 1, len(j)): total += j[v] out.append(j[v]) if total == n and len(out) == m: out = list(map(str, out)) print('+'.join(out)) exit() elif total > n: out.clear() total = 0 break
