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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

Solution code:
from sys import stdin, setrecursionlimit


def main():
    input = stdin.buffer.readline
    x, y = map(int, input().split())
    count = 0
    tmp = x
    while tmp <= y:
        tmp *= 2
        count += 1
    print(count)


if __name__ == "__main__":
    setrecursionlimit(10000)
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
x, y = map(int, input().split())
i = 1
c = y - x + 1

while True:
    if c <= y:
        c = 2**i * x
        i += 1
    else:
        print(i - 1)
        break

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

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

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

print(count)

Submission status: Accepted

Solution code:
# coding: utf-8
import re
import math
from collections import defaultdict
from collections import deque
import itertools
from copy import deepcopy
import random
import time
import os
import queue
import sys
import datetime
from functools import lru_cache
#@lru_cache(maxsize=None)
readline=sys.stdin.readline
sys.setrecursionlimit(2000000)
#import numpy as np
alphabet="abcdefghijklmnopqrstuvwxyz"
mod=int(10**9+7)
inf=int(10**20)
def yn(b):
    if b:
        print("yes")
    else:
        print("no")
def Yn(b):
    if b:
        print("Yes")
    else:
        print("No")
def YN(b):
    if b:
        print("YES")
    else:
        print("NO")
class union_find():
    def __init__(self,n):
        self.n=n
        self.P=[a for a in range(N)]
        self.rank=[0]*n
 
    def find(self,x):
        if(x!=self.P[x]):self.P[x]=self.find(self.P[x])
        return self.P[x]
 
    def same(self,x,y):
        return self.find(x)==self.find(y)
 
    def link(self,x,y):
        if self.rank[x]<self.rank[y]:
            self.P[x]=y
        elif self.rank[y]<self.rank[x]:
            self.P[y]=x
        else:
            self.P[x]=y
            self.rank[y]+=1
 
    def unite(self,x,y):
        self.link(self.find(x),self.find(y))
 
    def size(self):
        S=set()
        for a in range(self.n):
            S.add(self.find(a))
        return len(S)
def is_pow(a,b):#aはbの累乗数か
    now=b
    while now<a:
        now*=b
    if now==a:return True
    else:return False
def bin_(num,size):
    A=[0]*size
    for a in range(size):
        if (num>>(size-a-1))&1==1:
            A[a]=1
        else:
            A[a]=0
    return A
def get_facs(n,mod_=0):
    A=[1]*(n+1)
    for a in range(2,len(A)):
        A[a]=A[a-1]*a
        if(mod_>0):A[a]%=mod_
    return A
def comb(n,r,mod,fac):
    if(n-r<0):return 0
    return (fac[n]*pow(fac[n-r],mod-2,mod)*pow(fac[r],mod-2,mod))%mod
def next_comb(num,size):
    x=num&(-num)
    y=num+x
    z=num&(~y)
    z//=x
    z=z>>1
    num=(y|z)
    if(num>=(1<<size)):return False
    else:return num
def get_primes(n,type="int"):
    if n==0:
        if type=="int":return []
        else:return [False]
    A=[True]*(n+1)
    A[0]=False
    A[1]=False
    for a in range(2,n+1):
        if A[a]:
            for b in range(a*2,n+1,a):
                A[b]=False
    if(type=="bool"):return A
    B=[]
    for a in range(n+1):
        if(A[a]):B.append(a)
    return B
def is_prime(num):
    if(num<=1):return False
    i=2
    while i*i<=num:
       if(num%i==0):return False
       i+=1
    return True
def ifelse(a,b,c):
    if a:return b
    else:return  c
def join(A,c=""):
    n=len(A)
    A=list(map(str,A))
    s=""
    for a in range(n):
        s+=A[a]
        if(a<n-1):s+=c
    return s
def factorize(n,type_="dict"):
    b = 2
    list_ = []
    while b * b <= n:
        while n % b == 0:
            n //= b
            list_.append(b)
        b+=1
    if n > 1:list_.append(n)
    if type_=="dict":
        dic={}
        for a in list_:
            if a in dic:
                dic[a]+=1
            else:
                dic[a]=1
        return dic
    elif type_=="list":
        return list_
    else:
        return None
