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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ARC 088
X,Y= map(int,input().split())
tmp=X
cnt=1
for i in range(1,int(Y//X)+2):
    if tmp ==Y:
        print(cnt)
        exit()
    elif tmp >Y:
        print(cnt-1)
        exit()
    else:
        tmp=2*tmp
        cnt+=1

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X, Y = map(int, input().split())
nums = [X]
for i in range(0, Y+1):
    if nums[i]*2 > Y:
        break
    nums.append(nums[i]*2)
print(len(nums))

Submission status: Accepted

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

Submission status: Accepted

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

count = 0

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# /usr/bin/python
# -*- coding: utf-8 -*-
#
import sys
import math


a,b = map(int, input().split())

ans = 0
while a <= b:
  ans += 1
  a = a << 1

print(ans)

Submission status: Accepted

Solution code:
x, y = [int(i) for i 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(' '))
ans=0
while X<=Y:
  ans+=1
  X*=2
print(ans)

Submission status: Accepted

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

print(c)

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

Solution code:
from sys import stdin
x, y = [int(_) for _ in stdin.readline().rstrip().split()]
count=1
while True:
    x=x*2
    if x <= y:
        count+=1
    else:
        break
print(count)

Submission status: Accepted

Solution code:
def unko(a:int, b:int)->int:
    if a > b:
        return 0
    else:
        return 1 + unko(2 * a, b)
if __name__ == "__main__":
    x, y = map(int, input().split(' '))
    print(unko(x, y))

Submission status: Accepted

Solution code:
import math
X,Y = map(int,input().split())
#a_n = X*2^(n-1)
count = 1
while(1):
  if(Y < 2*X):
    break
  X = X*2
  count += 1

print(count)

Submission status: Accepted

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

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

print(ans+1)

Submission status: Accepted

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

Submission status: Accepted

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

print(count)

Submission status: Accepted

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

for _ in range(61):
    a *= 2
    if a <= y:
        ans += 1
    else:
        break

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def create_Row(S,E):
    list = []
    start = S
    while start <= E:
        list.append(start)
        start+=start
    return list

X,Y =map(int,input().split())
A = len(create_Row(X,Y))
print(A)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
X, Y = map(int, input().split())
r = 0
R = Y // X
while R >= 2:
  R //= 2
  r += 1
print(r + 1)

Submission status: Accepted

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

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:
a,b = map(int,input().split(" "))
count = 0
while a <= b:
    count += 1
    a *= 2
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def inpl(): return [int(i) for i in input().split()]
X, Y = inpl()
ans = 0
while X <= Y:
    X = 2*X
    ans += 1
print(ans)

Submission status: Accepted

Solution code:
X, Y=map(int,input().strip().split(' '))
n=X
ans=0
while n<=Y:
    n*=2
    ans+=1
    #print(n)
print(ans)

Submission status: Accepted

Solution code:
import math
X,Y=map(int,input().split())
print(len(format(Y//X,'b')))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(((lambda l:len([0 for i in range(0,100) if l[0]*(2**i)<=l[1]]))(list(map(int,input().split())))))

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 = map(int, input().split())
score = 1
A = X
while 1:
    A *= 2
    if(A <= Y):
        score += 1
    else:
        print(score)
        break

Submission status: Accepted

Solution code:
x,y = map(int, input().split())
for i in range(1,10000000000000):
    x *= 2
    if x > y:
        print(i)
        quit()

Submission status: Accepted

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

a = X
cnt = 1

while(True):
    a = a * 2
    if a > Y:
        break
    cnt += 1


print(cnt)

Submission status: Accepted

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

print(num)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
from sys import stdin

s_in = lambda: stdin.readline()[:-1] # s = s_in()
d_in = lambda: int(stdin.readline()) # N = d_in()
ds_in = lambda: list(map(int, stdin.readline().split())) # List = ds_in()

X, Y = ds_in()

x = bin(X)[2:]
y = bin(Y)[2:]
xl = len(x)
yl = len(y)


def bit_compare(A, B):
    """ 
    A, B: str 
    
    Return
    ------
    A >= B
    """
    flag = True
    for a, b in zip(A, B):
        if int(a) != int(b):
            if int(a) > int(b):
                flag = True
            else:
                flag = False
            break
    return flag


if bit_compare(y[:xl], x):
    print(yl - xl + 1)
else:
    print(yl - xl)

Submission status: Accepted

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

if __name__ == '__main__':
  X, Y = map(int, input().split())
  
  if X == Y:
    print(1)
    
  else:
    i = 1
    while X * 2 ** i <= Y:
      i += 1
    print(i)

Submission status: Accepted

Solution code:
X,Y = map(int,input().split())
for k in range(Y):
  if (X*(2**k) <= Y < X*(2**(k+1))):
    print(k+1)
    break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
x,y = [int(x) for x in input().split()]
ret = 1
while x<=y:
    # print(x)
    ret += 1
    x *= 2

print(ret-1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = 1

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

Submission status: Accepted

Solution code:
from sys import exit, setrecursionlimit, stderr
from functools import reduce
from itertools import *
from collections import defaultdict
from bisect import bisect

def read():
  return int(input())

def reads():
  return [int(x) for x in input().split()]

X, Y = reads()
print(next(i for i in count(0) if (X << i) > Y))

Submission status: Accepted

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

print ans

Submission status: Accepted

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

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 = map(int, input().split())

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

	print(i + 1)

Submission status: Accepted

Solution code:
from collections import Counter
import math
import sys
def getinputdata():

    # 配列初期化
    array_result = []
    
    data = input()

    
    array_result.append(data.split(" "))

    flg = 1

    try:


        while flg:

            data = input()

            array_temp = []

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = 1

            else:

                flg = 0
    finally:


        return array_result


arr_data = getinputdata()

x = int(arr_data[0][0])
y = int(arr_data[0][1])

cnt = 0

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

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
s=(b//a).bit_length()
print(s)

Submission status: Accepted

Solution code:
import math 
n=[int(d) for d in input().split()]
cnt=0
while n[0]<=n[1]:
    cnt+=1
    n[0]*=2
print(cnt)

Submission status: Accepted

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

mod = 1000000007

length=1
syo=X//mod
X=X%mod

syo_y = Y//mod
Y=Y%mod
while(True):
    syo = (syo*2)+(X*2)//mod
    X = (X*2)%mod
    if syo>syo_y:
        break
    elif syo==syo_y and X>Y:
        break
    else:
        length+=1
        
print(length)

Submission status: Accepted

Solution code:
X, Y = map(int, input().split())
candidate = []
end = 0
for i in range(X, Y+1):
    temp = []
    while True:
        if i <= Y:
            temp.append(i)
        else:
            if len(temp)>len(candidate):
                candidate = temp
                end = 1
            break
        i *= 2
    if end == 1:
        break
    
print(len(candidate))

Submission status: Accepted

Solution code:
from collections import deque

l = [int(i) for i in input().split(' ')]
x, y = l[0], l[1]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

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

res = 0
for i in range(10000):
    if x << i <= y:
        res += 1

print(res)

Submission status: Accepted

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

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


solve()

Submission status: Accepted

Solution code:
# coding: utf-8
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())
a = [x]
while a[-1] <= y :
    a.append(a[-1]*2)
print(len(a)-1)

Submission status: Accepted

Solution code:
x, y = map(int, input().split())
a = [x]
while True :
    new = a[-1]*2
    if new > y :
        break
    else :
        a.append(new)
print(len(a))

Submission status: Accepted

Solution code:
import math

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

#
A = lambda i: X*2**(i-1)

#
n = int(math.log2(Y/X) + 1)

for i in range(-2, 3):
    if Y<A(n + i):
        print(n + i - 1)
        exit()

Submission status: Accepted

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

Submission status: Accepted

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

ans = 1
v = 2
for i in range(62):
    if X * v <= Y:
        ans += 1
    else:
        break

    v *= 2
print ans

Submission status: Accepted

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

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

print (len(gift))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import log
a,b = input().split()
a = eval(a)
b = eval(b)
cnt = 0
while a <= b:
	cnt += 1
	a *= 2
print(cnt)

Submission status: Accepted

Solution code:
import re

c=input()
clist=re.findall("\d+",c)
a=int(clist[0])
b=int(clist[1])
for i in range(1,b+1):
    if a*(2**i)<=b:
        continue
    else:
        print(i)
        break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l, r = map(int, input().split())

cnt = 0
while l <= r:
	cnt += 1
	l *= 2
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

count = 1

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

print(count)

Submission status: Accepted

Solution code:
from math import log

X, Y = [int(val) for val in raw_input().split(" ")]
val = Y/X
if val < 2**30:
    print int(log(val,2))+1
else:
    print int(log(val/2**30,2))+31

Submission status: Accepted

Solution code:
X, Y=[int(_) for _ in input().strip().split()]
tmp=X
count=0
while tmp <= Y:
    count += 1
    tmp*=2
print(count)

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

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

div = Y // X 

num = 1
count = 1
while div >= num:
	num <<= 1
	count += 1

print(count-1)

Submission status: Accepted

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

print(counter)

Submission status: Accepted

Solution code:
'''input
10 100
'''
x,y = map(int,raw_input().split())
ans = 0
m = 1
while y >= m*x:
	ans += 1
	m <<= 1
print ans

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**15
mod = 10**9+7

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)


def main():
    x,y = LI()
    r = 0
    while x <= y:
        x *= 2
        r += 1

    return r



print(main())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

    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())
# X * (2**(n-1)) <= Y


from math import log2
eps = 10**(-9)



# X * 2 ** start <= x < X * 2 ** end
def ans(start, end):
#    print(start, end)
    if start + 1 == end:
        return start
    mid = (start + end)//2
    if X * 2**mid  <= Y:
        return ans(mid, end)
    else:
        return ans(start, mid)

print(ans(0, 60)+1)

Submission status: Accepted

Solution code:
s = input().split(' ')
a = []
for w in s:
    a.append(int(w))

len = 0
while a[0] <= a[1]:
    len += 1
    a[0] *= 2

print(len)

Submission status: Accepted

Solution code:
import sys
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt, ceil, floor
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache, reduce
from operator import xor
from heapq import heappush, heappop
INF = float("inf")
sys.setrecursionlimit(10**7)

# 4近傍（右, 下, 左, 上）
dy4, dx4 = [0, -1, 0, 1], [1, 0, -1, 0]


def inside(y: int, x: int, H: int, W: int) -> bool: return 0 <= y < H and 0 <= x < W
def ceil(a, b): return (a + b - 1) // b


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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
x, y = map(int, raw_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=0
while x<=y:
 i+=1
 x*=2
print(i)

Submission status: Accepted

Solution code:
a = input().split()
a0 = int(a[0])
a1 = int(a[1])
num=0
while True:
    num += 1
    if a0*2 > a1:
        break
    a0 = a0*2

print(num)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S,L = list(map(int,input().split()))
count = 0
while L >= S:
  S *= 2
  count += 1
print (count)

Submission status: Accepted

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

flag = True
count = 1

while flag:
    if x * 2 <= y:
        x = x * 2
        count += 1
        continue
    else:
        flag = False

print(count)

Submission status: Accepted

Solution code:
def i1():
 return int(input())
def i2():
 return [int(i) for i in input().split()]
[x,y]=i2()
k=0
n=1
while y>=n*x:
 
 k+=1
 n*=2
print(k)

Submission status: Accepted

Solution code:
def solve(x, y):
    i = 0
    while x <= y:
        i += 1
        x *= 2
        # print(x, y)
    print(i)


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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3


def solve(x, y):
    r = y // x
    return r.bit_length()


def main():
    x, y = (int(z) for z in input().split())
    res = solve(x, y)
    print(res)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s = input().split()
x = int(s[0])
y = int(s[1])

count = 0
tmp = x

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

print(count)

Submission status: Accepted

Solution code:
X,Y = map(int,input().split())
from math import log2,ceil
p = ceil(log2(Y)-log2(X))
while Y >= X*(2**p):
  p += 1
print(p)

Submission status: Accepted

Solution code:
# your code goes here
import math

s = raw_input().split()
x = int(s[0])
y = int(s[1])
ans = 0
while x <= y:
	ans += 1
	x = x*2
print ans

Submission status: Accepted

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

Submission status: Accepted

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

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

print(i)

Submission status: Accepted

Solution code:
X,Y = map(int, input().split())
# 2^10 > 10^3 => 2^60 > 10^18
x = X
cnt = 0
while x <= Y:
	cnt += 1
	x *= 2
print(cnt)

Submission status: Accepted

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

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

if __name__=="__main__":
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

import sys

line = sys.stdin.readline()
X, Y = map(int, line.split())

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
n,m = map(int,stdin.readline().split())
a= []
while True:
    if n > m:
        break
    a.append(n)
    n = 2*n
print len(a)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
def inpl(): return tuple(map(int, input().split()))
X, Y = inpl()
res = 0

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

print(res)

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 = map(int,input().split())
a = X
ans = 1
while True:
    a *= 2
    if a > Y: break
    ans += 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

import array
from bisect import *
from collections import *
import fractions
import heapq 
from itertools import *
import math
import random
import re
import string

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

l = 0
while x <= y:
    x *= 2
    l += 1
print l

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
'''input
3 20
'''

def list_input():
    return list(map(int,input().split()))
def map_input():
    return map(int,input().split())
def map_string():
    return input().split()
    
x,y = map_input()
ans = 0
while x <= y:
	x *= 2
	ans += 1
print(ans)

Submission status: Runtime Error

Solution code:
# coding: utf-8


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

if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
3 20

Submission status: Runtime Error

Solution code:
/*
ID: learnin7
TASK: test
LANG: C++                 
*/
/* LANG can be C++11 or C++14 for those more recent releases */
#include<bits/stdc++.h>

/*  Macros from Endagorion */
#define mp make_pair
#define mt make_tuple
#define fi first
#define se second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)
#define ford(i, n) for (int i = (int)(n) - 1; i >= 0; --i)
#define fore(i, a, b) for (int i = (int)(a); i <= (int)(b); ++i)

using namespace std;

typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<pii> vpi;
typedef vector<vi> vvi;
typedef long long i64;
typedef vector<i64> vi64;
typedef vector<vi64> vvi64;
typedef pair<i64, i64> pi64;
typedef double ld;


int main(){
        
    ios_base::sync_with_stdio(0);
    
    //ofstream fout ("test.out");
    //ifstream fin ("test.in");
    //fin >> a >> b;
    //fout << a+b << endl;
    i64 x,y;
    cin>>x>>y;
    i64 cnt=0;
    while(x<=y){
        x *=2;
        cnt++;
    }
    cout<<cnt<<endl;
    return 0;
}

Submission status: Runtime Error

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

for i in range(1,10*4):
  x<<=1
  if x>y:
    print(i)
	break