题解 | #尼科彻斯定理#
尼科彻斯定理
https://www.nowcoder.com/practice/dbace3a5b3c4480e86ee3277f3fe1e85
m = int(input())
m3 = m*m*m
oddNum = []
for i in range(m3):
if i % 2 != 0:
oddNum.append(i)
for j in range(len(oddNum)):
if sum(oddNum[j:j+m]) == m3:
print('+'.join(map(str, oddNum[j:j+m])))
