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
Sample Output

4

http://blog.csdn.net/tigerisland45/article/details/52149096

#include
#include
int main()
{
int N,K,x,j=0;
scanf("%d %d",&N,&K);
if(N>=0||N<=100000||K>=0||K<=100000)
{
if((N-K)<=0)
{
while(N {
N*=2;
j++;
}
if(abs(K-N)>=abs(N/2-K)) j=K-N/2+j-1;
else j=N-K-1+j;
}

else
{
x=N-K;
j=x;
}

 printf("%d",j);
    return 0;
}

}