题解 | 杨辉三角

n = int(input())
a = [[0 for _ in range(n+1)] for _ in range(n+1)]
a[1][1] = a[2][1] = a[2][2] = 1
for i in range(1,n+1):
    for j in range(1,i+1):
        if i>2:
            a[i][j] = a[i-1][j-1] + a[i-1][j]
        print(a[i][j],end = ' ')
    print()