75-tgyuuan

tgyuuAn/DP/산 모양 타일링.py

@@ -0,0 +1,19 @@
+def solution(n, tops):
+    top = set()
+    DIV = 10_007
+
+    count = 0
+    for idx, element in enumerate(tops):
+        if element==1: 
+            count += 1
+            top.add(2*(idx+1)+count)
+
+    DP = [0 for _ in range((n*2)+1+count+1)]
+    DP[1] = 1
+    DP[2] = 2
+
+    for now_idx in range(3,len(DP)):
+        if (now_idx-1) in top: DP[now_idx] = (DP[now_idx-3] % DIV) + (DP[now_idx-1] % DIV) % DIV
+        else: DP[now_idx] = (DP[now_idx-2] % DIV) + (DP[now_idx-1] % DIV) % DIV
+
+    return DP[-1] % DIV

tgyuuAn/README.md

@@ -79,4 +79,5 @@
 | 70차시 | 2024.08.16 |  스택  | <a href="https://www.acmicpc.net/problem/22866">탑 보기</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/232
 | 71차시 | 2024.08.20 |  다익스트라  | <a href="https://www.acmicpc.net/problem/24042">다익스트라</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/235
 | 72차시 | 2024.08.23 |  DFS + 트리  | <a href="https://www.acmicpc.net/problem/20188">등산 마니아</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/238
+| 75차시 | 2024.09.02 |  DP  | <a href="https://school.programmers.co.kr/learn/courses/30/lessons/258705">산 모양 타일링</a> | https://github.com/AlgoLeadMe/AlgoLeadMe-1/pull/243
 ---