计算过程:
代码:
n=int(input())
kaitou=[1]*(n+1)
for i in range(1,n+1):
m=[0]*(n+1)
m[1]=1
for j in range(i+1,n+1):
if i==1:
m[i]=1
else:
kaitou[i]=kaitou[i-1]+i-1
m[i]=kaitou[i]
if i!=n:
m[j]=m[j-1]+j
if (i+1)==(n+1):
kaitou[i]=kaitou[i-1]+i-1
m[i]=kaitou[i]
for k in range(i,n+1):
print(m[k],end=' ')
print()