python-algorithm
[백준] 2747
무적김두칠
2020. 12. 22. 17:12
|
1
2
3
4
5
6
7
8
9
10
11
|
import sys
fibotmp=[0]*100
def fibo(n):
if n<=2:
return 1
if fibotmp[n]!=0: return fibotmp[n]
else:
fibotmp[n]=fibo(n-1)+fibo(n-2)
return fibotmp[n]
print(fibo(int(sys.stdin.readline())))
|
cs |
반응형