杨辉三角形python实现
a = int(input())
n = [1]
for i in range(a):
print(n)
a.append(0)
n = [n[k]+n[k-1] for j in range(i+2)]
杨辉三角形python实现
a = int(input())
n = [1]
for i in range(a):
print(n)
a.append(0)
n = [n[k]+n[k-1] for j in range(i+2)]