协程(Coroutines)实现fibonacci函数

 def fibonacci():
     yield 1
     yield 1
     l=[1,1]
     while True:
         l=[l[-1],sum(l[-2:])]
         yield l[-1]

 def tribonacci():
     yield 0
     yield 1
     yield 1
     l=[0,1,1]
     while True:
         l=[l[-2],l[-1],sum(l[-3:])]
         yield  l[-1]

 for i,(f,t) in enumerate(zip(fibonacci(),tribonacci())):
     if i==10:
         break
     print(f,t)

运行结果如下

 1 0
 1 1
 2 1
 3 2
 5 4
 8 7
 13 13
 21 24
 34 44
 55 81