杨辉三角给出行数输出杨辉三角phtyon

a = [[1], [1, 1]]
n = int(input())
for i in range(n):
    if i >= 2:
        a.append(list([1]+[a[-1][k]+a[-1][k+1] for k in range(len(a[-1])-1)]+[1]))
    print(' '.join(map(str, a[i])))