10-csecaujunseo

caucsejunseo/README.md

@@ -13,4 +13,3 @@
 | 9차시 | 2025.04.30 | 문자열   | [듣보잡](https://www.acmicpc.net/problem/1764)|https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/35|
 |10차시| 2025.05.05 |   DP  | [1로만들기](https://www.acmicpc.net/problem/1463)|https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/38|
 |11차시| 2025.05.07 |  DP   | [1,2,3더하기](https://www.acmicpc.net/problem/9095)|https://github.com/AlgoLeadMe/AlgoLeadMe-13/pull/41|
-

caucsejunseo/다이나믹(dp)/2025.05.05.1로만들기.c

@@ -0,0 +1,39 @@
+#define _CRT_SECURE_NO_WARNINGS
+#include <stdio.h>
+#include <stdlib.h>
+#define MIN(a,b) ((a) < (b) ? (a) : (b))
+#define MAX 1000001
+
+
+int main() {
+
+    int N = 0;
+    scanf("%d", &N);
+
+    int* dp = (int*)malloc(sizeof(int) * MAX);
+
+    if (dp == NULL) {
+        printf("메모리 할당 실패!\n");
+        return 1;
+    }
+
+    dp[1] = 0;
+
+    for (int i = 2; i < N + 1; i++)
+    {
+        dp[i] = dp[i - 1] + 1;
+
+        if (i % 3 == 0)
+        {
+            dp[i] = MIN(dp[i], dp[i / 3] + 1);
+        }
+        if (i % 2 == 0)
+        {
+            dp[i] = MIN(dp[i], dp[i / 2] + 1);
+        }
+    }
+
+    printf("%d", dp[N]);
+
+    return 0;
+}