1. BOJ 12852 1로만들기2 실버 1, DP, 그래프탐색 https://www.acmicpc.net/problem/12852 코드 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 N = int(input()) dp = [0]*(10**6+1) ans = [N] for i in range(2,N+1): if i%6==0: dp[i] = (min(dp[i//3]+1, dp[i//2]+1)) elif i%3==0: dp[i] = (min(dp[i//3]+1, dp[i-1]+1)) elif i%2==0: dp[i] = (min(dp[i//2]+1, d..