In [2]: def fibonacci(n): if n 새로운 키 값을 저장시켜줌 return number In [11]: memory = {1: 1, 2: 1} def fibonacci(n): if n in memory: number = memory[n] else: number = fibonacci(n-1) + fibonacci(n-2) memory[n] = number return number print(fibonacci(100)) print(memory) 354224848179261915075 {1: 1, 2: 1, 3: 2, 4: 3, 5: 5, 6: 8, 7: 13, 8: 21, 9: 34, 10: 55, 11: 89, 12: 144, 13: 233, 14: 377, 15: 610, 16: 98..