Informatica Online Judge

  catch that cow [1782 / 06F6]

Time Limit(Test case) : 1000(ms)
Number of users who solved : 29   Total Tried : 32

The Champion of this Problem (C++) : gs17003 - 0ms / 262byte
My Best Submission (C++) : N/A



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?


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


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

IO Example

Sample Input
5 17

Sample Output

Submit : [C/C++] | [C++11] | [Obj-C] | [Java] | [Python]
Prob Analysis : [Problem Statistics] | [Solution]