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 <stdio.h>
#include <string.h>
struct note
{
	int x;
	int s;
};
struct note A[100010],B; 
int book[100010];
int main()
{
	int n,k,head,tail;
	while(scanf("%d%d",&n,&k)!=EOF)
	{
		memset(book,0,sizeof(book));
		if(n>=k)
			printf("%d\n",n-k);
		else
		{
			head=0;tail=0;//队列初始化 
			A[tail].x=n;//将起点加入队列 
			A[tail].s=0;
			tail++;
			book[n]=1; 
			while(head<tail)
			{
			//	printf("A[head]----%d\n",A[head]);
				B=A[head];
				//printf("B---%d\n",B);
				if(B.x+1>0&&B.x+1<100010&&book[B.x+1]==0)
				{
					A[tail].x=B.x+1;
					A[tail].s=B.s+1;
					tail++;
					book[B.x+1]=1;
					if(B.x+1==k)
					{
						printf("%d\n",B.s+1);
						break;
					}
				}
				if(B.x-1>0&&B.x-1<100010&&book[B.x-1]==0)
				{
					A[tail].x=B.x-1;
					A[tail].s=B.s+1;
					tail++;
					book[B.x-1]=1;
					if(B.x-1==k)
					{
						printf("%d\n",B.s+1);
						break;
					}
				}
				if(B.x*2>0&&B.x*2<100010&&book[B.x*2]==0)
				{
					A[tail].x=B.x*2;
					A[tail].s=B.s+1;
					tail++;
					book[B.x*2]=1;
					if(B.x*2==k)
					{
						printf("%d\n",B.s+1);
						break;
					}
				}
				head++;
				//printf("head---%d\n",head);
			}	
		} 
	}
	return 0;
}