
Catch That Cow 
Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:65536KB 
Total submit users: 22, Accepted users: 21 
Problem 10776 :
No special judgement

Problem 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 spaceseparated 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 
Judge Tips 
The fastest way for Farmer John to reach the fugitive cow
is to move along the following path: 51091817, which takes 4 minutes.

Problem Source 
USACO 2007 Open Silver

Submit
Discuss
Judge Status
Problems
Ranklist

