forked from tdwojak/Python2017
15 lines
322 B
Python
15 lines
322 B
Python
|
**cwiczenie 2**
|
|||
|
|
Napisz generator, kt<EFBFBD>ry bedzie zwracac ``n`` kolejnych liczb ciagu Fibonacciego (``F(0)=1, F(1)=1, FN=F(N-1) + F(N-2)``).
|
|||
|
|
"""
|
|||
|
|
|
|||
|
|
def Fib(n):
|
|||
|
|
for i in range(n):
|
|||
|
|
if n==0:
|
|||
|
|
return 1
|
|||
|
|
elif n==1:
|
|||
|
|
return 1
|
|||
|
|
else:
|
|||
|
|
return Fib(n-1)+Fib(n-2)
|
|||
|
|
|
|||
|
|
|
|||
|
|
print Fib(10)
|