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):
x, y = map(int, input().split())
a = [x]
idx = 0
while True:
    t = a[idx] * 2
    if t <= y:
        a += [t]
        idx += 1
    else:
        break
print(len(a))

Solution (Python):


def main():
    x, y = map(int, input().split())
    cnt = 1
    while True:
        x *= 2
        cnt += 1
        if x > y:
            break
    print(cnt - 1)

if __name__ == '__main__':
    main()

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

n = X
cnt = 1 if X <= Y else 0

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

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

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

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

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

print(len(str(bin(Y // X)))-2)

Solution (Python):
if __name__ == '__main__':
    X, Y = list(map(int, input().split()))
    counter = 0

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

    print(counter)

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

Solution (Python):
X, Y = map(int, input().split())
i = 1
while True:
    if X * pow(2, i) <= Y:
        i += 1
    else:
        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())
tmp = X
ans = 0
while tmp <= Y:
    tmp *= 2
    ans += 1

print(ans)

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

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

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


if __name__ == "__main__":
    main()

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

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

a = x 
for i in range(1,70):
            
    if (i==1 and a<y) or a*2 <= y: 
        a *= 2 
        continue
    else: break

print(i)

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

ans = 1

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

print(ans)

Solution (Python):
while True:
    A = []
    s = 0
    a = input().split()
    X, Y = list(map(int,list(a)))
    if X > Y or Y > 10**18 or X < 1:
        continue
    A.append(X)
    while True:
        A.append(A[len(A)-1]*2)
        if A[len(A)-1] > Y:
            break
    s = len(A) - 1
    print(s)
    break

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

item=X
length=1
while item<=Y:
    item *= 2
    length+=1
length -= 1
print(length)

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

A = []
now_num = X
next_num = X*2
while(now_num <= Y):
	A.append(now_num)
	now_num = int(next_num)
	next_num = int(now_num*2)
print(len(A))

Solution (Python):
from itertools import count, takewhile
 
x, y = map(int, input().split())
 
print(max(takewhile(lambda i: x * (2**i) <= y,  count())) + 1)

Solution (Python):

"""
Created on Wed Jun 20 16:39:29 2018

@author: Yuya
"""

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

Solution (Python):
from itertools import count, takewhile

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

print(sum(1 for _ in takewhile(lambda z: z <= y, (x*(2**i) for i in count()))))

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

n = 10 ** 18
A = [1]
i = 0
while A[i] < n:
    A.append(A[i] * 2)
    i += 1

Y //= X
X = 1

ans = 0
for a in A:
    if X <= a <= Y:
        ans += 1
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())

ans = 0
num = X

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

print(ans)

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

Solution (Python):
nums = list(map(int, input().split()))
i = 0
mi = int(nums[0])
ma = int(nums[1])
k = mi
while k <= ma:
  k = k*2
  i += 1
print(i)

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())
count = 1
for i in range(10**5):
    A = A*2
    if A > B:
        break
    count += 1
    
print(count)

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

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

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

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

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

print(lenCount)

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

print(i)

Solution (Python):
a = input().split()
counter = 0

element = int(a[0])

while element <= int(a[1]):
    element *= 2
    counter += 1

print(counter)

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

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

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

AZ=X
count=0


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

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

Solution (Python):

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

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

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

Solution (Python):
x, y = [int(i) for i in input().split()]

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

print(count)

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

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

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

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

Solution (Python):
def c_multiple_gift(X, Y):
    ans = 1  
    while X <= Y:
        X *= 2  
        ans += 1
    ans -= 1  
    return ans 

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

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

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

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

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

print(res)

Solution (Python):

from itertools import product
def inpl(): return map(int, input().split())

X, Y = inpl()
ans = 0
A = X
while A <= Y:
    ans += 1
    A *= 2

print(ans)

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

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

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

nums = []
ap = nums.append

while True:
    if x > y:
        break

    ap(x)
    x *= 2

print(len(nums))

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

c = 1
count = 1
while 1:
	if (Y > 2*c*X):
		c *= 2
		count += 1
	elif (Y == 2*c*X):
		count += 1
		print(count)
		break
	elif (Y < 2*c*X):
		print(count)
		break

Solution (Python):
x, y = (int(i) for i in input().split())
tmpx = x
count = 0
while tmpx<=y:
    tmpx = tmpx * 2
    count = count + 1

print(count)

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

Solution (Python):
x, y = [int(x) for x in input().split()]
size = int(y//x).bit_length()
print(size)

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

Solution (Python):
X, Y = [int(elem) for elem in input().split(' ')]

A_list = [X]
while True:
    num = A_list[-1] * 2
    if num <= Y:
        A_list.append(num)
    else:
        break

print(len(A_list))

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

Solution (Python):
l=input().split()
x, y=int(l[0]), int(l[1])
t=y//x
res=0
while t:
    t>>=1
    res+=1
print(res)

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=[]
while x<=y:
    ans.append(x)
    x*=2
print(len(ans))

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

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

    num = X 
    ans = 0

    while(True):
        num *= 2
        ans += 1

        if num > Y :
            break

    print(ans)

    return


if __name__ == '__main__':
    main()

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

Solution (Python):
X, Y = map(int, input().split())
ans = 0
t = X
while t <= Y:
    t *= 2
    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):
def gcd(a, b):
    r = a % b
    while r != 0:
        a, b = b, r
        r = a % b

    return b


x, y = map(int, input().split())
a = []
i, g = 0, 0

while True:
    if len(a) == 0:
        g = x
    elif len(a) == 1:
        g = x * 2
    else:
        g = a[i-1]*a[i-2]/gcd(a[i-1], a[i-2])
        if g == a[i-1]:
            g *= 2

    if g > y:
        break
    else:
        a.append(g)
        i += 1

print(len(a))

Solution (Python):
from math import log
n = list(map(int,input().split()))
x, y = n[0],n[1]
for i in range(0,100):
  if x * 2 ** i > y:
    print(i)
    quit()

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())
A,L = X,0
while A <= Y:
    L += 1
    A *= 2
