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
from io import StringIO
import unittest

def resolve():
    x, y = map(int, input().split())

    ans = [x]

    while 1:
        tmp = ans[-1] * 2
        if tmp > y:
            break
        else:
            ans.append(tmp)
            
    print(len(ans))

class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)
    def test_入力例_1(self):
        input = """3 20"""
        output = """3"""
        self.assertIO(input, output)
    def test_入力例_2(self):
        input = """25 100"""
        output = """3"""
        self.assertIO(input, output)
    def test_入力例_3(self):
        input = """314159265 358979323846264338"""
        output = """31"""
        self.assertIO(input, output)

if __name__ == "__main__":
    
    resolve()

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())

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

print(ans)

Solution (Python):
X,Y = map(int,input().split())
ans = []
ans.append(X)

while max(ans)*2 <= Y:
    ans.append(max(ans)*2)
print(len(ans))

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

while True:
  if X*2 <= Y:
    count +=1
    X = X*2
  else:
    break
    
print(count)

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

ans = 0
tmp = X

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

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

Solution (Python):

import sys


def solve(X: int, Y: int):
    print((Y // X).bit_length())


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())
ans = 0
while x <= y:
  ans += 1
  x *= 2
print(ans)

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

Solution (Python):
import math

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

ans = 1
a = y
for i in range(10**9) :
  if a < x or a == 1:
    break
  x_t = x
  ans_t = 1
  for j in range(10**9) :
    x_t = x_t*2
    if x_t > y :
      break
    ans_t += 1
  ans = max(ans,ans_t)
  a = math.floor(a**0.5)

print(ans)

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

r = 1
while True :
  if a*2 > b :
    break
  r+=1
  a = 2*a
  
print(r)

Solution (Python):
from math import log
x, y = map(int, input().split())
for i in range(64):
    x *= 2
    if x > y:
        print(i + 1)
        exit()

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

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

Solution (Python):
x, y = map(int, input().split())
ans = 0
num = x
while num <= y:
  num *= 2
  ans += 1
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())
ans = 0
while x <= y:
  ans += 1
  x *= 2
print(ans)

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

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

count = 1
a = X

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

print(count)

Solution (Python):
import sys
input = sys.stdin.readline

def main():
    a, b = map(int, input().split())
    ans = 0
    while a <= b:
        ans += 1
        a *= 2
    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
import sys
sys.setrecursionlimit(10000)

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


if y == x:
    print(1)
    exit()

asn = 0
def dfs(x,y,n):
    
    n += 1
    ans = x*2**n
    if ans > y:
        return n
    else:
        return dfs(x,y,n)

a = dfs(x,y,1)

print(a)

Solution (Python):
import sys
sys.setrecursionlimit(10000)

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

if y == 1:
    print(1)
    exit()

if y == x:
    print(1)
    exit()



asn = 0
def dfs(x,y,n):
    
    n += 1
    ans = x*2**n
    if ans > y:
        return n
    else:
        return dfs(x,y,n)

a = dfs(x,y,1)

print(a)

Solution (Python):
x, y = list(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 True:
    if x > y:
        break
    ans += 1
    x *= 2
print(ans)

Solution (Python):
x,y=map(int,input().split())
ans=1
while 2*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:
        break 
    ans += 1

print(ans)

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

Solution (Python):
x,y = map(int,input().split())
r = 1
for i in range(1,10**3):
  if x * r > y:
    print(i-1)
    exit()
  r *= 2

Solution (Python):
def main():
    f, t = [int(v) for v in input().split(' ')]
    count = 0
    d = 1
    tmp = f
    while True:
        tmp = tmp * 2
        if tmp > t:
            break
        count += 1

    print(count + 1)



if __name__ == '__main__':
    main()

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

resolve()

Solution (Python):


import sys
 
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
 
ni      = lambda: int(ns())
nin     = lambda y: [ni() for _ in range(y)]
na      = lambda: list(map(int, stdin.readline().split()))
nan     = lambda y: [na() for _ in range(y)]
nf      = lambda: float(ns())
nfn     = lambda y: [nf() for _ in range(y)]
nfa     = lambda: list(map(float, stdin.readline().split()))
nfan    = lambda y: [nfa() for _ in range(y)]
ns      = lambda: stdin.readline().rstrip()
nsn     = lambda y: [ns() for _ in range(y)]
ncl     = lambda y: [list(ns()) for _ in range(y)]
nas     = lambda: stdin.readline().split()

x, y = na()

ans = 0
while y >= x:
    y //= 2
    ans += 1

print(ans)

Solution (Python):




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


if __name__ == "__main__":
    main()

Solution (Python):
import sys
from math import sqrt
from collections import Counter

input = sys.stdin.readline


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


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


def LI():
    return list(MI())


inf = float("inf")
mod = 10 ** 9 + 7


def main():
    x, y = MI()

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

    print(c)
    pass


if __name__ == "__main__":
    main()

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

Solution (Python):
import math
x,y=map(int,input().split())
k=math.floor(math.log2(y/x))

for i in range(k+3):
    if x*(2**i)>y:
        print(i)
        break

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

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

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

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

print(ans)

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

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

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

print(cnt)

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

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

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

print(ans)

Solution (Python):
S = input().split(" ")
X = int(S[0])
Y = int(S[1])

def calculate(x,y):
    i = 0

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

    print(i)

calculate(X,Y)

Solution (Python):
x,y=map(int,input().split())
cnt=0
while x<=y:
  x=x*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())

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

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