def floor_(n,x=1):
    return x*(n//x)
def ceil_(n,x=1):
    return x*((n+x-1)//x)
    return ret
def seifu(x):
    return x//abs(x)
######################################################################################################
def main():
    x,y=map(int,input().split())
    A=[x]
    while A[-1]*2<=y:
        A.append(A[-1]*2)
    print(len(A))
main()

Submission status: Accepted

Solution code:
#print#!/usr/bin/env python3
#%% for atcoder uniittest use
import sys
input= lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**9)
def pin(type=int):return map(type,input().split())
def tupin(t=int):return tuple(pin(t))
def lispin(t=int):return list(pin(t))
#%%code
def resolve():
    X,Y=pin()
    for i in range(10**7):
        if X>Y:print(i);return
        else:X*=2
#%%submit!
resolve()

Submission status: Accepted

Solution code:
import sys
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
X,Y = LI()
ans = 1
while 1:
    X *= 2
    if X>Y:
        break
    ans += 1
print(ans)

Submission status: Accepted

Solution code:
import sys
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
X,Y = LI()
ans = 1
while 2*X<=Y:
    X *= 2
    ans += 1
print(ans)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

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

Submission status: Accepted

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

main()

Submission status: Accepted

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

Submission status: Accepted

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

left = 0
right = 10**5
maxi = y//x
while left+1 < right:
    mid = (left+right)//2
    now = 2**mid
    if now > maxi:
        right = mid
    else:
        left = mid

print(left+1)

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=1
tmp=x
for i in range(x,y+1):
    if tmp*2>y:
        break
    tmp*=2
    ans+=1
print(ans)

Submission status: Accepted

Solution code:
X,Y=map(int,input().split())
for i in range(1,1000):
	if X*(2**i)>Y:
		print(i)
		exit()

Submission status: Accepted

Solution code:
from collections import deque
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import product,permutations,combinations,combinations_with_replacement
from collections import defaultdict,Counter
from bisect import bisect_left,bisect_right
# from math import gcd,ceil,floor,factorial
# from fractions import gcd
from functools import reduce
from pprint import pprint

INF = float("inf")

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

def mylistinput(n):
    return [ list(myinput()) for _ in range(n) ]

def mycol(data,col):
    return [ row[col] for row in data ]

def mysort(data,col,reverse_flag):
    data.sort(key=lambda x:x[col],reverse=reverse_flag)
    return data

def mymax(data):
    M = -1*float("inf")
    for i in range(len(data)):
        m = max(data[i])
        M = max(M,m)
    return M

def mymin(data):
    m = float("inf")
    for i in range(len(data)):
        M = min(data[i])
        m = min(m,M)
    return m

def mycount(ls,x):
    # lsはソート済みであること
    l = bisect_left(ls,x)
    r = bisect_right(ls,x)
    return (r-l)

def myoutput(ls,space=True):
    if space:
        if len(ls)==0:
            print(" ")
        elif type(ls[0])==str:
            print(" ".join(ls))
        elif type(ls[0])==int:
            print(" ".join(map(str,ls)))
        else:
            print("Output Error")
    else:
        if len(ls)==0:
            print("")
        elif type(ls[0])==str:
            print("".join(ls))
        elif type(ls[0])==int:
            print("".join(map(str,ls)))
        else:
            print("Output Error")

from math import ceil,floor,log
x,y = myinput()

M = ceil( log(y/x,2) ) + 1

count = 0
for i in range(M):
    if x*(2**i)<=y:
        count += 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)
#print((y//x).bit_length())

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(res)

Submission status: Accepted

Solution code:
from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations # (string,3) 3回
from collections import deque
from collections import defaultdict
import bisect
#
#    d = m - k[i] - k[j]
#    if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#

import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

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

def main():
    x,y = readInts()
    cnt = 0
    while x <= y:
        cnt += 1
        x *= 2
    print(cnt)
if __name__ == '__main__':
  main()

Submission status: Accepted

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

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

print(count)

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

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

    
resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
def printns(x): print('\n'.join(x))
def printni(x): print('\n'.join(list(map(str,x))))
inf = 10**17
mod = 10**9 + 7
#s=input().rstrip()

x,y=MI()
count=0
for i in range(100):
    if x<=y:
        x*=2
        count+=1
    else:
        break
print(count)

Submission status: Accepted

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

tmp = X
ans = [X]
for i in range(int(1e5)):
    tmp *= 2
    if tmp > Y:
        break
    ans.append(tmp)

print(len(ans))