print(L)

Solution (Python):
from math import log, floor

def formula(x, y):
    
    return 1 + floor(log(y / x, 2))

def naive(x, y):
    count = 0
    n = x
    while n <= y:
        count += 1
        n *= 2
    return count
        

if __name__ == '__main__':
    x, y = map(int, input().split())
    print(naive(x, y))

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

a = l[0]
b = l[1]

c = 1

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

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

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

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

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

Solution (Python):
import bisect


def calc(X, Y):
    dic = dict([(X * (2**x), x) for x in range(80)])
    ret = bisect.bisect(list(dic.keys()), Y)

    return ret


def calc2(X, Y):
    cnt = 0
    tmp = X
    while tmp <= Y:
        tmp *= 2
        cnt += 1
    return cnt


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


if __name__ == '__main__':
    main()

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

count = 1
curr_num, next_num = x, x*2
multiplier = 2
while next_num <= y:
    if next_num%curr_num == 0:
        count += 1
        multiplier = 2
        curr_num = next_num
    else:
        multiplier += 1
    next_num = curr_num * multiplier

print(count)

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

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

Solution (Python):





if __name__ == '__main__':
    x, y = map(int, input().split())
    count = 0

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

    print(count)

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

Solution (Python):
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().strip()

x,y = na()
count = 1
for _ in range(10000):
    x = x*2
    if x > y:
        break
    count += 1
print(count)

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

def f(x, y):
  ans = [x]
  i = 0
  while True:
    temp = ans[i] * 2
    if temp <= y:
      ans.append(temp)
    else:
      break
    i += 1
  return len(ans)

print(f(x, y))

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

num = X
cnt = 1

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

if num > Y:
    cnt -= 1

print(cnt)

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

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

Solution (Python):
X,Y=map(int,input().split())
t=X
i=1
for i in range(1,X*Y):
    if t*2>Y: break
    else:
        t*=2

print(i)

Solution (Python):
X, Y = [int(item) for item in input().rstrip().split(" ")]
 
ans = 0
while(1):
  if X <= Y:
    ans+=1
    X *=2
  else:
    break
print(ans)

Solution (Python):
X,Y=map(int,input().split())
work = 1
for i in range(74):
  tmp = X*pow(2,i)
  if tmp <= Y and Y < tmp*2:
    work +=i
    break
print(work)

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

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

i = 0
while True:
    if X_i > Y:
        print(i)
        exit()
    X_i *= 2
    i += 1

Solution (Python):
import math

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

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

Solution (Python):

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

