Day 27 B. Two Buttons

Problem
Vasya has found a strange device. On the front panel of a device there are: a red button, a blue button and a display showing some positive integer. After clicking the red button, device multiplies the displayed number by two. After clicking the blue button, device subtracts one from the number on the display. If at some point the number stops being positive, the device breaks down. The display can show arbitrarily large numbers. Initially, the display shows number n.

Bob wants to get number m on the display. What minimum number of clicks he has to make in order to achieve this result?

Input
The first and the only line of the input contains two distinct integers n and m (1 ≤ n, m ≤ 104), separated by a space .

Output
Print a single number — the minimum number of times one needs to push the button required to get the number m out of number n.

Examples
input
4 6
output
2

input
10 1
output
9

Note
In the first example you need to push the blue button once, and then push the red button once.

In the second example, doubling the number is unnecessary, so we need to push the blue button nine times.

题目大致意思为：有两个按钮 一个可以让数字自身乘以2 一个可以让数字自身减1 问最少需要多少次操作 能让n变成m

#include<iostream>
#include<algorithm>
#include<string.h>
#include<vector>
#include<stdio.h>
#include<limits.h>
#include<cmath>
#include<set>
#include<map>
#define ll long long
using namespace std;
int main()
{
	int n, m;
	int ans = 0;
	cin >> n >> m;
	if (n >= m)//很显然 如果要变化的数字大于最后的数字 只能不断按-1按钮 
	{
		cout << n - m << endl;
	}
	else
	//如果n < m 那么有两种情况 
	//一种m为偶数时 可以让m/2 
	//一种m为奇数时 可以让m先变成m+1 因为最后一步肯定是按下-1按钮 
	//相当于先统计要按多少*2的按钮 再补上-1的按钮
	{
		while (n < m)
		{
			if (m % 2 != 0)
			{
				m++;
				ans++;
			}
			m /= 2;
			ans++;
		}
		ans += n - m;
		cout << ans << endl;
	}
	return 0;
}