斐波拉契数列

def fib(max):
    n = 0
    a = 0
    b = 1
    while n < max:
        print(b)
        s = (b, a + b)
        a = s[0]
        b = s[1]
        n = n + 1