题解 | #尼科彻斯定理#
尼科彻斯定理
https://www.nowcoder.com/practice/dbace3a5b3c4480e86ee3277f3fe1e85
import sys
a1 = int(input())
a3= a1*a1*a1
aaa=[]
bbb=""
jjj=0
for j in range(0,a1):
jj=j*2
jjj+=jj
for i in range(1,10000): #绷不住了的枚举法，居然能过
if a1*i+jjj == a3:
for j in range(a1):
aa=i+j*2
aaa.append(str(aa))
bbb = "+".join(aaa)
print(bbb)
