PY
py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
# Created for Ausgrindtube / Lochard Q&A
num = int(input() or 8)
def fibonacci(n):
# pure recursion in inner function
def fib(x):
return x if x < 2 else fib(x-1) + fib(x-2)
# output handled in the outer function
print(*(fib(p) for p in range(n)), sep='\n')
fibonacci(num)
Enter to Rename, Shift+Enter to Preview
OUTPUT
Run