Created
April 15, 2020 10:00
-
-
Save niklasjang/a3e0cc2d5f18afe4d3ca67ec90cbfcdd to your computer and use it in GitHub Desktop.
[PS][DP]/[BOJ][1463][1로 만들기]
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
#include <iostream> | |
#include <queue> | |
using namespace std; | |
int dp[1000001]; | |
int main(void) { | |
int n = 0; | |
cin >> n; | |
queue<int> q; | |
q.push(1); | |
dp[1] = 0; | |
int curr = 0; | |
while (!q.empty()) { | |
curr = q.front(); | |
q.pop(); | |
if (curr * 3 <= n && !dp[curr * 3]) { | |
dp[curr * 3] = dp[curr] + 1; | |
q.push(curr * 3); | |
} | |
if (curr * 2 <= n && !dp[curr * 2]) { | |
dp[curr * 2] = dp[curr] + 1; | |
q.push(curr * 2); | |
} | |
if (curr + 1 <= n && !dp[curr + 1]) { | |
dp[curr + 1] = dp[curr] + 1; | |
q.push(curr + 1); | |
} | |
} | |
cout << dp[n] << "\n"; | |
return 0; | |
} |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
//틀린 풀이
//10 입력하면 4가 출력된다.