杨辉三角问题(python)
样例输入
4
样例输出
1
1 1
1 2 1
1 3 3 1
def fact(n):
if n==1 or n==0:
a = 1
else:
a = n * fact(n-1)
return a
def pailie(n,m):
a = fact(n)//fact(n-m)
return a
def zuhe(n,m):
a = pailie(n,m)//fact(m)
return a
n = eval(input())
for i in range(0,n):
print()
for j in range(0,i+1):
print(zuhe(i,j),end=" ")
运行后超时,为什么不是最简的呢