Solution (Python):
import math

x,y = map(int,input().split())
"""
値をどんどん2倍していって、それがyを超えないかを検証し、越えなければカウントを増やす
"""

count = 0
origin = x
while True:
  if origin <= y:
    count+=1
    origin = origin * 2
  else:
    break
    
print(count)

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

Solution (Python):
x,y=map(int,input().split())
               
iimax=int(18/3*10+1)        

m=y//x

i2=1
for i in range(iimax):
  if m<2*i2:
      print(i+1)
      break
  else :
      i2=i2*2

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

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 y >= x:
    y //= 2
    ans += 1
print(ans)

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

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

print(count)

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 = [X]
while 1:
    X *= 2
    if X <= Y:
        ans.append(X)
    else:
        break
print(len(ans))

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

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

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

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

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())
i=0
while x*2**i<=y:
	i+=1
print(i)

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

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

Solution (Python):


import sys

DEBUG = False

def read(t):
    return t(sys.stdin.readline().rstrip())


def read_list(t, sep = " "):
    return [t(s) for s in sys.stdin.readline().rstrip().split(sep)]


def dprint(*args, **kwargs):
    if DEBUG:
        print(*args, **kwargs)
    return


def main():
    x, y = read_list(int)
    length = 0
    while x <= y:
        x *= 2
        length += 1
    print(length)


if __name__ == "__main__":
    main()

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

ans = 0
sy = x
while sy <= y:
    sy *= 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())
print(len(bin(y//x))-2)

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 = [int(i) for i in input().split()]

output = 0

while Y >= X:
    X = 2 * X
    output += 1
    
print(output)

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

Solution (Python):


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

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



if __name__ == "__main__":
    resolve()

Solution (Python):
x,y=input().split();
k,w=int(y)//int(x),0
while 2**w<=k:w=w+1
print(w)

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

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

Solution (Python):
x,y = [int(i) for i in input().split()]
ans = 1
for i in range(1,61):
  if y//x < 2**i:
    break
  else:
    ans += 1
print(ans)

Solution (Python):

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

for i in range(10**18):
    if x * pow(2,i) > y:
        print(i)
        break

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

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

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

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())

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

print(ans)

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

if __name__ == '__main__':
    main()

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())

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):
x,y = [int(x) for x in input().split()]

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

print(cnt)

Solution (Python):
X, Y = map(int, input().split())
box = [X]
while True:
    if box[-1]*2 <= Y:
        box.append(box[-1]*2)
        continue
    else:
        break
print(len(box))

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

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

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

if __name__ == "__main__":
    main()

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

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

A = [X]

i = 0

while A[i] <= Y:
  A.append(A[i] * 2)
  i += 1

print(i)

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

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

Solution (Python):



def main():
    
    
    

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

    cnt = 0

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

    print(cnt)

main()

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

ans = 1
n = 1
a = X
while a <= Y:
  a = X * (2 ** n)
  if a <= Y:
    ans += 1
    n += 1
  else:
    break

print(ans)

Solution (Python):
X,Y=map(int,input().split())
atmp=X
ans=1
for _ in range(65):
    if atmp*2<=Y:
        ans+=1
        atmp*=2
    else:
        print(ans)
        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())
c = 1
while x*2 <= y:
    x *= 2
    c += 1
print(c)

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

while x <= y:
	x = 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):
