思路没问题，但样例都过不了

#include<bits/stdc++.h>
using namespace std;
int n;
int dp[1000001];
int main(){
	cin >> n;
	for(int i = 2;i <= n;i++)
		if(i / 2 == 0)
			dp[i] = min(dp[i / 2] + 1,dp[i - 1] + 1);
		else
			dp[i] = dp[i - 1] + 1;
	cout << dp[n] << endl;
	return 0;
}