From 159c3878a69d553c2d8af42f8aec9528c7403cbc Mon Sep 17 00:00:00 2001 From: sm4640 Date: Thu, 26 Mar 2026 16:38:55 +0900 Subject: [PATCH] =?UTF-8?q?2748-b1=20=EC=84=B1=EA=B3=B5?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- workbook_7319/bronze/2748-b1.py | 30 ++++++++++++++++++++++++++++++ 1 file changed, 30 insertions(+) create mode 100644 workbook_7319/bronze/2748-b1.py diff --git a/workbook_7319/bronze/2748-b1.py b/workbook_7319/bronze/2748-b1.py new file mode 100644 index 0000000..b972fda --- /dev/null +++ b/workbook_7319/bronze/2748-b1.py @@ -0,0 +1,30 @@ +# 피보나치 수 2 + +import sys + +input = sys.stdin.readline + +def solution(): + n = int(input().rstrip()) + + dp = [0] * 100 + dp[0] = 0 + dp[1] = 1 + + for i in range(2, n+1): + dp[i] = dp[i-1] + dp[i-2] + + print(dp[n]) + + return + + +solution() + +""" +걸린 시간: 3분 + +시간 복잡도: n까지 dp 테이블을 채우면 되므로 O(n)이다. + +해설: i번째 칸을 채우기 위해서는 i-1, i-2번째 값을 알아야하기 때문에 dp테이블에 이전 값들을 기록해가면서 현재 값을 채우면 된다. +""" \ No newline at end of file