Submission status: Accepted

Solution code:
def main():
    x, y = (int(i) for i in input().split())
    A = [x]
    while A[-1]*2 <= y:
        A.append(A[-1]*2)
    print(len(A))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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:
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:
# -*- coding: utf-8 -*-
import sys

import fractions
import copy
import bisect
import math
import numpy as np
import itertools
from itertools import combinations_with_replacement
#import math#数学的計算はこれでいける。普通に0.5乗しても計算可能
#w=input()
from operator import itemgetter
from sys import stdin
#input = sys.stdin.readline#こっちの方が入力が早いが使える時に使っていこう
from operator import mul
from functools import reduce
from collections import Counter
#from collections import deque

#input = stdin.readline


j=0
k=0
n=3
r=1
a=[0]
#n=int(input())
#r=int(input())
#print(M)
#A=int(input())
#B=int(input())
#print(N)
"1行1つの整数を入力を取得し、整数と取得する"


#number_list=list(map(int, input().split(" ")))#数字の時
#print(number_list)
"12 21 332 とか入力する時に使う"
"1行に複数の整数の入力を取得し、整数として扱う"

'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''
#メモ
for i in number_list:#こっちの方がrage使うより早いらしい
    print(number_list[i-1])#

'''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''''

'''
x=[]
y=[]
for i in range(N):
    x1, y1=[int(i) for i in input().split()]
    x.append(x1)
    y.append(y1)
print(x)
print(y)
"複数行に2数値を入力する形式 x座標とy座標を入力するイメージ"
'''

'''
mixlist=[]
for i in range(N):
    a,b=input().split()
    mixlist.append((int(a),b))
print(mixlist)
"複数行にintとstrを複合して入力するやつ，今回はリスト一つで処理している"
'''

'''
#array=[input().split()for i in range(N)]
#print(type(array[0][0]))
#print(array)
"正方行列にstr型の値を入力"
'''

#brray=[list(map(int, input().split(" ")))for i in range(N)]
#print(type(brray[0][0]))
#print(brray)
'''
入力
1 2
4 5
7 8
出力結果
[[1, 2], [4, 5], [7, 8]]
'''
"列数に関して自由度の高いint型の値を入力するタイプの行列"
#以下に別解を記載
#N, M = [int(i) for i in input().split()]
'''
table = [[int(i) for i in input().split()] for m in range(m)]

print(type(N))
print(N)
print(type(M))
print(M)

print(type(table))
print(table)
'''




#s=input()
#a=[int(i) for i in s]
#print(a[0])
#print([a])
#単数値．桁ごとに分割したい．入力と出力は以下の通り
#イメージとして1桁ごとにリストに値を入れているかんじ
#intを取ると文字列分解に使える
'''
入力
1234
出力
1
[[1, 2, 3, 4]]
'''




'''
word_list= input().split(" ")
print(word_list[0])
"連続文字列の入力"
"qw er ty とかの入力に使う"
"入力すると空白で区切ったところでlistの番号が与えられる"
'''



'''
A, B, C=stdin.readline().rstrip().split()#str style 何個でもいけることが多い
print(A)
"リストではなく独立したstr型を入れるなら以下のやり方でOK"
'''


#a= stdin.readline().rstrip()
#print(a.upper())
"aという変数に入っているものを大文字にして出力"


#a,b=map(int, input().split())  #int style 複数数値入力　「A B」みたいなスペース空いた入力のとき

#なんかうまく入力されるけど
#a=[[int(i) for i in 1.strip()]for 1 in sys.stdin]
#a = [[int(c) for c in l.strip()] for l in sys.stdin]]
#print(a)
#複数行の数値を入力して正方行列を作成


##############################################################################################
##############################################################################################
#under this line explains example calculation



'''
コンビネーションの組み合わせの中身を出力する形式
for i in itertools.combinations(brray, 2)
combinationsをpermutationsにすれば順列になる
今回なら(abc133B)
入力
1 2
5 5
-2 8
出力
[[1, 2], [5, 5], [-2, 8]]
もちろん一次元リストでも使えるし
何よりiもリストのように使えるので便利
'''

