Catch That Cow

来源:互联网 发布:mac播放器哪个好 编辑:程序博客网 时间:2024/06/14 10:51

Description

Farmer John has been informed of the location of a fugitive cow andwants 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 oftransportation: 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 longdoes 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
代码



0 0