Upload week16_DP_pdf(0407)

Author: zaqquum

_WeeklyChallenges/W16-[DP]/Assignment_BOJ_1562_계단수.py

@@ -0,0 +1,34 @@
+'''
+BOJ #1562. 계단수 (골드 1)
+https://www.acmicpc.net/problem/1562
+유형: 비트마스킹, DP
+'''
+
+N = int(input())
+MOD = 1_000_000_000
+BIT = 1 << 10
+
+dp = [[[0] * BIT for _ in range(10)] for _ in range(N)]
+
+for j in range(1, 10):
+    dp[0][j][1 << j] = 1
+
+for i in range(1, N):
+    for j in range(10):
+        for bit in range(BIT):
+            nxt_bit = bit | 1 << j
+
+            if 0 < j:
+                dp[i][j][nxt_bit] += dp[i - 1][j - 1][bit]
+
+            if j < 9:
+                dp[i][j][nxt_bit] += dp[i - 1][j + 1][bit]
+
+            dp[i][j][nxt_bit] %= MOD
+
+cnt = 0
+for j in range(10):
+    cnt += dp[N - 1][j][BIT - 1]
+    cnt %= MOD
+
+print(cnt)

_WeeklyChallenges/W16-[DP]/README.md

@@ -0,0 +1,16 @@
+## 🚀4월 1주차 (4/07) 스터디 발제 주제: DP 
+> 발제자: 김홍주
+
+> 주제: DP
+### 🗂️ 스터디 자료
+- PDF: [바로가기
+](./Study_BOJ_10844.pdf)
+
+### 📖 문제
+- [백준 #10844. 쉬운계단수](https://www.acmicpc.net/problem/10844): DP / 실버1
+- 정답 코드: [Study_BOJ_2293_10844_쉬운계단수.py](./Study_BOJ_10844_쉬운계단수.py)
+
+
+### 💻 과제
+- [백준 #1562. 계단수](https://www.acmicpc.net/problem/1562): 비트마스킹,DP / 골드 1
+- 정답 코드: [Assignment_BOJ_1562_계단수.py](./Assignment_BOJ_1562_계단수.py)

_WeeklyChallenges/W16-[DP]/Study_BOJ_10844.pdf

@@ -0,0 +1,27 @@
+'''
+BOJ #10844. 쉬운 계단수 (실버1)
+https://www.acmicpc.net/problem/10844
+유형: DP
+'''
+
+n = int(input())
+
+Mod = 1000000000
+# 1. 초기화
+# dp [총 길이 i ][마지막 자리수가 j] = 인 개수
+dp = [[0]*10 for _ in range(n+1)]
+dp[1][0] = 0 
+for j in range(1,10):
+    dp[1][j]= 1
+
+# 2 점화식 N>=2
+for i in range(2,n+1):
+    for j in range(10):
+        if j== 0 : 
+            dp[i][j] = dp[i-1][j+1]    
+        elif j==9:
+            dp[i][j] = dp[i-1][j-1]
+        else : 
+            dp[i][j] = dp[i-1][j-1] + dp[i-1][j+1]
+
+print(sum(dp[n])%Mod)