#nCr combination
'''
def cmb(n,r):
    #When n < r , this function isn't valid
    r= min(n-r,r)
    #print(n,r)
    if r == 0: return 1
    over = reduce(mul, range(n, n-r, -1))
    #flochart mul(n,n-1)=x
    #next     mul(x,n-2)........(n-r+1,n-r)
    #mul read a,b and returns a*b

    under = reduce(mul, range(1, r+1))
    #print(over, under)
    #reduce is applied mul(1,2)=2
    #next   mul(2,3)=6
    #next   mul(6,4)=4.........last(r!,r+1)=r+1!

    return over // under
    #// is integer divide
    #calc example 5C2
    #over=5*4*3
    #under=3*2*1
a = cmb(n, r)
#print(a)
'''

'''
import itertools
from itertools import combinations_with_replacement

combinationについて
以下の違いを意識しよう
combinations() p, r 長さrのタプル列、ソートされた順で重複なし

combinations_with_replacement() p, r 長さrのタプル列、ソートされた順で重複あり


使用例 　　　　　　　　　　　                  出力　　
combinations('ABCD', 2)　　　　　　　　　　　　AB AC AD BC BD CD

combinations_with_replacement('ABCD', 2)　　 AA AB AC AD BB BC BD CC CD DD
'''



'''
#集計
#example
#a=[2,2,2,3,4,3,1,2,1,3,1,2,1,2,2,1,2,1]
#a=Counter(a)
for i in a.most_common(n):print(i)
#most_common()メソッドは、出現回数が多い要素順にCounterオブジェクトを並び替えます。
#引数にint型の数字nを設定した場合は、出現回数が高い上位ｎ個の要素を返します。
#何も設定しなければ、コンテナ型にあるすべての要素を出現回数の順番に並び替えたタプル型オブジェクトを返します。
#out put
#(2, 8)
 #(1, 6)
#(3, 3)
#(4, 1)
'''


#二部探索(binary search)
#A = [1, 2, 3, 3, 3, 4, 4, 6, 6, 6, 6]
#print(A)
#index = bisect.bisect_left(A, 5) # 7 最も左(前)の挿入箇所が返ってきている
#A.insert(index, 5)
#print(index)
#print(A)
'''
bisect.bisect_left(a, x, lo=0, h=len(a))
引数
a: ソート済みリスト
x: 挿入したい値
lo: 探索範囲の下限
hi: 探索範囲の上限
(lo, hiはスライスと同様の指定方法)
bisect_leftはソートされたリストaに対して順序を保ったままxを挿入できる箇所を探索します。leftが示す通り、aにすでにxが存在している場合は、挿入箇所は既存のxよりも左側になります。また、lo, hiを指定することで探索範囲を絞り込むことも可能です。デフォルトはaの全体が探索対象です。
'''

'''
素数の判定
'''


def is_prime(n):
    if n == 1: return False

    for k in range(2, int(np.sqrt(n)) + 1):
        #sqrt(n)+1以上は考えて約数はないので却下
        if n % k == 0:
            return False
            #割り切れたらFalse
    return True


'''
npのmaxとmaximumの違い
xs = np.array([1, -2, 3])
np.max(xs, 0)
この出力は3となります．[1, -2, 3]と0の4つの数字のうち，最も大きい値を出力します．

一方で，[max(1, 0), max(-2, 0), max(3, 0)]を出力したい時があります．
その時は，numpyのmaximum関数を用います．

xs = np.array([1, -2, 3])
np.maximum(xs, 0)  # [1, 0, 3]

'''
def yuu(n1, n2):#最大公約数を用いた計算のためにあるユークリッドの互除法
 x=max(n1,n2)
 y=min(n1,n2)
 while y==0:
    r=x%y

    x=y
    y=r
 return y

########################################################################
########################################################################
#b2=a[:]  #1次元のときはコピーはこれで良い
#print(b2)

#a= [[0]*3 for i in range(5)] #2次元配列はこう準備、[[0]*3]*5だとだめ
#b3=copy.deepcopy(a)  #2次元配列はこうコピーする
#print(b3)

