#斐波拉契数列的递归方法
def feb(n):
    if n < 1:
        print('输入有误！')
    elif n == 1 or n == 2:
        return 1
    else:
        return feb(n-1) + feb(n-2)
n = int(input('请输入n:'))
result = feb(n)
print('%d的斐波拉契数列的值为%d!' % (n,result))

#杨辉三角
def truangles():
    L = [1]
    while True:
        yield L
        L = [1] + [L[i] + L[i+1] for i in range(len(L) - 1)] + [1]

n=0
for t in truangles():
    print(t)
    n=n+1
    if n==10:
        break