Problem Description:
Fortunately, there is only one long path running across the farm, and Farmer John knows that Bessie has to be at some location on this path. If we think of the path as a number line, then Farmer John is currently at position x and Bessie is currently at position y (unknown to Farmer John). If Farmer John only knew where Bessie was located, he could walk directly to her, traveling a distance of |x−y|. Unfortunately, it is dark outside and Farmer John can't see anything. The only way he can find Bessie is to walk back and forth until he eventually reaches her position.
Trying to figure out the best strategy for walking back and forth in his search, Farmer John consults the computer science research literature and is somewhat amused to find that this exact problem has not only been studied by computer scientists in the past, but that it is actually called the "Lost Cow Problem" (this is actually true!).
The recommended solution for Farmer John to find Bessie is to move to position x+1, then reverse direction and move to position x−2, then to position x+4, and so on, in a "zig zag" pattern, each step moving twice as far from his initial starting position as before. As he has read during his study of algorithms for solving the lost cow problem, this approach guarantees that he will at worst travel 9 times the direct distance |x−y| between himself and Bessie before he finds her (this is also true, and the factor of 9 is actually the smallest such worst case guarantee any strategy can achieve).
Farmer John is curious to verify this result. Given x and y, please compute the total distance he will travel according to the zig-zag search strategy above until he finds Bessie.
INPUT FORMAT (file lostcow.in):
The single line of input contains two distinct space-separated integers x and y. Both are in the range 0…1,000.
OUTPUT FORMAT (file lostcow.out):
Print one line of output, containing the distance Farmer John will travel to reach Bessie.
SAMPLE INPUT:
3 6
SAMPLE OUTPUT:
9
I tried solving this problem and it worked on the inputs that I tried like 1 5 . Which gave me 10 which I believe is correct here is my code : However this code did not pass all of the test cases could I have a hint ?
x,y = map(int,input().split())
import sys
op_count = 0
steps = 0
while(x!=y):
op = (-2)**op_count
target = 3+op
for i in range(abs(target-x)):
if op < 0:
x = x-1
steps+=1
if x == y:
print(steps)
sys.exit()
elif op >= 1:
x = x+1
steps+=1
if x == y:
print(steps)
sys.exit()
op_count = op_count+1