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



Sample input:
3 20


Sample output:
3

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#abc083c

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

Submission status: Accepted

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

cnt=0

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

print(cnt)

Submission status: Accepted

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

n = x
ans = 0

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

print(ans)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
A, B = list(map(int, input().split()))

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

print(cnt)

Submission status: Accepted

Solution code:

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

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

print(res - 1)

Submission status: Accepted

Solution code:
# -- coding: utf-8 --
x, y = map(int, input().split(' '))
maxa = x
count = 1
while maxa <= y:
    maxa *= 2
    count += 1

print(count - 1)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# C - Multiple Gift
import math

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

print result

Submission status: Accepted

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

Submission status: Accepted

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

if __name__=="__main__":
    main()

Submission status: Accepted

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

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

print(c)

Submission status: Accepted

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

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

print(c)

Submission status: Accepted

Solution code:
# coding: utf-8

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

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

print(count)

Submission status: Accepted

Solution code:
# coding: utf-8

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

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

print(len(li))

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
x, y = map(int, input().split())
cnt = 0
while x <= y:
    cnt += 1
    x *= 2
print(cnt)

Submission status: Accepted

Solution code:
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


# d = defaultdict(lambda: 0)
# setrecursionlimit(10**7)
# inf = float("inf")


##### stdin ####
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)

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

##### main #####



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

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

if __name__ == '__main__':
	main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

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

print(answer)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# coding=utf-8

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)

Submission status: Accepted

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

print(progression_len)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

count = 0
N = X

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

print(count)

Submission status: Accepted

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

length = length -1
print(length)

Submission status: Accepted

Solution code:
# -*- coding:utf-8 -*-
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))

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 素因数分解する
count = 0

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

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

print(count)

Submission status: Accepted

Solution code:
x, y = map(int, input().split())
# x, y = (3, 20)
ret = 0
while(x <= y):
    ret += 1
    x <<= 1
print(ret)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

count = 0

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(final)

Submission status: Accepted

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

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

print(res)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
X, Y = list(map(int, input().split()))
print(len(bin(Y // X)) - 2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

l = tuple(map(int, input().split()))
x, y = l[0], l[1]
#x, y = 3, 20
#x, y = 25, 100
#x, y = 314159265, 358979323846264338
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
    # print('i:{}, cnt:{}'.format(i, cnt))
    if max_len < cnt: max_len, max_i = cnt, i
print('{}'.format(max_len))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# your code goes here
x,y = map(int,input().split())
i = 0
while (2**i * x) <= y:
	i += 1

print(i)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# スペース区切りの整数の入力
x, y= map(int, input().split())

lst = []

num = x

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

print(len(lst))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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)

Submission status: Accepted

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

nums = [x]

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

print(len(nums))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
A,B=map(int,input().split(' '))
num=0
while A<=B:
    A*=2
    num+=1
print (num)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding:utf-8 -*-


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)

Submission status: Accepted

Solution code:
# coding:utf-8

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

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

print(count)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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)

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
[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)

Submission status: Accepted

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

Submission status: Accepted

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

ans = 1
t = x

while True:
    t = t * 2

    if t > y:
        break

    ans += 1

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

print i

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

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

Submission status: Accepted

Solution code:
#!/usr/bin/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)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print count

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
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)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

t = int(y/x)

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

print i

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

Solution code:
# coding:utf-8                                                             

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

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

print count

Submission status: Accepted

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

a = X
leng = 0

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(len(a))

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

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

