斐波那契数列yield表示

def fib(num):
    n=0
    a,b=0,1
    while n<num:
        print(b)
        yield
        a,b=b,a+b
        n=n+1
a=fib(30)
next(a)
next(a)