X,Y = map(int,input().split())
i = 1
while Y >= X*(2**(i-1)):
  i += 1
print(i-1)

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

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

print(cnt)

Solution (Python):
def Multiple_Gift(x , y):

    ans = 1

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

    return ans

def main():
    x , y = map(int , input().split())
    print(Multiple_Gift(x , y))

if __name__ == '__main__':
    main()

Solution (Python):
import numpy as np

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

print(np.floor(np.log2(y//x,dtype=np.longdouble)).astype(np.int)+1)

Solution (Python):



def solve(*args: str) -> str:
    x, y = map(int, args[0].split())

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

    return str(count)


if __name__ == "__main__":
    print(solve(*(open(0).read().splitlines())))

Solution (Python):
x,y=input().split();
k,w=int(y)//int(x),1
while 2**(w-1)<=k:w=w+1
print(w-1)

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

print(r)

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

count = 0
while X <= Y:
    Y = Y >> 1
    count += 1

print(count)

Solution (Python):
import math
x,y=map(int,input().split())
for p in range(61):
    if 2**p>y//x:
        print(p)
        exit(0)

Solution (Python):
def solve():
    min_number, max_number = list(map(int, input().split()))

    current_number = min_number
    answer = 0

    while current_number <= max_number:
        answer += 1
        current_number = current_number * 2

    print(answer)
    
solve()

Solution (Python):
def solve():
    min_number, max_number = list(map(int, input().split()))

    current_number = min_number
    answer = 1

    while True:
        next_number = current_number * 2
        if next_number <= max_number:
            current_number = next_number
            answer += 1
        else:
            break

    print(answer)


solve()

Solution (Python):
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines

def main():
    x,y = map(int, readline().split())

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

    ans = i
    print(ans)

if __name__ == "__main__":
    main()

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

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

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

count=0
while True:
    if X*2<=Y:
        count=count+1
        X=X*2
    else:
        break

print(count+1)

Solution (Python):
import sys
from itertools import permutations
import math
from operator import itemgetter

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

Solution (Python):

import math
import heapq
import bisect
import numpy as np
from collections import Counter


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

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

print(ans)

Solution (Python):
X_low, Y_up = map(int, input().split())

value = X_low
cnt = 0

while (value <= Y_up):
    cnt += 1
    value *= 2

print(cnt)

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

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

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())

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

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

Solution (Python):
def lcm(x, y):
    return (x * y) // math.gcd(x, y)

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

i = 0
while True:
  if x * 2 ** i > y:
    break


  i += 1
  
print(i)

Solution (Python):
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
mod=10**9+7

x,y=MI()
ans=1

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

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

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

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

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

count = 1
while 1:
  x *= 2
  if x <= y:
    count += 1
  else:
    break
print(count)

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

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

Solution (Python):
import fractions
x,y=map(int,input().split())
cnt=1
a,b=x,x*2
while True:
    if b<=y:
        g=a*b//fractions.gcd(a,b)
        a,b=b,2*g
        cnt+=1
    else:
        break
print(cnt)

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

while x <= y:
    res.append(x)
    x = x * 2
    
print(len(res))

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

Solution (Python):
from decimal import Decimal
X,Y = list(map(int,input().split()))
print(int((Decimal(Y)/Decimal(X)).ln()/Decimal(2).ln())+1)

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

Solution (Python):
import itertools
import math
import sys
from collections import Counter
from fractions import gcd
from functools import reduce

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

Solution (Python):
A, B = map(int, input().split())
a = []
a.append(A)
while max(a)<B:
    a.append(max(a)*2)
if max(a)>B:
    a.remove(max(a))
print(len(a))

Solution (Python):
a,b=map(int,input().split())
for i in range(1000000):
  if a*2**i>b:
    print(i)
    exit()

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

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

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

print(ans)

Solution (Python):
def main():
  
  x,y=map(int,input().split())
  ans=1
  while(True):
    if x*2<=y:
      ans+=1
      x=2*x
    else:
      break
  print(ans)
if __name__=="__main__":
  main()

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

while x<=y:
  l.append(x)
  x*=2

print(len(l))

Solution (Python):
def main():
    lower_limit, upper_limit = map(int, input().split())
    answer = 0
    while lower_limit <= upper_limit:
        lower_limit *= 2
        answer += 1
    print(answer)


if __name__ == '__main__':
    main()

Solution (Python):
import math
from decimal import *
X, Y = [int(x) for x in input().split()]
X = Decimal(str(X))
Y = Decimal(str(Y))
i = 1
cnt = 0
while True:
    if i > Decimal(Y/X):
        break
    i *= 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):
def main():
    x, y = map(int, input().split())

    ans = 0

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

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):
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:
    ans+=1
    x =x*2
