Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
Recursive Fibonacci
#python 3.6.9 #cn = int(input()) cn = 25 def fib(x): if x <= 1: return x else : return (fib(x-1) + fib(x-2)) for i in range(cn): print(fib(i))
run
|
edit
|
history
|
help
1
Exception.py
Привет
lesson3 part3
Homework exercise
shuru17
main_game
linked_lists_2
nnnn
Greatest Common Factor (Euclidean algorithm, aka Euclid's algorithm)
PyNamedTuple