Solution (Python):
import numpy as np
from collections import Counter
import collections
round = lambda x:(x*2+1)//2
a = list(map(int,input().split()))
a = np.array(a)
X = a[0]
Y = a[1]
i = 0
while(X<=Y):
  X *= 2
  i+=1
print(i)

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

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

x*2**n<=y
2**n<=y/x
n<=log(y/x,2)
"""

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

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

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

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

Solution (Python):



import sys

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

    cnt = 0
    i = x
    while i <= y:
        cnt += 1
        i += i

    print(cnt)

if __name__ == '__main__':
    main()

Solution (Python):
input_list = list(map(int,input().split()))
for i in range(61):
    if (input_list[0]*(2**i )<=input_list[1])&(input_list[0]*(2**(i +1))>input_list[1]):
        print(i+1)

Solution (Python):

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

    a = x
    A = [a]

    while a*2 <= y:
        a += a
        A.append(a)


    print (len(A))

if __name__ == "__main__":
    
    
    main()

Solution (Python):



X, Y = list(map(int, input().split()))
num = X
count = 0

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

print(count)

Solution (Python):
def main():
    lower, upper = list(map(int, input().split()))

    n_gift = 1

    current_num = lower * 2

    while current_num <= upper:
        current_num *= 2
        n_gift += 1

    print(n_gift)

main()

Solution (Python):
x, y = (int(i) for i in input().split())
count = 1 
i = x

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

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

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

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

def main():
    x = []
    x.append(X)
    for i in range(Y):
        a = max(x)
        b = a*2
        if b > Y: return print(len(x))
        x.append(b)

main()

Solution (Python):

"""
https://beta.atcoder.jp/contests/abc083/tasks/arc088_a

