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

multiple cases, each case has two space-separated integers: N and K in one line.

Output

for each case, output the least amount of time, in minutes, it takes for Farmer John to catch the fugitive cow in one line.

Sample Input

5 17
3 7

 

Sample Output

4
2

 

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<cstring> #include<queue> using namespace std; bool u[100005]; int s,e; struct Point{ int x,step; }; int BFS(int x) { queue<Point> que; Point tp,a; int tx; a.x=x,a.step=0; u[x]=false; que.push(a); while(!que.empty()) { tp=que.front(); que.pop(); tx=tp.x+1; if(tx<0||tx>100000); else { if(u[tx]) { u[tx]=false,a.x=tx,a.step=tp.step+1,que.push(a); if(a.x==e)return a.step; } } tx=tp.x-1; if(tx<0||tx>100000); else { if(u[tx]) { u[tx]=false,a.x=tx,a.step=tp.step+1,que.push(a); if(a.x==e)return a.step; } } tx=2*tp.x; if(tx<0||tx>100000); else { if(u[tx]) { u[tx]=false,a.x=tx,a.step=tp.step+1,que.push(a); if(a.x==e)return a.step; } } } } int main() { while(cin>>s>>e) { if(s==e) { cout<<"0"<<endl; continue; } memset(u,true,sizeof(u)); cout<<BFS(s)<<endl; } return 0; }