Catch That Cow

Farmer John has been informed of the location of a fugitive cow and wants to catch her immediately. He starts at a point N (0 ≤ N ≤ 100,000) on a number line and the cow is at a point K (0 ≤ K ≤ 100,000) on the same number line. Farmer John has two modes of transportation: walking and teleporting.

* Walking: FJ can move from any point X to the points X - 1 or X + 1 in a single minute
* Teleporting: FJ can move from any point X to the point 2 × X in a single minute.

If the cow, unaware of its pursuit, does not move at all, how long does it take for Farmer John to retrieve it?

Input

Line 1: Two space-separated integers: N and K

Output

Line 1: The least amount of time, in minutes, it takes for Farmer John to catch the fugitive cow.

Sample Input

5 17

Sample Output

4

Hint

The fastest way for Farmer John to reach the fugitive cow is to move along the following path: 5-10-9-18-17, which takes 4 minutes

 

#include <iostream>
#include<stdio.h>
#include<queue>
#include<string.h>
using namespace std;
struct ff
{
    int loc;
    int step;
};

int a[900010];
int n,k,flag=0;
void bfs()
{
	queue<ff>q;
    ff e;
    e.loc=n;e.step=0;
    a[n]=1;
    q.push(e);
    while(!q.empty())
    {
        ff e1=q.front(),e2;
        q.pop();
        if(e1.loc==k)
        {
            printf("%d\n",e1.step);break;
        }
        for(int i=0;i<3; i++)
        {
            if(i==0)e2.loc=e1.loc+1;
            if(i==1)e2.loc=e1.loc-1;
            if(i==2)e2.loc=e1.loc*2;
            if(e2.loc>=0&&a[e2.loc]==0&&e2.loc<100005)
            { 
                e2.step=e1.step+1;
                q.push(e2);
                a[e2.loc]=1; 
            } 
        }


    }

}
int main()
{
    while(scanf("%d%d",&n,&k)!=EOF)
    {
    	memset(a,0,sizeof(a));
    	bfs();
	}
    
    return 0;
}