Merge pull request #68 from AlgoLeadMe/17-wkdghdwns199

17-wkdghdwns199

wkdghdwns199/README.md

@@ -18,4 +18,5 @@
 | 14차시 | 2024.03.13 | 집합과 맵 |  <a href="https://www.acmicpc.net/problem/20920">영단어 암기는 괴로워</a>  | <a href="">2024.03.13</a> |
 | 15차시 | 2024.03.20 | 우선순위 큐 |  <a href="https://www.acmicpc.net/problem/11286">절댓값 힙</a>  | <a href="">2024.03.20</a> |
 | 16차시 | 2024.03.23 | 조합론 |  <a href="https://www.acmicpc.net/problem/11050">이항 계수 1 </a>  | <a href="">2024.03.23</a> |
+| 17차시 | 2024.03.27 | DP |  <a href="https://www.acmicpc.net/problem/9184">신나는 함수 실행</a>  | <a href="">2024.03.27</a> |
 

wkdghdwns199/동적_계획법_1/ACM-24416.py

@@ -0,0 +1,25 @@
+import sys
+input = sys.stdin.readline
+
+def fib(n) :
+    global countFib
+    if n==1 or n==2:
+        countFib += 1
+        return 1
+    else :
+        return fib(n-1) + fib(n-2)
+
+def fibo(n):
+    global countFibo
+    f = [0 for _ in range(n+1)]
+    f[1] = f[2] = 1
+    for idx in range(3, n+1):
+        countFibo+=1
+        f[idx] = f[idx-1] + f[idx-2]
+    return f[n]
+
+N = int(input())
+countFib = countFibo = 0
+fib(N)
+fibo(N)
+print(countFib, countFibo)

wkdghdwns199/동적_계획법_1/ACM-9184.py

@@ -0,0 +1,25 @@
+import sys
+input = sys.stdin.readline
+
+def w(a,b,c):
+    if a<=0 or b<=0 or c<=0 :
+        return 1
+    if a>20 or b>20 or c>20:
+        return w(20,20,20)
+    if dp[a][b][c] :
+        return dp[a][b][c]
+    if a<b<c:
+        dp[a][b][c] = w(a,b,c-1)+w(a,b-1,c-1)-w(a,b-1,c)
+        return dp[a][b][c]
+    dp[a][b][c] = w(a-1,b,c)+w(a-1,b-1,c)+w(a-1,b,c-1)-w(a-1,b-1,c-1)
+    return dp[a][b][c]
+
+
+dp = [[[0] * 21 for _ in range(21)] for _ in range(21)] 
+
+while True:
+    a,b,c = map(int, input().split())
+    if a==b==c==-1 : break
+    print(f'w({a}, {b}, {c}) = {w(a,b,c)}')
+
+

wkdghdwns199/리뷰풀이/ACM-16234.py

@@ -0,0 +1,46 @@
+import sys
+from collections import deque
+input = sys.stdin.readline
+N,L,R = map(int, input().split())
+country = [list(map(int, input().split())) for _ in range(N)]
+q = deque()
+#연합이 될 수 있을지 확인 후 연랍이 되면 저장
+dx = [1,0,-1,0]
+dy = [0,1,0,-1]
+
+def bfs(x,y):
+    q.append((x,y))
+    union=[]
+    union.append((x,y))
+    while q:
+        a,b = q.popleft()
+        for i in range(4):
+            na = a + dx[i]
+            nb = b + dy[i]
+            if na >= N or nb>= N or nb<0 or na <0 or visited[na][nb]==1:
+                continue
+            if R>=abs(country[a][b]-country[na][nb]) >= L:
+                visited[na][nb] = 1
+                q.append((na,nb))
+                union.append((na,nb))
+    if len(union)<=1:
+        return 0
+    result=sum(country[a][b] for a,b in union) // len(union)
+    for a,b in union:
+        country[a][b] = result
+
+    return 1
+day=0
+
+while True :
+    stop = 0
+    visited = [[0]*N for _ in range(N)]
+    for i in range(N):
+        for j in range(N):
+            if visited[i][j] == 0:
+                visited[i][j] = 1
+                stop += bfs(i,j)
+    if stop ==0:
+        break
+    day+=1
+print(day)