def main():

    w=1
    j=0
    k=0
    x1=0
    x2=0
    ans=[0]*1000000
    #number_list=list(map(int, input().split(" ")))
    x,y=map(int, input().split(" "))
    #print(yuu(x,y))
    #x=number_list[0]
    #y=number_list[1]

    ans[0]=x
    x1=2*ans[0]
    if x1 > y:
        ans=[i for i in ans if i > 0]
        print(len(ans))
        sys.exit()
    ans[1]=x1
    for i in range(100000):
        x2= 2*x1*x//(yuu(x1, x))
        #print(x2,x1,x)
        if x2 >y:
            ans=[i for i in ans if i > 0]
            print(len(ans))
            sys.exit()
        ans[i+2]=x2
        x=x1
        x1=x2


    #r=int(input())
    #dp= [[0]*3 for i in range(5)]#列　行
    #dp用の0の入ったやつ
    #dp= [[0]*(w+1) for i in range(n+1)]#0からwまでのw+1回計算するから
    #print(dp)＃初期条件が入る分計算回数+1列分必要(この場合は判断すべきものの数)
    DP = np.zeros(w+1, dtype=int)#これでも一次元リストが作れる
    exdp=np.zeros((3,4)) # ３×４の２次元配列を生成。2次元ならこう
    #dtypeは指定しないとfloatになる
    #for i in range(n):#ちょっとした入力に便利
    #    a, b = map(int, input().split())
        #dp[i][0] += [a]
        #これだとintとlistをつなぐことになって不適
    #    dp[i] += [a]
    #    dp[i] += [b]
        #これはうまくいく
        #やり方はいろいろあるということ
    #print(dp)


    "1行1つの整数を入力を取得し、整数と取得する"
    #number_list=list(map(int, input().split(" ")))#数字の時
    #print(number_list)
    "12 21 332 とか入力する時に使う"
    "1行に複数の整数の入力を取得し、整数として扱う"
    #brray=[list(map(int, input().split(" ")))for i in range(N)
    #print(brray)


    #s=input()
    #a=[int(i) for i in s]#int取るとstrでも行ける
    #print(a)
    '''
    入力
    1234
    出力
    [1, 2, 3, 4]
    '''
    pin_l=["x" for i in range(10)]#内包表記に慣れろ
    #print(pin_l)

    ls = ["a", "b", "c", "d", "e"]


    #print(ls[2:5])
    #スライスでの取得

    #print(ls[:-3])
    #一番左端から右から3番目より左まで取得

    #print(ls[:4:2])
    #スライスで1個飛ばしで取得
    #ないときは左端スタート
    #始点のインデックス番号 : 終点のインデックス番号 : スキップする数+1
    #print(ls[::2])
    '''
    lsというリストの場合に、1つ飛びの値を取得したい場合には
    ls[::2]
    のようにします。こうすると、
    ["a", "c", "d"]と出力される
    '''

if __name__ == "__main__":
    main()

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

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

Submission status: Accepted

Solution code:
import sys
import math

input = sys.stdin.readline
MOD = 1000000007

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


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

Submission status: Accepted

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

ans = 0

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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())
cnt = 0

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!python3

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


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


if __name__ == "__main__":
    main()

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

Submission status: Accepted

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

Submission status: Accepted

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

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()))
bits = len(format(y, 'b'))

cnt = 0
for i in range(bits):
  if x * (2 ** i) > y:
    break
  cnt += 1
print(cnt)

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

Submission status: Accepted

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

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

print(ans)

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:

def myAnswer(X:int,Y:int) -> int:
   if(X*2 > Y): return 1
   ans = X
   total = 1
   while True:
      ans *= 2
      if(ans > Y):
         break
      else:
         total += 1
   return total


def modelAnswer():
   tmp=1
def main():
   X, Y = map(int,input().split())
   print(myAnswer(X,Y))
if __name__ == '__main__':
   main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

for i in range(100):
  a = x*(2**i)
  if(a<=y):
    continue
  else:
    print(i)
    break

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

x = X
ans = 0
while x < Y:
    x *= 2
    ans += 1
print(ans if x > Y else ans + 1)

Submission status: Accepted

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

A = X
ans = 1

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

print(ans)

Submission status: Accepted

Solution code:
from math import log2
X, Y = map(int, input().split())

A = X
ans = 1

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

print(ans)

Submission status: Accepted

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

if __name__ == "__main__":
  resolve()

Submission status: Accepted

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

X_tmp = X
for ans in range(1000000007):
    if X_tmp > Y: break
    X_tmp <<= 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:
import sys

def solve():
    input = sys.stdin.readline
    X, Y = map(int, input().split())
    length = 0
    now = X
    while now <= Y:
        now *= 2
        length += 1
    print(length)

    return 0

if __name__ == "__main__":
    solve()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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