Catch That Cow

Description

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

Output 

4

Hint

poj3278 有链接提示的题目请先去链接处提交程序，AC后提交到SDUTOJ中，以便查询存档。
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 <stdio.h>
#include <stdlib.h>
#include <string.h>
#define N 100005
int visit[N];
int x[N],s[N];
void bfs(int n,int m)
{
    int pre=0,post=0,px,ps;
    memset(visit,0,sizeof(visit));
    x[post]=n;
    s[post++]=0;
    visit[n]=1;
    while(pre<post)
    {
        px=x[pre];
        ps=s[pre++];
        if(px==m)
        {
            printf("%d\n",ps);
            break;
        }
        else
        {
            if(px-1>=0&&!visit[px-1])
            {
                x[post]=px-1;
                s[post++]=ps+1;
                visit[px-1]=1;
            }
            if(px+1<=N&&!visit[px+1])
            {
                x[post]=px+1;
                s[post++]=ps+1;
                visit[px+1]=1;
            }
            if(px*2<=N&&!visit[px*2])
            {
                x[post]=px*2;
                s[post++]=ps+1;
                visit[px*2]=1;
            }
        }
    }
}
int main()
{
    int n,m;
    while(scanf("%d%d",&n,&m)!=EOF)
        bfs(n,m);

    return 0;
}