Problem:
 Score : 300 points    Problem Statement As a token of his gratitude, Takahashi has decided to give his mother an integer sequence.
The sequence A needs to satisfy the conditions below:   A consists of integers between X and Y (inclusive).  For each 1\leq i \leq |A|-1 , A_{i+1} is a multiple of A_i and strictly greater than A_i .   Find the maximum possible length of the sequence.      Constraints  1 \leq X \leq Y \leq 10^{18}  All input values are integers.         Input Input is given from Standard Input in the following format:  X  Y       Output Print the maximum possible length of the sequence.        Sample Input 1 3 20      Sample Output 1 3  The sequence 3,6,18 satisfies the conditions.       Sample Input 2 25 100      Sample Output 2 3       Sample Input 3 314159265 358979323846264338      Sample Output 3 31

Solution (Python):

import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
from bisect import bisect
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
 
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

def main():
    x, y = MAP()
    count = 0
    while x <= y:
        x = 2 * x
        count += 1
    print(count)
if __name__ == "__main__":
    main()

Solution (Python):
x,y = map(int,input().split())
ans = 0
while x <= y:
    ans += 1
    x *= 2
print(ans)

Solution (Python):
a,b = map(int,input().split())

c = bin(b//a)

print(len(c)-2)

Solution (Python):
import sys

input = sys.stdin.readline


def main():
    X, Y = [int(x) for x in input().split()]
    ans = 0
    x = X
    while x <= Y:
        x = x * 2
        ans += 1
    print(ans)





if __name__ == '__main__':
    main()

Solution (Python):
x, y = map(int, input().split())
count = 0
while x <= y:
    count += 1
    x = x*2
print(count)

Solution (Python):
X,Y = map(int, input().split())
ans = 0
while X<=Y:
  ans += 1
  X *= 2
print(ans)

Solution (Python):
X, Y = map(int, input().split())

a = X
ans = 0

while True:
    if a <= Y:
        ans += 1
        a *= 2
    else:
        break

print(ans)

Solution (Python):
X, Y = map(int, input().split())
A = []
A.append(X)
for i in range(Y):
    if X * 2 <= Y:
        X *= 2
        A.append(X)
    else:
        break
print(len(A))

Solution (Python):

x,y = map(int, input().split())
cnt = 0
b = 1
while x*b<=y:
    cnt += 1
    b *= 2

print(cnt)

Solution (Python):
X, Y = map(int,input().split())
counter = 0
K=X
i = 0
while K <=Y:
  counter += 1
  K *= 2
  
print(counter)

Solution (Python):
x, y = map(int, input().split())

ans = 0

while x <= y:
    x *= 2
    ans += 1

print(ans)

Solution (Python):
x,y = map(int,input().split())

cnt=0

p=x

while p <= y:
    cnt+=1
    p=2*p


print(cnt)

Solution (Python):
x, y = map(int, input().split())
i = x
ans = [i]
while i <= y:
    i = i * 2
    if i <= y:
        ans.append(i)
print(len(ans))

Solution (Python):
X,Y = map(int, input().split())
ans = 0
while X <= Y:
    ans += 1
    X <<= 1
print(ans)

Solution (Python):
x, y = map(int, input().split())
cnt = 0
while x <= y:
    x *= 2
    cnt += 1
print(cnt)

Solution (Python):
X, Y = map(int, input().split())
b = 0
while True:
    Y = Y//2
    if Y < X:
        b += 1
        break
    b += 1
print(b)

Solution (Python):
x,y=map(int,input().split())
a=y//x
print(1+len(bin(a))-bin(a).find('1')-1)

Solution (Python):
A, Y = map(int, input().split())
ans = 0
while A<=Y:
  ans+=1
  A*=2
print(ans)

Solution (Python):
x, y = map(int, input().split())
ans = 0
while True:
  if x > y:
    break
  ans += 1
  x *= 2
print(ans)

Solution (Python):


import sys
input = sys.stdin.readline

"""
H = int(input())
h = [int(ele) for ele in input().split()]
h = [0] + h
"""


def main():
    A = []
    X, Y = map(int, input().split())
    n = X
    A.append(n)

    while n * 2 <= Y:
        n = n*2
        A.append(n)

    print(len(A))


def bfs(queue):
    global yet, graph
    if len(queue) == 0:
        return
    yet.remove(queue[-1])

    for i, adjacency in enumerate(graph[queue[-1]]):
        if adjacency == 1 and (i in yet) and (i not in queue):  
            queue.appendleft(i)
    else:
        queue.pop()
        bfs(queue)


def dfs(stack):
    global yet, graph
    yet.remove(stack[-1])

    for i, adjacency in enumerate(graph[stack[-1]]):
        if adjacency == 1 and i in yet:  
            stack.append(i)
            dfs(stack)
    else:
        stack.pop()


def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
        if i != n // i:
            divisors.append(n//i)
    return divisors


class Node():

    def __init__(self):
        self.idx = None
        self.left = None
        self.right = None
        self.parent = None
        return

    def pre_order(self):
        global pre_order_str
        pre_order_str += str(self.idx) + " "
        if self.left:
            self.left.pre_order()

        if self.right:
            self.right.pre_order()

    def in_order(self):
        global in_order_str

        if self.left:
            self.left.in_order()

        in_order_str += str(self.idx) + " "

        if self.right:
            self.right.in_order()

    def post_order(self):
        global post_order_str
        if self.left:
            self.left.post_order()

        if self.right:
            self.right.post_order()

        post_order_str += str(self.idx) + " "


class HeapHelper():
    """HeapContrler.
    完全二分木を二分ヒープで表現した配列 A に対して、
    HeapHelper.parent(idx) とするとそのノードの親の添字を返す
    存在しない場合は Falseを返す

    Returns:
        [type] -- [description]
    """

    def __init__(self):
        return

    @staticmethod
    def parent(i):
        if i == 1:
            return False

        return int(i/2)

    @staticmethod
    def left(i):
        l_idx = 2*i
        if H < l_idx:
            return False

        return l_idx

    @staticmethod
    def right(i):
        r_idx = 2*i + 1
        if H < r_idx:
            return False

        return r_idx


if __name__ == "__main__":
    main()

Solution (Python):
X,Y = (int(_) for _ in input().split())  
cnt = 1
tmp = X
while tmp*2 <= Y:
    
    cnt += 1
    tmp = tmp*2
print(cnt)

Solution (Python):
x,y=map(int,input().split())
ans=0
while x<=y:
    ans+=1
    x*=2
print(ans)

Solution (Python):
X, Y = map(int, input().split())

ans = 0
while X <= Y:
    X *= 2
    ans += 1

print(ans)

Solution (Python):
x,y=map(int,input().split())
n=y//x
print(len(bin(n))-2)

Solution (Python):
X, Y = map(int, input().split(' '))
cnt = 0
while X <= Y:
    X *= 2
    cnt += 1
print(cnt)

Solution (Python):
x,y=map(int,input().split())
cnt=1
while True:
  x*=2
  if x>y:
    break
  else:
    cnt+=1
print(cnt)

Solution (Python):
X, Y = map(int, input().split())
d = Y // X
p = 0
while d != 0:
  p += 1
  d //= 2
print(p)

Solution (Python):
import sys
input = sys.stdin.readline
x,y=map(int,input().split())
ans=1
for i in range(y-x):
    x*=2
    if x>y:
        break
    ans+=1
print(ans)

Solution (Python):

X, Y = map(int, input().split())

count = 0

while X <= Y:
  count += 1
  X *= 2

print(count)

Solution (Python):
import sys
import os
if sys.platform=="darwin":
	base = os.path.dirname(os.path.abspath(__file__))
	name = os.path.normpath(os.path.join(base, '../Documents/input.txt'))
	
	sys.stdin = open(name)

x,y = map(int,input().split())

a = x
ans = 0

while a <= y:
	
	ans = ans + 1
	a = a*2

print(ans)

Solution (Python):
X, Y = map(int, input().split())

ans = 0
while X <= Y:
  ans += 1
  X *= 2
print(ans)

Solution (Python):
temp=list(map(int, input().split()))
X=temp[0]
Y=temp[1]

ans=0
while True:
  ans+=1
  X*=2
  if X>Y:
    break
print(ans)

Solution (Python):
x,y = map(int, input().split())
ans=0
i=x
while i<=y:
    ans+=1
    i*=2
    
print(ans)

Solution (Python):
x, y = map(int, input().split())

ans = 0
for i in range(10000):
    ans+=1
    x*=2
    if x>y:
        break
print(ans)

Solution (Python):
x,y=map(int,input().split())
i=0
a=x*pow(2,i)
while a <= y:
  i+=1
  a=x*pow(2,i)
print(i)

Solution (Python):
X, Y = list(map(int, input().split()))
ans = 0
while X <= Y:
    ans += 1
    X = X * 2
print(ans)

Solution (Python):
x,y = map(int,(input().split()))

ans = 0

for i in range(10**18):
    x *= 2
    if x > y:
        ans = i+1
        break

print(ans)

Solution (Python):
x,y = map(int,input().split())

ans = 0
while x < y:
    ans += 1
    x *= 2
else:
    if x == y:
        ans += 1

print(ans)

Solution (Python):
x, y = map(int, input().split())

for i in range(100):
	if x * (2 ** i) > y:
		print(i)
		break

Solution (Python):
x,y = map(int,input().split())
ans = 0
while x <= y:
  x *= 2
  ans += 1
print(ans)

Solution (Python):


X, Y = map(int, input().split())

Z = Y // X

num = 0

while True:
    if Z < (1 << num):
        break
    num += 1
print(num)

Solution (Python):
x, y = map(int, input().split())

n = 1
while x * 2 ** n <= y:
    n += 1

print(n)

Solution (Python):
a,b = map(int, input().split())

cnt = 1
while 2*a<=b:
    a *= 2
    cnt += 1
print(cnt)

Solution (Python):
def main():
    x,y=map(int,input().split())
    m=x
    ans=1
    while m*2<=y:
        m *= 2
        ans += 1
    print(ans)
main()

Solution (Python):
a = input().split()
b=0
c=[int(a[0])]
while(0==0):
    if c[b]*2<=int(a[1]):
        c.append(c[b]*2)
        b+=1
    else:
        print(len(c))
        break

Solution (Python):
x, y = map(int, input().split())

count=0
while x <= y:
    x *= 2
    count+=1

print(count)

Solution (Python):

from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations
import sys
import bisect
import string
import math
import time
from fractions import gcd



def I(): return int(input())


def MI(): return map(int, input().split())


def LI(): return [int(i) for i in input().split()]


def LI_(): return [int(i)-1 for i in input().split()]


def StoI(): return [ord(i)-97 for i in input()]


def ItoS(nn): return chr(nn+97)


def input(): return sys.stdin.readline().rstrip()


def show(*inp, end='\n'):
    if show_flg:
        print(*inp, end=end)


YN = ['Yes', 'No']
MOD = 10**9+7
inf = float('inf')
IINF = 10**19
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
sys.setrecursionlimit(10**6)



show_flg = True


def main():
    X, Y = MI()
    tmp = math.log2(Y) - math.log2(X)
    
    if X * 2 ** (int(tmp) + 1) <= Y:
        print(int(tmp) + 2)
        return
    elif X * 2 ** int(tmp) <= Y:
        print(int(tmp) + 1)
        return
    elif X * 2 ** (int(tmp)-1) <= Y:
        print(int(tmp))
        return

    print(-1)

    return

    ans = 0
    c = X
    while c <= Y:
        c = c * 2
        ans += 1

    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):

from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations
import sys
import bisect
import string
import math
import time
from fractions import gcd



def I(): return int(input())


def MI(): return map(int, input().split())


def LI(): return [int(i) for i in input().split()]


def LI_(): return [int(i)-1 for i in input().split()]


def StoI(): return [ord(i)-97 for i in input()]


def ItoS(nn): return chr(nn+97)


def input(): return sys.stdin.readline().rstrip()


def show(*inp, end='\n'):
    if show_flg:
        print(*inp, end=end)


YN = ['Yes', 'No']
MOD = 10**9+7
inf = float('inf')
IINF = 10**19
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
sys.setrecursionlimit(10**6)



show_flg = True


def main():
    X, Y = MI()
    
    

    ans = 0
    c = X
    while c <= Y:
        c = c * 2
        ans += 1

    print(ans)



if __name__ == '__main__':
    main()

Solution (Python):
x,y=map(int, input().split()) 

for i in range(1,1000):
    if (x*2**i > y):
        print(i)
        exit()

Solution (Python):
X,Y = (int(_) for _ in input().split())  
def cal_num(x,y,cnt):
    if x*2 <= y:
        cnt += 1
        return(cal_num(x*2,y,cnt))
    else:
        return(cnt)
print(cal_num(X,Y,1))

Solution (Python):
X, Y=map(int, input().split())
counter=1
X*=2
while X<=Y:
  counter+=1
  X*=2
print(counter)

Solution (Python):
x,y = map(int, input().split())

a = x
ans = 0

while a <= y:
    a = a * 2
    ans += 1

print(ans)

Solution (Python):
import sys

x, y = map(int, sys.stdin.readline().split())

def main():
    a = x
    cnt = 0
    while a <= y:
        cnt += 1
        a *= 2
    return cnt

if __name__ == '__main__':
    ans = main()
    print(ans)

Solution (Python):
def solve(X, Y):
    tmp = X
    ans = 0
    while tmp <= Y:
        ans += 1
        tmp *= 2
    return ans

def main():
    X, Y = map(int, input().split())
    ans = solve(X, Y)
    print(ans)

if __name__ == "__main__":
    main()

Solution (Python):
x, y = map(int, input().split())

def solve():
  num = x
  ans = 0

  while num <= y:
    ans += 1
    num *= 2
  print(ans)

def main():
  solve()

if __name__ == "__main__":
  main()

Solution (Python):
x, y = map(int, input().split())
cnt = 0
while x <= y:
    cnt += 1
    x *= 2
print(cnt)

Solution (Python):
X,Y=map(int,input().split())
x=X
ans=0
while True:
    if x>Y:
        break
    else:
        x*=2
        ans+=1
print(ans)

Solution (Python):
x,y=map(int,input().split())
for i in range(1,1000):
  x*=2
  if x>y:
    print(i)
    break

Solution (Python):
X, Y = map(int, input().split())
cnt = 0
while True:
    if X < Y:
        cnt += 1
        X *= 2
    else:
        if X == Y:
            cnt += 1
        break
print(cnt)

Solution (Python):
x,y = map(int,input().split())
ans = 0
while x<=y:
  ans += 1
  x *= 2
print(ans)

Solution (Python):
X,Y=map(int,input().split())

cnt=0
while(X<=Y):
    X*=2
    cnt+=1
print(cnt)

Solution (Python):
x, y = map(int, input().split())
cnt = 0
while x <= y:
  cnt += 1
  x *= 2
print(cnt)

Solution (Python):
x, y = map(int, input().split())

ans = 0

while x <= y:
    x *= 2
    ans += 1
print(ans)

Solution (Python):
x,y=map(int,input().split())
ans = 0
while x<=y:
	x*=2
	ans+=1
print(ans)

Solution (Python):

import sys
x, y = map(int, sys.stdin.readline().split())
cnt =0
while True:
    if x <=y:
        cnt +=1
        x = x*2
    else:
        break

print(cnt)

Solution (Python):
x, y = map(int, input().split())
ans = 1
for i in range(80):
    x *= 2
    if x <= y:
        ans += 1
print(ans)

Solution (Python):
X, Y = map(int, input().split())

A = [X]

for i in range(0,10**8):
    Z = 2*A[i]
    if Z <= Y:
        A.append(Z)
        
    else:
        break
print(len(A))

Solution (Python):
x, y = map(int, input().split())

ans = 0
while x <= y:
    x <<= 1
    ans += 1

print(ans)

Solution (Python):
x, y = map(int, input().split())

check = 0
count = 0

while check == 0:
    count += 1
    x = x * 2
    if x > y:
        check = 1

print(count)

Solution (Python):
X, Y = map(int, input().split())

ans = 0
x = X
while x <= Y:
    x *= 2
    ans += 1

print(ans)

Solution (Python):
def solve():
    X, Y = map(int, input().split())
    
    ans = 0
    a = X
    while a <= Y:
        ans += 1
        a *= 2
    
    print(ans)


if __name__ == '__main__':
    solve()

Solution (Python):


[X, Y] = [int(i) for i in input().split()]

gift = [X]
now = X
while (True):
    new = 2 * now
    if new <= Y:
        gift.append(new)
        now = new
    else:
        break

print(len(gift))

Solution (Python):
X , Y = map(int,input().split())
now = X
ans = 0
while now <= Y:
    ans += 1
    now *= 2
print(ans)

Solution (Python):
X, Y = map(int, input().split())

count = 0
while X <= Y:
    X *= 2
    count += 1
    
print(count)

Solution (Python):
X,Y=map(int,input().split())
answer=len(str(bin(Y//X)))-2
print(answer)

Solution (Python):
def main():
    x,y=map(int,input().split())
    y //= x
    res = 1
    while y >= 2 :
        y //= 2
        res += 1
    return res

print(main())

Solution (Python):
def main():
    x,y=map(int,input().split())
    if y // x < 2:
        return 1
    y //= x
    res = 2
    while y >= 4 :
        y //= 2
        res += 1
    return res

print(main())

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
from collections import deque
def getN():
    return int(input())
def getList():
    return list(map(int, input().split()))
import math
import bisect
from logging import getLogger, StreamHandler, DEBUG, WARNING
logger = getLogger(__name__)
handler = StreamHandler()
handler.setLevel(DEBUG)
logger.setLevel(DEBUG)


logger.addHandler(handler)
def main():
    x, y = getList()
    ans = 0
    while(True):
        if x <= y:
            ans += 1
            x *= 2
        else:
            break

    print(ans)
if __name__ == "__main__":
    main()

Solution (Python):

X,Y = map(int, input().split())
ans = 0
while X <= Y:
    X *=2
    ans += 1

print(ans)

Solution (Python):
x,y = map(int,input().split())
ans = 1
while True:
  x = x*2
  if x>y:
    break
  ans+=1
print(ans)

Solution (Python):
x,y=map(int,input().split())
ans=0
while x<=y:
    x*=2
    ans+=1
print(ans)

Solution (Python):
x,y=map(int,input().split())
ans_li=[]
for i in range(1000):
    if x*(2**i)<=y:
        ans_li.append(i+1)
print(max(ans_li))

Solution (Python):
x,y = map(int,input().split())
cnt = 0
while x <= y:
    x *= 2
    cnt += 1
print(cnt)

Solution (Python):
X, Y = map(int, input().split())
k = Y // X
ans = 1
while 2 ** ans <= k:
    ans += 1
print(ans)

Solution (Python):


X, Y = map(int, input().split())
ans = 0
while X <= Y:
    X *= 2
    ans += 1
print(ans)

Solution (Python):
X, Y = map(int, input().split())

cnt = 0
while X <= Y:
    cnt += 1
    X *= 2

print(cnt)

Solution (Python):
x, y = map(int, input().split())

tmp = x
cnt = 1
while True:
    tmp*=2
    if tmp > y:
        break
    cnt+=1

print(cnt)

Solution (Python):
x,y = map(int,input().split())

ans = 0
while True:
    if x <= y:
        ans += 1
    else:
        print(ans)
        import sys
        sys.exit()
    x = x * 2

Solution (Python):
x, y = map(int, input().split())
count = 0
while x <= y:
    count += 1
    x *= 2
print(count)

Solution (Python):
x, y = map(int,input().split())
cnt = 0
while x <= y:
  x *= 2
  cnt += 1
print(cnt)

Solution (Python):
import sys

if sys.platform =='ios':
	sys.stdin=open('Untitled.txt')
input = sys.stdin.readline
def MAP(): return [int(s) for s in input().split()]

X,Y= MAP()
n=X
cnt=1
while True:
	if n*2 <= Y:
		n *= 2
		cnt += 1
	else:
		break

print(cnt)

Solution (Python):
X,Y=map(int, input().split())
Ans=0
a=X
while a<=Y:
    Ans+=1
    a*=2
print(Ans)

Solution (Python):
a,b=map(int,input().split())
ans=0

while b >= a:
  a*=2
  ans+=1

print(ans)

Solution (Python):
def main():

    X, Y = map(int, input().split())
    p = X
    ans = 1
    while 2*p <= Y:
        p *= 2
        ans += 1
    return ans

if __name__ == '__main__':
    print(main())

Solution (Python):
x,y=map(int,input().split())
cnt=1
while x*2<=y:
  x*=2
  cnt+=1
print(cnt)

Solution (Python):
X,Y=map(int,input().split())
i=X
m=1
while 2*i<=Y:
  i=2*i
  m+=1
print(m)

Solution (Python):
X, Y = map(int,input().split())
n = X
cnt = 1
while True:
    n *= 2
    if n>Y:
        print(cnt)
        exit()
    else:
        cnt+=1

Solution (Python):
x, y = map(int, input().split())
for i in range(1, 65):
  if x * (2**i) > y:
    print(i)
    break

Solution (Python):
x, y = map(int, input().split())
ans = 0

while x <= y:
    x *= 2
    ans += 1

print(ans)

Solution (Python):
X, Y = map(int, input().split())

ans = 0
a = X

while a <= Y:
    ans += 1
    a *= 2
print(ans)

Solution (Python):
a,b=map(int,input().split())
ans=0
while b>=a:
  a*=2
  ans+=1
print(ans)

Solution (Python):
x, y = map(int, input().split())

ans = 0

while x <= y:
    x *= 2
    ans += 1
print(ans)

Solution (Python):
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
    x,y=map(int,input().split())
    ans=0
    while(y>=x):
        ans+=1
        x*=2
    print(ans)
resolve()

Solution (Python):
x, y = map(int, input().split())

ans = 0
while x <= y:
    ans += 1
    x *= 2

print(ans)

Solution (Python):
from sys import stdin

a,b = [int(x) for x in stdin.readline().rstrip().split()]

num = a
point = 0

while num <= b:
    num *= 2
    point += 1

print(point)

Solution (Python):

X,Y = map(int, input().split())

ans = 1
for i in range(1,1000000000):
    if X*(2**i)<=Y:
        ans += 1
    else:
        break
print(ans)

Solution (Python):
a,b=map(int,input().split())
cnt=0
while a<=b:
    a*=2
    cnt+=1
print(cnt)

Solution (Python):
X, Y = list(map(int, input().split()))
ans = 1
n = 1
while X * (2 ** n) <= Y:
    ans += 1
    n += 1
print(ans)

Solution (Python):
import heapq as h
import math
import numpy as np
import copy
import itertools

 
x,y = map(int,input().split())
val = x
count = 0
while val <= y:
    count += 1
    val = val*2
print(count)

Solution (Python):
def examC():
    X, Y = LI()
    ans = (Y//X).bit_length()
    print(ans)

import sys,copy,bisect,itertools,heapq,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examC()

Solution (Python):
x, y = map(int, input().split())
c = 1
while y >= x*2:
  x *= 2
  c += 1
print(c)

Solution (Python):
X,Y=map(int,input().split())
cnt=0
while X<=Y:
  X*=2
  cnt+=1
print(cnt)

Solution (Python):
x,y=map(int,input().split())
c=0
while x<=y:
    x*=2
    c+=1
print(c)

Solution (Python):
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools
sys.setrecursionlimit(10**8)
mod = 10**9+7
mod2 = 998244353
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

x,y = inpl()
res = 0
while x*2**res <= y:
    res += 1
print(res)

Solution (Python):

import sys, math
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans=count=0

x,y=map(int,input().split())
while x<=y:
    x*=2
    count+=1
print(count)

Solution (Python):

import sys, math
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans=count=0

x,y=map(int,input().split())
while x<=y:
    x*=2
    count+=1
print(count)

Solution (Python):
import sys
import math

x, y = [int(x) for x in sys.stdin.readline().split()]

count = 0
while x <= y:
    count += 1
    x *= 2

print(count)

Solution (Python):
X,Y = map(int,input().split())
count = 0
while X <= Y:
    X *= 2
    count += 1
print(count)

Solution (Python):
x, y = map(int, input().split())

for i in range(1, 10**10):
    if x*(2**i) > y:
        print(i)
        exit()

Solution (Python):
x, y = map(int, input().split())

count = 0
while x <= y:
    x *= 2
    count += 1

print(count)

Solution (Python):

X, Y = list(map(int,input().split()))
p = X
count = 0
while p <= Y:
    p *= 2
    count += 1
print(count)

Solution (Python):
X, Y = map(int, input().split())

p = X
cnt = 0
while p <= Y:
    p *= 2
    cnt += 1

print(cnt)

Solution (Python):
X, Y = map(int, input().split())
ans = 0
while X <= Y:
    ans += 1
    X *= 2
print(ans)

Solution (Python):
x,y=map(int,input().split())

cnt=1
current=x

while 1:
    current*=2
    if current<=y:
        cnt+=1
    else:
        break

print(cnt)

Solution (Python):
X, Y = map(int, input().split())
counter = 1
while True:
    X *= 2
    if X <= Y:
        counter += 1
    else:
        break
print(counter)

Solution (Python):
from collections import deque
X, Y = [int(x) for x in input().split()]
ai = X
i = 0
while ai <= Y:
  ai *= 2
  i += 1
print(i)

Solution (Python):
X,Y=map(int,input().split())
print(len(bin(Y//X))-2)

Solution (Python):
X,Y = map(int,input().split(' '))
output_list = []
while X <= Y:
    output_list.append(X)
    X = X*2
print(len(output_list))

Solution (Python):
x,y=map(int,input().split())
n=0
while x<=y:
  x*=2
  n+=1
print(n)

Solution (Python):
a, b = map(int, input().split())
count=0
while a<=b:
    a=a*2
    count+=1
print(count)

Solution (Python):
x,y = map(int,input().split())
cur,count = x,1
while cur <= y:
  if cur * 2 <= y:
    cur *= 2
    count += 1
  else:
    break
print(count)

Solution (Python):
num_min, num_max = map(int, input().split())

def search(mult, ans):
    if mult*2 <= num_max:
        ans += 1
        search(mult*2, ans)
    else:
        print(ans)

search(num_min, 1)

Solution (Python):
X,Y = map(int,input().split())
ans = 1
val = X
while 1:
  val *= 2
  if val <= Y: ans += 1
  else: break
print(ans)

Solution (Python):
x, y = map(int, input().split())
count = 1
last = x
while True:
  last *= 2
  if last <= y:
    count += 1
  else:
    print(count)
    exit()

Solution (Python):
X , Y = map(int,input().split())
cnt = 0
x = X
while x <= Y:
    cnt += 1
    x *=  2
print(cnt)

Solution (Python):
x,y = map(int, input().split())
a = []
i = 0
while True:
    b = 2**i
    if b*x <=y:
        i+=1
    else:
        break
print(i)

Solution (Python):
x, y = map(int, input().split())
length = 0
number = x
while number <= y:
    length += 1
    number *= 2
print(length)

Solution (Python):
x,y=map(int,input().split())
cnt=0
while x<=y:
  cnt+=1
  x*=2
print(cnt)

Solution (Python):
x, y = map(int, input().split())
line = []
line.append(x)
tmp = x
while(tmp * 2 <= y):
    line.append(tmp * 2)
    tmp *= 2
print(len(line))

Solution (Python):

def main():
    X, Y = map(int, input().split())

    tmp = X
    cnt = 1

    
    while tmp * 2 <= Y:
        cnt += 1
        tmp = 2 * tmp
        


    print(cnt)
    



if __name__ == "__main__":
    main()

Solution (Python):
x,y=map(int,input().split())
ans=[x]
while x*2<=y:
    ans.append(x*2)
    x*=2
print(len(ans))

Solution (Python):
x,y=map(int, input().split())
z=x
ans=0
while z<=y:
    z=z*2
    ans+=1
print(ans)

Solution (Python):
x,y=map(int,input().split())

res=0
while x<=y:
    res+=1
    x=x*2


print(res)

Solution (Python):
k,s=map(int,input().split())
count=1
for i in range(s):
    if k*2<=s:
        k*=2
        count+=1
    else:
        break
print(count)

Solution (Python):
x,y=map(int,input().split())
ans=0
a=x
while a<=y:
    ans+=1
    a*=2
print(ans)

Solution (Python):
x,y= map(int, input().split())
ans=0
while x<=y:
    x*=2
    ans+=1
print(ans)

Solution (Python):
x,y=map(int,input().split())
ans=1
while x<=y:
  x*=2
  if x>y:
    print(ans)
  ans+=1

Solution (Python):
A,B=map(int,input().split())
ans=0
tmp=A
while tmp<=B:
  tmp*=2
  ans+=1
print(ans)

Solution (Python):
x,y=map(int,input().split())
cnt=0 
while x<=y:
    cnt+=1 
    x*=2 
print(cnt)

Solution (Python):
x, y = map(int, input().split())
cnt = 0

while True:
    if x > y:
        break
    x *= 2
    cnt += 1

print(cnt)

Solution (Python):
X,Y=map(int,input().split())
ans=1
while True:
    X*=2
    if X>Y:
        break
    ans+=1
print(ans)

Solution (Python):
x,y = map(int,input().split())
c = 0
while x <= y:
	x = x * 2
	c += 1
print(c)

Solution (Python):
X, Y = map(int, input().split())
ans = 1
while X < Y:
    X = X * 2
    if X <= Y:
        ans += 1
print(ans)

Solution (Python):
x, y = map(int, input().split())

flg = 0
cnt = 0
while flg == 0:
	x *= 2
	cnt += 1
	if(x > y):
		flg = 1
print (cnt)

Solution (Python):
x,y = [int(i) for i in input().split()]
ct = 0
while x <= y:
    x = 2*x
    ct += 1
    
print(ct)

Solution (Python):
X,Y=map(int,input().split())
ans=0
while X<=Y:
  X*=2
  ans+=1
print(ans)

Solution (Python):
X, Y = map(int, input().split())

print(len(bin(Y // X)[2:]))

Solution (Python):
x,y=map(int,input().split())
i=0
while True:
  if x*(2**i)>y:
    print(i)
    break
  else:
    i+=1

Solution (Python):

X, Y = list(map(int,input().split()))
a = X
count = 0
while Y >= a:
    a = a*2
    count += 1
print(count)

Solution (Python):
from math import log
X, Y = map(int, input().split())
a=0
while X<=Y:
    X*=2
    a+=1
print(a)

Solution (Python):


import sys

sys.setrecursionlimit(100000)
INF = float('inf')
MOD = 10**9+7
EPS = 10**-7





X,Y = [int(x) for x in input().split()]

n = X
ans = 0
while n <= Y:
    n *= 2
    ans += 1

print(ans)

Solution (Python):

import sys


def solve(X: int, Y: int):
    n=0
    while Y >= X*2**n:
        n+=1
    print(n)

    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    X = int(next(tokens))  
    Y = int(next(tokens))  
    solve(X, Y)

if __name__ == '__main__':
    main()

Solution (Python):
x, y = map(int, input().split())

for i in range(70):
    if x * (2**i) > y:
        print(i)
        break

Solution (Python):
def input():
    import sys
    return sys.stdin.readline().rstrip()


def main():
    import math
    import collections
    import itertools

    x, y = map(int, input().split())
    check = y // x
    n = 0
    while 2 ** n <= check:
        n += 1
    print(n)
    




if __name__ == '__main__':
    main()

Solution (Python):
X,Y=map(int,input().split())
d=Y-X
k= Y // X
if k <= 1:
  print(1)
  exit(0)
count=1
while(1):
  if k < 2**count:
    break
  elif k ==2**count:
    count+=1
    break
  else:
    count+=1
print(count)

Solution (Python):
X,Y = map(int, input().split())

num = Y//X
ans = 0
while num > 0:
    ans += 1
    num //= 2
    
print(ans)

Solution (Python):
X,Y=map(int,input().split())
count=0
while X<=Y:
  X*=2
  count+=1
print(count)

Solution (Python):
x, y = map(int, input().split())
total = 1
now = x
while now*2 <= y:
    now *= 2
    total += 1
print(total)

Solution (Python):
x,y=map(int,input().split())
ans=0
while x<=y:
    x*=2
    ans+=1
print(ans)

Solution (Python):
x,y=map(int,input().split())
a=0
while x<=y:
    x*=2
    a+=1
print(a)

Solution (Python):
import math
X, Y = map(int, input().split())

ans = 0
while X <= Y:
    X *= 2
    ans += 1
    
print(ans)

Solution (Python):
def main():
    X, Y = (int(i) for i in input().split())
    ans = 0
    while X <= Y:
        ans += 1
        X *= 2
    print(ans)

if __name__ == '__main__':
    main()

Solution (Python):
x,y=map(int,input().split())

ans=1
num=x
while num<=y:
  num*=2
  ans+=1
print(ans-1)

Solution (Python):
X, Y = map(int, input().split())

n = X
res = 0
while n <= Y:
  res += 1
  n *= 2

print(res)

Solution (Python):
x,y = list(map(int,input().split()))
n =[]
while x<=y:
  n.append(x)
  x*=2
print(len(n))

Solution (Python):
x, y = map(int, input().split())
res = 0
while(x <= y):
    x *= 2
    res += 1
print(res)

Solution (Python):
x,y = map(int,input().split())

ans = 1
for i in range(100):
  if 2*x <= y:
    x *= 2
    ans += 1
  else:
    break
print(ans)

Solution (Python):
x,y=map(int,input().split())
d = x
count = 0
while y>=d:
  count+=1
  d*=2      
print(count)

Solution (Python):


X, Y = map(int, input().split()) 
A = [X] 
while A[-1] * 2 <= Y: 
    A.append(A[-1] * 2)
print(len(A))