[알고리즘] 1로 만들기

import java.io.BufferedReader;
import java.io.InputStreamReader;

public class Main {
	public static void main(String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int N = Integer.parseInt(br.readLine());
		
		int[] dp = new int[N * 3 + 1];
		for (int i = 0; i < dp.length; i++) {
			dp[i] = Integer.MAX_VALUE;
		}
		dp[1] = 0;
		for (int i = 1; i <= N; i++) {
			
			dp[i * 3] = Math.min(dp[i * 3], dp[i] + 1);
			dp[i * 2] = Math.min(dp[i * 2], dp[i] + 1);
			dp[i + 1] = Math.min(dp[i + 1], dp[i] + 1);
		}
		System.out.println(dp[N]);
	}
}