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

Submission status: Accepted

Solution code:


def resolve():
    X,Y=map(int,input().split())

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



if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,y = [int(i) for i in input().split()]
ans = 1
for i in range(1,61):
  if y//x < 2**i:
    break
  else:
    ans += 1
print(ans)

Submission status: Accepted

Solution code:
#083_C
x, y = map(int, input().split())
z = y // x

for i in range(10**18):
    if x * pow(2,i) > y:
        print(i)
        break

Submission status: Accepted

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

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

Submission status: Accepted

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

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:
def main():
    x, y = map(int, input().split())
    last_num = x
    ans = 1
    while 1:
        if last_num * 2 <= y:
            last_num *= 2
            ans += 1
        else:
            break
    print(ans)

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 = 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:
x,y = [int(x) for x in input().split()]

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

A = [X]

i = 0

while A[i] <= Y:
  A.append(A[i] * 2)
  i += 1

print(i)

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:
#!/usr/bin/env python3


def main():
    # n = int(input())
    # i = list(map(int,input().split()))
    # j = list(map(int,input().split()))

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

    cnt = 0

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

    print(cnt)

main()

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

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

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

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 Multiple_Gift(x , y):

    ans = 1

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

    return ans

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import numpy as np

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

print(np.floor(np.log2(y//x,dtype=np.longdouble)).astype(np.int)+1)

Submission status: Accepted

Solution code:
# coding: utf-8


def solve(*args: str) -> str:
    x, y = map(int, args[0].split())

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

    return str(count)


if __name__ == "__main__":
    print(solve(*(open(0).read().splitlines())))

Submission status: Accepted

Solution code:
x,y=input().split();
k,w=int(y)//int(x),1
while 2**(w-1)<=k:w=w+1
print(w-1)

Submission status: Accepted

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

print(r)

Submission status: Accepted

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

count = 0
while X <= Y:
    Y = Y >> 1
    count += 1

print(count)

Submission status: Accepted

Solution code:
import math
x,y=map(int,input().split())
for p in range(61):
    if 2**p>y//x:
        print(p)
        exit(0)

Submission status: Accepted

Solution code:
def solve():
    min_number, max_number = list(map(int, input().split()))

    current_number = min_number
    answer = 0

    while current_number <= max_number:
        answer += 1
        current_number = current_number * 2

    print(answer)
    
solve()

Submission status: Accepted

Solution code:
def solve():
    min_number, max_number = list(map(int, input().split()))

    current_number = min_number
    answer = 1

    while True:
        next_number = current_number * 2
        if next_number <= max_number:
            current_number = next_number
            answer += 1
        else:
            break

    print(answer)


solve()

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines

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

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

    ans = i
    print(ans)

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(count+1)

Submission status: Accepted

Solution code:
import sys
from itertools import permutations
import math
from operator import itemgetter

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
import math
import heapq
import bisect
import numpy as np
from collections import Counter
#from scipy.misc import comb

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

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

print(ans)

Submission status: Accepted

Solution code:
X_low, Y_up = map(int, input().split())

value = X_low
cnt = 0

while (value <= Y_up):
    cnt += 1
    value *= 2

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def lcm(x, y):
    return (x * y) // math.gcd(x, y)

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

i = 0
while True:
  if x * 2 ** i > y:
    break

# 12
  i += 1
  
print(i)

Submission status: Accepted

Solution code:
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
mod=10**9+7

x,y=MI()
ans=1

a=x
for i in range(1000):
    a=a*2
    if a>y:
        break
    ans+=1
    
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import fractions
x,y=map(int,input().split())
cnt=1
a,b=x,x*2
while True:
    if b<=y:
        g=a*b//fractions.gcd(a,b)#最小公倍数
        a,b=b,2*g
        cnt+=1
    else:
        break
print(cnt)

Submission status: Accepted

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

while x <= y:
    res.append(x)
    x = x * 2
    
print(len(res))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from decimal import Decimal
X,Y = list(map(int,input().split()))
print(int((Decimal(Y)/Decimal(X)).ln()/Decimal(2).ln())+1)

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:
import itertools
import math
import sys
from collections import Counter
from fractions import gcd
from functools import reduce

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

Submission status: Accepted

Solution code:
A, B = map(int, input().split())
a = []
a.append(A)
while max(a)<B:
    a.append(max(a)*2)
if max(a)>B:
    a.remove(max(a))
print(len(a))

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
for i in range(1000000):
  if a*2**i>b:
    print(i)
    exit()

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
def main():
  
  x,y=map(int,input().split())
  ans=1
  while(True):
    if x*2<=y:
      ans+=1
      x=2*x
    else:
      break
  print(ans)
if __name__=="__main__":
  main()

Submission status: Accepted

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

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

print(len(l))

Submission status: Accepted

Solution code:
def main():
    lower_limit, upper_limit = map(int, input().split())
    answer = 0
    while lower_limit <= upper_limit:
        lower_limit *= 2
        answer += 1
    print(answer)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import math
from decimal import *
X, Y = [int(x) for x in input().split()]
X = Decimal(str(X))
Y = Decimal(str(Y))
i = 1
cnt = 0
while True:
    if i > Decimal(Y/X):
        break
    i *= 2
    cnt += 1
print(cnt)

Submission status: Accepted

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

    ans = 0

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

if __name__ == '__main__':
    main()

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

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

Submission status: Accepted

Solution code:
import math
import fractions
import bisect
import collections
import itertools
import heapq
import string
import sys
import copy
from collections import deque
sys.setrecursionlimit(10**7)
MOD = 10**9+7
def gcd(a,b):return fractions.gcd(a,b) #最大公約数
def lcm(a,b):return (a*b) // fractions.gcd(a,b) #最小公倍数
def iin(): return int(input()) #整数読み込み
def ifn(): return float(input()) #浮動小数点読み込み
def isn(): return input().split() #文字列読み込み
def imn(): return map(int, input().split()) #整数map取得
def fmn(): return map(float, input().split()) #浮動小数点map取得
def iln(): return list(map(int, input().split())) #整数リスト取得
def iln_s(): return sorted(iln()) # 昇順の整数リスト取得
def iln_r(): return sorted(iln(), reverse=True) # 降順の整数リスト取得
def fln(): return list(map(float, input().split())) # 浮動小数点リスト取得
def join(l, s=''): return s.join(l) #リストを文字列に変換
def perm(l, n): return itertools.permutations(l, n) # 順列取得
def perm_count(n, r): return math.factorial(n) // math.factorial(n-r) # 順列の総数
def comb(l, n): return itertools.combinations(l, n) # 組み合わせ取得
def comb_count(n, r): return math.factorial(n) // (math.factorial(n-r) * math.factorial(r)) #組み合わせの総数
def two_distance(a, b, c, d): return ((c-a)**2 + (d-b)**2)**.5 # 2点間の距離
def m_add(a,b): return (a+b) % MOD

X, Y = imn()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc083/tasks/arc088_a
import math

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

# print((int(math.log2(y / x))) + 1)
ans = 0
while x <= y:
    x *= 2
    ans += 1

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def input_int():
    return map(int, input().split())

def one_int():
    return int(input())

def one_str():
    return input()

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

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

Submission status: Accepted

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

def ans(x,x2,y):
    if x>y:
        return 0
    else:
        return ans(x2,x2*2,y)+1

print(ans(x,x*2,y))

Submission status: Accepted

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

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

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=map(int,input().split())
k=x
cnt = 0
while k<=y:
  k*=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:
import sys
input = sys.stdin.readline
X,Y = [int(i) for i in input().split()]
count = 1
while True:
    if X * 2 <= Y:
        X *=2
        count+=1
    else :
        break
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

main()

Submission status: Accepted

Solution code:
x,y = map(int, input().split())
cnt=0
while True:
    if x>y:
        break

    else:
        x = x*2
        cnt+=1

print(cnt)

Submission status: Accepted

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

#print("ex",ex)

counter = 1
exCount = 1
while True:
  if exCount * 2 > ex:
    break
  else:
    counter += 1
    exCount *= 2

print(counter)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
x,y = map(int,input().split())
i = 1
while True:
    if y >= x * (2**i):
        i += 1
    else: break
print(i)

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

a0 = x
k = 0

for i in range(10**7):
    if a0 * (2 ** i) <= y:
        pass
    else:
        k = i
        break

print(k)

Submission status: Accepted

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

a0 = x
k = 0
for i in range(10**7):
    if a0 * (2 ** i) <= y:
        pass
    else:
        k = i
        break
print(k)

Submission status: Accepted

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

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

Submission status: Accepted

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

# これで通らないのは、y/xが大きな数字になったとき
# print(int(log2(y/x)) + 1)

tmp = y//x
cnt = 0
while tmp >= 2:
    cnt += 1
    tmp = tmp // 2
print(cnt + 1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,y=[int(x) for x in input().split()]
ans=[x]
while ans[-1]*2<=y:
    ans.append(ans[-1]*2)
# print(ans)
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 = 0
while X <= Y:
    X *= 2
    ans += 1
print(ans)

Submission status: Accepted

Solution code:
def solve(x, y):
    count = 0
    while x <= y:
        x *= 2
        count += 1
    return count

_x, _y = map(int, input().split())
print(solve(_x, _y))

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,y=list(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=1
a=x
while a<=y:
    if 2*a<=y:
        cnt+=1
    a=a*2

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#n = int(input())
x,y = map(int,input().split())
#lst1 = list(map(int,input().split()))
lst1 = []
while True:
    lst1.append(x)
    if x*2 <= y:
        x*=2
    else:
        break
print(len(lst1))

Submission status: Accepted

Solution code:
# 要復習
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
from bisect import bisect
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
 
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

def main():
    x, y = MAP()
    count = 0
    while x <= y:
        x = 2 * x
        count += 1
    print(count)
if __name__ == "__main__":
    main()

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

c = bin(b//a)

print(len(c)-2)

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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





if __name__ == '__main__':
    main()

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

Submission status: Accepted

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

a = X
ans = 0

while True:
    if a <= Y:
        ans += 1
        a *= 2
    else:
        break

print(ans)

Submission status: Accepted

Solution code:
X, Y = map(int, input().split())
A = []
A.append(X)
for i in range(Y):
    if X * 2 <= Y:
        X *= 2
        A.append(X)
    else:
        break
print(len(A))

Submission status: Accepted

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

cnt=0

p=x

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


print(cnt)

Submission status: Accepted

Solution code:
x, y = map(int, input().split())
i = x
ans = [i]
while i <= y:
    i = i * 2
    if i <= y:
        ans.append(i)
print(len(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())
b = 0
while True:
    Y = Y//2
    if Y < X:
        b += 1
        break
    b += 1
print(b)

Submission status: Accepted

Solution code:
x,y=map(int,input().split())
a=y//x
print(1+len(bin(a))-bin(a).find('1')-1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/python3
# vim: set fileencoding=utf-8:
import sys
input = sys.stdin.readline

"""
H = int(input())
h = [int(ele) for ele in input().split()]
h = [0] + h
"""


def main():
    A = []
    X, Y = map(int, input().split())
    n = X
    A.append(n)

    while n * 2 <= Y:
        n = n*2
        A.append(n)

    print(len(A))


def bfs(queue):
    global yet, graph
    if len(queue) == 0:
        return
    yet.remove(queue[-1])

    for i, adjacency in enumerate(graph[queue[-1]]):
        if adjacency == 1 and (i in yet) and (i not in queue):  # 隣接かつ未探索であれば、stackにpush
            queue.appendleft(i)
    else:
        queue.pop()
        bfs(queue)


def dfs(stack):
    global yet, graph
    yet.remove(stack[-1])

    for i, adjacency in enumerate(graph[stack[-1]]):
        if adjacency == 1 and i in yet:  # 隣接かつ未探索であれば、stackにpush
            stack.append(i)
            dfs(stack)
    else:
        stack.pop()


def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
        if i != n // i:
            divisors.append(n//i)
    return divisors


class Node():

    def __init__(self):
        self.idx = None
        self.left = None
        self.right = None
        self.parent = None
        return

    def pre_order(self):
        global pre_order_str
        pre_order_str += str(self.idx) + " "
        if self.left:
            self.left.pre_order()

        if self.right:
            self.right.pre_order()

    def in_order(self):
        global in_order_str

        if self.left:
            self.left.in_order()

        in_order_str += str(self.idx) + " "

        if self.right:
            self.right.in_order()

    def post_order(self):
        global post_order_str
        if self.left:
            self.left.post_order()

        if self.right:
            self.right.post_order()

        post_order_str += str(self.idx) + " "


class HeapHelper():
    """HeapContrler.
    完全二分木を二分ヒープで表現した配列 A に対して、
    HeapHelper.parent(idx) とするとそのノードの親の添字を返す
    存在しない場合は Falseを返す

    Returns:
        [type] -- [description]
    """

    def __init__(self):
        return

    @staticmethod
    def parent(i):
        if i == 1:
            return False

        return int(i/2)

    @staticmethod
    def left(i):
        l_idx = 2*i
        if H < l_idx:
            return False

        return l_idx

    @staticmethod
    def right(i):
        r_idx = 2*i + 1
        if H < r_idx:
            return False

        return r_idx


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
X,Y = (int(_) for _ in input().split())  
cnt = 1
tmp = X
while tmp*2 <= Y:
    #print(tmp)
    cnt += 1
    tmp = tmp*2
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())
n=y//x
print(len(bin(n))-2)

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

Submission status: Accepted

Solution code:
X, Y = map(int, input().split())
d = Y // X
p = 0
while d != 0:
  p += 1
  d //= 2
print(p)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
x,y=map(int,input().split())
ans=1
for i in range(y-x):
    x*=2
    if x>y:
        break
    ans+=1
print(ans)

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:
import sys
import os
if sys.platform=="darwin":
	base = os.path.dirname(os.path.abspath(__file__))
	name = os.path.normpath(os.path.join(base, '../Documents/input.txt'))
	#print(name)
	sys.stdin = open(name)

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

a = x
ans = 0

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

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:
temp=list(map(int, input().split()))
X=temp[0]
Y=temp[1]

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X, Y = list(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 = 0

for i in range(10**18):
    x *= 2
    if x > y:
        ans = i+1
        break

print(ans)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

for i in range(100):
	if x * (2 ** i) > y:
		print(i)
		break

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

Z = Y // X

num = 0

while True:
    if Z < (1 << num):
        break
    num += 1
print(num)

Submission status: Accepted

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

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

print(n)

Submission status: Accepted

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

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