Submission #2975499

---

Source Code Expand

from collections import defaultdict
import sys,heapq,bisect,math,itertools,string,queue,datetime
sys.setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
AtoZ = [chr(i) for i in range(65,65+26)]
atoz = [chr(i) for i in range(97,97+26)]

def inpl(): return list(map(int, input().split()))
def inpl_s(): return list(input().split())

N,S,T = inpl()
ans = 0

def UP(x,n):
	if x == T:
		print(n)
		return True
	elif x > T:
		return False
	else:
		return UP(x*2,n+1) or UP(x*2+1,n+1)

if not UP(S,0):
	print(-1)

Submission Info

Judge Result