Catch That Cow
Time Limit : 5000/2000ms (Java/Other) Memory Limit : 32768/32768K (Java/Other)
Total Submission(s) : 219 Accepted Submission(s) : 74
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.<br><br>* Walking: FJ can move from any point X to the points X - 1 or X + 1 in a single minute<br>* Teleporting: FJ can move from any point X to the point 2 ¡Á X in a single minute.<br><br>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<br>
Sample Output
4<br><br><div style='font-family:Times New Roman;font-size:14px;background-color:F4FBFF;border:#B7CBFF 1px dashed;padding:6px'><div style='font-family:Arial;font-weight:bold;color:#7CA9ED;border-bottom:#B7CBFF 1px dashed'><i>Hint</i></div>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.</div>
Source
USACO 2007 Open Silver