print (len(lst))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
x, y = list(map(int,input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(i)

Submission status: Runtime Error

Solution code:
import math
X,Y = map(int,input().split())
print(int(math.floor(Y/X,2)+1))

Submission status: Runtime Error

Solution code:
from math import log2
from decimal import Decimal

x, y = map(int, input().split())
dx = Decimal(log2(x))
dy = Decimal(log2(y))
print(1 + int(log2(dy) - log2(dx)))

Submission status: Runtime Error

Solution code:
#include<bits/stdc++.h>
// Begin Header {{{
using namespace std;
using ll = long long;
using P = pair<ll, ll>;
using Graph = vector<vector<ll>>;
#define rep(i,n) for(ll i=0; i<n; i++)
#define loop(i, j, n) for(ll i=j; i<n; i++)
#define all(x) (x).begin(), (x).end()
constexpr int INF  = 0x3f3f3f3f;
const long long mod=1e9+7;
const long double PI = acos(-1);
// }}} End Header

int main() {
	ll x, y;
	cin >> x >> y;
	ll ans = 0;
	while(1){			
		if(x>y) break;
		ans++;
		x*=2;
	}
	cout << ans << endl;
	return 0;
}

Submission status: Runtime Error

Solution code:
import math

x = input()
y = input()


cnt = 0

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

print (cnt)

Submission status: Runtime Error

Solution code:
x = input()
y = input()

cnt = 0

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

print (cnt)

Submission status: Runtime Error

Solution code:
x = input()
y = input()


cnt = 0

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

print (cnt)

Submission status: Runtime Error

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

res = 0

for i in range(1,n+1):
    x5 = i//10000
    x4 = (i-x5*10000)//1000
    x3 = (i-x5*10000-x4*1000)//100
    x2 = (i-x5*10000-x4*1000-x3*100)//10
    x1 = i % 10
    
    xx = x5+x4+x3+x2+x1
    if b >= xx >= a:
        res += i

print(res)

Submission status: Runtime Error

Solution code:
import heapq
from sys import stdin
input = stdin.readline

#入力
# s = input()
# n = int(input())
x,y = map(int, input().split())
# a = list(map(int,input().split()))
# w = [int(input()) for i in range(n)]

# ab=[]
# for i in range(m):
#     a,b = map(int, input().split())
#     ab.append((a,b))

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

    
    

if __name__ == '__main__':
    main()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
x, y = map(int, input().split())
print(1+int(log2(y//x))

Submission status: Runtime Error

Solution code:
a,b = map(int,input().split())
ans = 0
for i in range():
  if a*(i+1) <= b:
    ans += 1
  else:
    quit()
print(ans)

Submission status: Runtime Error

Solution code:
a,b = map(int,input().split())
ans = -1
for i in range():
  if a*i <= b:
    ans += 1
  else:
    break
print(ans)

Submission status: Runtime Error

Solution code:
a,b = map(int,input().split())
ans = 0
for i in range():
  if a*i <= b:
    ans += 1
  else:
    break
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

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



if __name__ == '__main__':
    main()

Submission status: Runtime Error

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

from IPython import embed; embed(); exit();

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

Submission status: Runtime Error

Solution code:
import math
x,y=map(int,input().split())
print(math.ceil(math.log2((y-x)/x))+1)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
x,y=input().split()
print(int(math.log(2,int(y)//int(x))+1))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
x,y=map(int,input().split())
n=y//x
m=len(bin(n))-bin(n).rfind("1")-1
print(sum(len(i*m) for i in range(i,m+1)))

Submission status: Runtime Error

Solution code:




asdkudf
 gaipweghiawghwi:ghigrieuuiotuweoriyuwerioghjerouwerioturweoptyuwertuopityrytrioetyikgjdklshgiosdhygiorgggｇＧfdgfhsdfuigsdhjklasdfasdfjasdfj
    
    ｄｓｆｓだｆｓｄｐ＠あｋｇｆ　fsdj：ｄｓ　ｓｄふぃｊｄすおｇｈｓど；いｇｈｓｄｇｈふぉ；ｇ
    
    
    　fg;sdfjogsghld;五gjkljjdfg
      　fづhgjkdflg;ｆ　fｌ；ｓ

Submission status: Runtime Error

Solution code:
x,y = map(int, input())

a = x
ans = 1

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

print(ans)

Submission status: Runtime Error

Solution code:
import math
x,y=int(input())
print(int(math.log2(y//x)+1))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math
x,y = map(int, input().split( ))
ans = int(math.log2(y/x))+1
print(ans)

Submission status: Runtime Error

Solution code:
X,Y = map(int,input().split())
import math
ans = int(math.log2(Y/X))+1
print(ans)

Submission status: Runtime Error

Solution code:
import sys
from statistics import *
from collections import *
from operator import itemgetter
from fractions import gcd
stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()
def lcm(x, y):
    return (x * y) // gcd(x, y)


x, y = na()
if x * 2 > y:
    print(1)
else:
    ct = 2
    num1 = x
    num2 = x*2
while True:
    g = lcm(num1, num2)
    if g * 2 <= y:
        ct += 1
        num1 = num2
        num2 = g * 2
    else:
        break
print(ct)

Submission status: Runtime Error

Solution code:
X,Y= (int(i) for i in input().split())
x=X
i=1
while(x<=Y):
    x=2*x
    i+==1
print(i)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import math

X, Y = map(int,input().split())
answer = int(math.log2(int(Y/X)) + 1
print(answer)

Submission status: Runtime Error

Solution code:
import numpy as np
import math

X, Y = [int(_) for _ in input().split()]
print(math.floor(math.log2(Y / X)) + 1)

Submission status: Runtime Error

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

for i in range(60):
    if X * 2**i > Y:
        ans = i
        break
print(ans)

Submission status: Runtime Error

Solution code:
X, Y = list(map(int, input()))

print(Y//X)