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 math
A,B=map(int,input().split(' '))
num=0
while A<=B:
    A*=2
    num+=1
print (num)

Solution (Python):
x,y=map(int, input().split())
l=[]
flag = True
left = x
l.append(left)
l_max = y
mul = 2
current_value = left
while flag:
    a = current_value * mul
    if l_max < a:
        flag=False
        break
    l.append(a)
    current_value = a
print(len(l))

Solution (Python):
x=list(map(int,input().split(" ")))
a=[x[0]]

while a[-1]<= x[1]:
    a.append(a[-1]*2)

a.pop(-1)
print(len(a))

Solution (Python):
X,Y=input().split(' ')
ans=1
X=int(X)
while True:
  X=X*2
  if X<=int(Y):
    ans+=1
  else:
    break
print(str(ans)+'\n')

Solution (Python):
import math

input_line = input().rstrip().split(' ')
X = int(input_line[0])
Y = int(input_line[1])

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

print(count)

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

n = Y//X

nb = format(n, 'b')

nbs = str(nb)
nbsi = int(nbs)
ans = 0
while nbsi != 0:
    ans += 1
    nbsi //= 10
print(ans)

Solution (Python):
def rec(result, i, dest, step):
    if i > dest:
        return result
    if i % result[-1] == 0:
        result.append(i)
        rec(result, i+result[-1], dest, result[-1])
    else:
        rec(result, i+step, dest, result[-1])
        
x, y = [int(i) for i in input().split()]
l = [x]
ans = rec(l, 2*x, y, x)
print(len(l))

Solution (Python):
temp=input().split(" ")
x=int(temp[0])
y=int(temp[1])
temp=x
ans=0
while True:
    if temp<=y:
        ans += 1
    else:
        break
    temp*=2



print(ans)

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

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

Solution (Python):



def main(min_limit, max_limit):
    result = []
    i = min_limit

    while(i < max_limit + 1):
        result.append(i)
        i = i * 2
    print(len(result))


if __name__ == "__main__":
    min_limit, max_limit = [int(val) for val in input().split()]
    main(min_limit, max_limit)

Solution (Python):


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

count = 0
x = X
while True:
    if x > Y:
        break
    x = x * 2
    count += 1

print(count)

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

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

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

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

Solution (Python):

import numpy as np

X, Y = [np.int64(x) for x in input().split()]
i = 0
while X * 2**i <= Y:
    i += 1

print(i)

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

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

print(cnt)

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

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

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

ans = 1
n = a[0]
while True:
    n = n*2
    if n <= a[1]:
        ans = ans + 1
    else:
        break

print(ans)

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

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

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

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

print(i - 1)

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

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

ans = 1
t = x

while True:
    t = t * 2

    if t > y:
        break

    ans += 1

print(ans)

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

Solution (Python):
X,Y=map(int,raw_input().split())
i=0
while True:
	tmp=X*(2**i)
	if tmp>Y:
		break
	i+=1

print i

Solution (Python):



X, Y = [int(i) for i in input().split()]
cnt = 0
while X <= Y :
    X *= 2
    cnt += 1
print(cnt)

Solution (Python):


import sys

def main(argv):
    line = sys.stdin.readline()
    while line:
        X, Y = map(lambda i: int(i), line.rstrip("\n").split(" "))
        counter = 0
        value = X
        while value <= Y:
            counter += 1
            value *= 2
        print counter

        line = sys.stdin.readline()

if __name__ == "__main__":
    main(sys.argv)

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

import math
ans = math.ceil(math.log2(Y / X))
if X * 2 ** ans == Y:
    ans += 1
print(ans)

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

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

print count

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

    l = 1
    n = X
    while 1:
        n += n
        if n > Y:
            break
        else:
            l += 1
    print(l)

main()

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

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

Solution (Python):


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

cc = Y//X
aa = 0
while cc != 0:
    cc = cc>>1
    aa += 1
print(aa)

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

lis = []

lis.append(X)

a = X


for i in range(100):
	if a > Y:
		break
	a *= 2
	lis.append(a)
 








print(len(lis) - 1)

Solution (Python):
a = [int(x) for x in  input().split()]

cnt = 0
if a[0] > a[1]:
    print(0)
else:
    cnt += 1
    tmp = a[0]
    while True:
        if tmp*2 <= a[1]:
            tmp = tmp*2
            cnt += 1
        else:
            break
print(cnt)

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

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

t = int(y/x)

i = 1
while t > 1:
    i += 1
    t /= 2

print i

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

count=0
num=X
while(1):
    if num>Y:
        break
    else:
        count+=1
        num*=2

print(count)

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

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

l = 0;
while a <= b:
    l += 1
    a *= 2
print(l)

Solution (Python):
a,b=[int(i) for i in input().split(" ")]
n=0

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

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

array = [X]
while True:
    tmp = array[-1] * 2
    if tmp > Y:
        break
    array.append(tmp)
print(len(array))

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

Solution (Python):
X, Y = map(int, input().split())
z = Y//X
n = 0

while True:
    if 2**n > z:
        print(n)
        break
    n += 1

Solution (Python):
def main():
    """
    高橋君は、日頃の感謝を込めて、お母さんに数列をプレゼントすることにしました。 
    お母さんにプレゼントする数列 A は、以下の条件を満たす必要があります。
    A は X 以上 Y 以下の整数からなる
    すべての 1≤i≤|A|−1 に対し、Ai+1 は Ai の倍数であり、かつ Ai+1 は Ai より真に大きい
    高橋君がお母さんにプレゼントできる数列の長さの最大値を求めてください。
    """
    X, Y = map(int, input().split())

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

    print(ans)

if __name__ == '__main__':
    main()

Solution (Python):


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

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

print count

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

a = X
leng = 0

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

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

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

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

print(ans)

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

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

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

print(len(a))

Solution (Python):
A, B = list(map(int, input().split()))
print(len(bin((B // A))) - 2)

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

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

print(ans)

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

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

print (len(lst))

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

Solution (Python):
if __name__=="__main__":
    l = list(map(int,input().split(" ")))
    A = l[0]
    B = l[1]
    count=1
    while (A<<1)<=B:
        count+=1
        A = A<<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())
i = 1
while X*(2**i) <= Y:
  i+=1
print(i)

Solution (Python):

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

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

Solution (Python):
import sys

line = sys.stdin.readline().strip()
X, Y = [int(x) for x in line.split()]

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

print(r)

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

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

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

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

i = 1
while True:
	if (X * (1 << i)) > Y:
		break
	else:
		i += 1

print(i)