PY
py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
from functools import lru_cache
num = int(input())
@lru_cache (maxsize = 100000)
def hof(num,i=0):
if num > 1:
Q=[1,1]
else:
Q=[1,0]
for i in range (2,num):
Q += [Q[i-Q[i-1]] + Q[i-Q[i-2]]]
return Q[i]
print(hof(num))
Enter to Rename, Shift+Enter to Preview
OUTPUT
Run