CodeForces 520B【Two Buttons】

最新推荐文章于 2020-11-02 12:29:32 发布

风卷云飞会天黑

最新推荐文章于 2020-11-02 12:29:32 发布

阅读量2.3k

点赞数 1

分类专栏： ACM

本文链接：https://blog.csdn.net/castledrv/article/details/45305577

版权

ACM 专栏收录该内容

32 篇文章 0 订阅

订阅专栏

Description

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 ≤ 10⁴), 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.

Sample Input

Input

4 6

Output

Input

10 1

Output

Hint

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.

找规律。

当n>m,结果是 n-m；

当n<m时分组讨论。

①：m为奇数时，让m + 1然后除以 2，

例如n=3，m=5。（m+1）/2=3；

也就是3*2-1=5；两步能够得到5.

②：m为偶数时，直接先除以2。

例如：n=3，m=8； m/2=4；

此时 m=4，n=3；m仍为偶数且大于n，继续除以2

m/=2,得到m=2;这时候m<n。

由n到m只需要一直减去1就行了。

即n-m=1，由于前面除了两次，也加上。结果就是3；

这以上的的终止条件就是m<=n;

代码就出来了：

#include<cstdio>
#include<cmath>
#include<iostream>
using namespace std;

int main()
{
    int m,n,sum=0;
    scanf("%d%d",&m,&n);
    if(m>n)
        sum=m-n;
    else
    {

        while((n-m)!=0)
        {
            if(n%2==0&&n>m)
            {
                n/=2;
                sum++;
            }
            else
            {

                if(m>=n)
                {
                    sum+=m-n;
                    break;
                }
                n=(n+1)/2;
                sum+=2;


            }
        }

    }
    cout<<sum<<endl;

    return 0;
}