2025-01-31

g0rnn/README.md

@@ -15,6 +15,10 @@
 | 11차시 | 2024.12.30 |   dp    |               [기타리스트](https://www.acmicpc.net/problem/1495)               | https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/49 |
 | 12차시 | 2025.01.02 |   bfs   |               [회장뽑기](https://www.acmicpc.net/problem/2660)                | https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/50 |
 | 13차시 | 2025.01.05 |  백트래킹   |             [스타트와 링크](https://www.acmicpc.net/problem/14889)              | https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/52 |
+| 14차시 | 2025.01.07 |  백트레킹   |              [N-Queen](https://www.acmicpc.net/problem/9663)              | https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/53 |
+| 15차시 | 2025.01.05 |  백트래킹   |             [알파벳](https://www.acmicpc.net/problem/1987)              | https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/60 |
+| 16차시 | 2025.01.18 |  다익스트라   |             [최단경로](https://www.acmicpc.net/problem/1753)              | https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/62 |
+| 17차시 | 2025.01.31 |  dp   |             [설탕 배달](https://www.acmicpc.net/problem/2839)              | https://github.com/AlgoLeadMe/AlgoLeadMe-12/pull/68 |
 
 
 ---

g0rnn/dp/Sol2839.java

@@ -0,0 +1,24 @@
+import java.util.*;
+
+public class Sol2839 {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+
+        int n = sc.nextInt();
+
+        int[] dp = new int[5001];
+
+        dp[0] = dp[1] = dp[2] = dp[4] = Integer.MAX_VALUE;
+        dp[3] = 1;
+        dp[5] = 1;
+
+        for(int i = 6; i <= n; i++) {
+            if(dp[i-3] == Integer.MAX_VALUE && dp[i-5] == Integer.MAX_VALUE)
+                dp[i] = Integer.MAX_VALUE;
+            else
+                dp[i] = Integer.min(dp[i-3], dp[i-5]) + 1;
+        }
+        System.out.println((dp[n] == Integer.MAX_VALUE) ? -1 : dp[n]);
+        sc.close();
+    }
+}