print(ans)

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

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

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

Solution (Python):
import math
import fractions
import bisect
import collections
import itertools
import heapq
import string
import sys
import copy
from collections import deque
sys.setrecursionlimit(10**7)
MOD = 10**9+7
def gcd(a,b):return fractions.gcd(a,b) 
def lcm(a,b):return (a*b) // fractions.gcd(a,b) 
def iin(): return int(input()) 
def ifn(): return float(input()) 
def isn(): return input().split() 
def imn(): return map(int, input().split()) 
def fmn(): return map(float, input().split()) 
def iln(): return list(map(int, input().split())) 
def iln_s(): return sorted(iln()) 
def iln_r(): return sorted(iln(), reverse=True) 
def fln(): return list(map(float, input().split())) 
def join(l, s=''): return s.join(l) 
def perm(l, n): return itertools.permutations(l, n) 
def perm_count(n, r): return math.factorial(n) // math.factorial(n-r) 
def comb(l, n): return itertools.combinations(l, n) 
def comb_count(n, r): return math.factorial(n) // (math.factorial(n-r) * math.factorial(r)) 
def two_distance(a, b, c, d): return ((c-a)**2 + (d-b)**2)**.5 
def m_add(a,b): return (a+b) % MOD

X, Y = imn()

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

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

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

Solution (Python):

import math

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())
i = 1
ans = x
while ans <= y:
    ans = ans*2
    i += 1
print(i-1)

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

Solution (Python):
def input_int():
    return map(int, input().split())

def one_int():
    return int(input())

def one_str():
    return input()

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

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

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

def ans(x,x2,y):
    if x>y:
        return 0
    else:
        return ans(x2,x2*2,y)+1

print(ans(x,x*2,y))

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

count = 1
while True:
    x *= 2
    if x <= y:
        count += 1
    else:
        break

print(count)

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=x
cnt = 0
while k<=y:
  k*=2
  cnt+=1
print(cnt)

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

    x *= 2
    ans+=1
print(ans)

Solution (Python):
import sys
input = sys.stdin.readline
X,Y = [int(i) for i in input().split()]
count = 1
while True:
    if X * 2 <= Y:
        X *=2
        count+=1
    else :
        break
print(count)

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())
n=y//x
ct=0
while n>0:
  n//=2
  ct+=1
print(ct)

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

main()

Solution (Python):
x,y = map(int, input().split())
cnt=0
while True:
    if x>y:
        break

    else:
        x = x*2
        cnt+=1

print(cnt)

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



counter = 1
exCount = 1
while True:
  if exCount * 2 > ex:
    break
  else:
    counter += 1
    exCount *= 2

print(counter)

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

nx = x*2
if nx > y:
    print(1)
else:
    i = 2
    while nx*2 <= y:
        nx = nx*2
        i += 1
    print(i)

Solution (Python):

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

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

print(ans)

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

a0 = x
k = 0

for i in range(10**7):
    if a0 * (2 ** i) <= y:
        pass
    else:
        k = i
        break

print(k)

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

a0 = x
k = 0
for i in range(10**7):
    if a0 * (2 ** i) <= y:
        pass
    else:
        k = i
        break
print(k)

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

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

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




tmp = y//x
cnt = 0
while tmp >= 2:
    cnt += 1
    tmp = tmp // 2
print(cnt + 1)

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

Solution (Python):
x,y=[int(x) for x in input().split()]
ans=[x]
while ans[-1]*2<=y:
    ans.append(ans[-1]*2)

print(len(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 = 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):
x, y = map(int, input().split())

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

Solution (Python):
def solve(x, y):
    count = 0
    while x <= y:
        x *= 2
        count += 1
    return count

_x, _y = map(int, input().split())
print(solve(_x, _y))

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

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

print(cnt)

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

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())
answer = 0
a=x
while True:
    answer += 1
    a*=2
    if a>y:
        break
print(answer)

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

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

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

cnt=1
a=x
while a<=y:
    if 2*a<=y:
        cnt+=1
    a=a*2

print(cnt)

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

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

Solution (Python):

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

lst1 = []
while True:
    lst1.append(x)
    if x*2 <= y:
        x*=2
    else:
        break
print(len(lst1))