"""
import sys
from sys import stdin
input = stdin.readline


def solve(X, Y):
    ans = []

    while X <= Y:
        ans.append(X)
        X *= 2
    
    return len(ans)


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


if __name__ == '__main__':
    main(sys.argv[1:])

Solution (Python):
from math import pow

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

max_len = 0

while True:
    if X * pow(2, max_len) <= Y:
        max_len += 1
    else:
        break

print(max_len)

Solution (Python):
X, Y = map(int, input().split())
ans = 0
for i in range(60):
	if X > Y:
		break
	ans += 1
	X = X * 2
print(ans)

Solution (Python):
x,y=map(int,input().split())
ans=[x]
for v in range(1,y):
    if 2*ans[v-1] <= y:
        p = ans[v-1]*2
        ans.append(p)
    else:
        break;

print(len(ans))

Solution (Python):

import math
X, Y = list(map(int, input().split()))
"""
print(math.ceil(math.log(Y/X+1, 2)))
"""
count = 0
while X <= Y:
    X *= 2
    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())
an = x
count = 0
while an <= y:
    an *= 2
    count += 1

print(count)

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

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

Solution (Python):
 

a, b = map(int, input().split())
count = 1
x = a

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

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

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

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

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


def foo(x, y):
    b = 1
    n = 0
    while b <= y//x:
        b = b << 1
        n += 1
    return n


if __name__ == "__main__":
    x, y = map(int, input().split())
    print(foo(x, y))

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

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

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

Solution (Python):
X, Y = [int(i) for i in input().split()]
count = 0

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

Solution (Python):


x,y=map(int,raw_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=X*2

print(cnt)

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

n = x
ans = 0

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

print(ans)

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

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

print(ans)

Solution (Python):

A, B = list(map(int, input().split()))

cnt = 0
num = A
while num <= B:
    cnt += 1
    num *= 2

print(cnt)

Solution (Python):

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

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

print(res - 1)

Solution (Python):

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

print(count - 1)

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

for i in range(1,64):
    if X * (2**i) > Y:
        print(i)
        break

Solution (Python):

import math

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

print result

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

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

if __name__=="__main__":
    main()

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


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

print(c)

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


li = []
while x <= y:
    li.append(x)
    x *= 2

print(len(li))

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

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

print(ans)

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

Solution (Python):

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

Solution (Python):
import math
import itertools
import heapq
from sys import stdin, stdout, setrecursionlimit
from bisect import bisect, bisect_left, bisect_right
from collections import defaultdict, deque








def LM(t, r): return list(map(t, r))
def R(): return stdin.readline()
def RS(): return R().split()
def I(): return int(R())
def F(): return float(R())
def LI(): return LM(int,RS())
def LF(): return LM(float,RS())
def ONE_SL(): return list(input())
def ONE_IL(): return LM(int, ONE_SL())
def ALL_I(): return map(int, stdin)
def ALL_IL(): return LM(int,stdin)


def ap(f): return f.append
def pll(li): print('\n'.join(LM(str,li)))
def pljoin(li, s): print(s.join(li))





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

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

if __name__ == '__main__':
	main()

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

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

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

Solution (Python):
def LI(): return [int(x) for x in input().split(" ")]
def LS(): return [str(x) for x in input().split(" ")]
def ItoS(L): return [str(x) for x in L]
def StoI(L): return [int(c) for c in L]


def solve():
    x, y = LI()
    ans = 0

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

    print(ans)

solve()

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

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

print(answer)

Solution (Python):



import sys

x, y = sys.stdin.readline().split(" ")

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

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

print(progression_len)

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

Solution (Python):
X, Y = map(int, raw_input().split())
Z = Y / X
ans = 1
while True:
    if Z < 2**ans:
        print ans
        break
    ans += 1

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

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

count = 0
N = X

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

print(count)

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

length = length -1
print(length)

Solution (Python):

x, y = map(int, input().split())
ans = []
index = 0
for tmp in range(x, y+1):
    factor = (2**index)*x
    if x <= factor and factor <= y:
        ans.append(factor)
        index += 1
    else:
        break
print(len(ans))

Solution (Python):
def inputs():
    s = input()
    li = s.split(" ")
    return(int(li[0]), int(li[1]))

def lenProg(X, Y):
    count = 0
    if(X <= Y):
        count += 1

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

    return(count)

def main():
    X, Y = inputs()
    count = lenProg(X, Y)
    print(count)

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


count = 0

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

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

print(count)

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

ret = 0
while(x <= y):
    ret += 1
    x <<= 1
print(ret)

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

i=1
A=[]
A.append(X)

while(1):
    T=A[i-1]*2
    if T<=Y:
        A.append(T)
    elif T>Y:
        break
    i+=1

print(len(A))

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

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

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

count = 0

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

print(count)

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

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

Solution (Python):
from math import log 

r = lambda : map(int, raw_input().split())

x, y = r()

cnt = 0

while x <= y :
    cnt += 1 ;
    x *= 2 
    
print cnt

Solution (Python):
X, Y = (int(i) for i in input().split()) 

RESULT = 1

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

print(RESULT)

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

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

print(final)

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

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

print(res)

Solution (Python):

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

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

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

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

def f(x, y):
  ans = [x]
  
  for i in range(100):
    if ans[i] * 2 <= y:
      ans.append(ans[i] * 2)
    else:
      return len(ans)
  
  return len(ans)

print(f(x, y))

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

Solution (Python):

l = tuple(map(int, input().split()))
x, y = l[0], l[1]



max_len, max_i = 0, 0

for i in range(x, x+10000):
    cnt, A = 0, i
    while A <= y:
        A = A * 2
        cnt += 1
    
    if max_len < cnt: max_len, max_i = cnt, i
print('{}'.format(max_len))

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

ans = 0

for i in range(X, Y+1):
    a = 0
    J = X
    while(J <= Y):
        a += 1
        J = J*2
    
    if ans >= a:
        break
    ans = a

print(ans)

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

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

Solution (Python):

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

print(i)

Solution (Python):
x,y = map(int,input().split())
counter = 0
for i in range(100):
	if x*2**(i) <= y:
		counter += 1
	else:
		break
print(counter)

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

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

Solution (Python):

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

lst = []

num = x

while num <= y:
    lst.append(num)
    num = 2*num

print(len(lst))

Solution (Python):
INPUT=input()
IN=INPUT.split(" ")
X=int(IN[0])
Y=int(IN[1])
counter=0
while X<=Y:
    X=X*2
    counter+=1
print(counter)

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

Solution (Python):
a=map(int, raw_input().split())
ans=1
pre=a[0]
while True:
    if pre*2<=a[1]:
        ans+=1
        pre=pre*2
    else:
        break
print ans

Solution (Python):

import math,sys

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

n = math.floor(math.log(Y/X,2))

while True:
    if X*2**n > Y:
        break
    n+=1

print(n)

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

nums = [x]

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

print(len(nums))

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