题解 | 杨辉三角
杨辉三角
https://www.nowcoder.com/practice/8c6984f3dc664ef0a305c24e1473729e
n = int(input())
dp = [[1] * (x+1) for x in range(n)]
for i in range(n):
for j in range(1,i):
dp[i][j] = dp[i-1][j-1] + dp[i-1][j]
for i in range(n):
print(" ".join(map(str,dp[i])))
