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:
  ans += 1
  x *= 2
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:
from sys import stdin
input = stdin.readline


def main():
  X, Y = list(map(int, input().split()))
  cnt = 1
  while True:
    X *= 2
    if X > Y:
      break
    cnt += 1

  print(cnt)


if(__name__ == '__main__'):
  main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
X,Y=map(int,input().split())
if Y<X:
    print(0)
else:
    count=1
    while X<Y:
        X*=2
        if X<=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)

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())
ans = 1
while X <= Y:
    X *= 2
    if X > Y:
        break
    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, input().split())
res = 1
for i in range(100):
  x *= 2
  if x <= y:
    res += 1
  else:
    print(res)
    exit()

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

Submission status: Accepted

Solution code:
x, y = map(int, input().split())
ans = 1
while x <= y:
    x *= 2
    if x <= y:
        ans += 1
    else:
        break
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:
from math import log2

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

def ii():
    return int(input())

def main():
    X, Y = mi()
    cnt = 0
    while X <= Y:
        X *= 2
        cnt += 1
    print(cnt)
    


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:
X, Y = map(int,input().split())
count = 0

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

print(count)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

print(len(l))

Submission status: Accepted

Solution code:
# 一番左はX
# X,2X,4X,8X...とつづく
# a0=X,a1=2**1*X,a2=2**2*X...ai=2**i*X
# ai<=Yをみたす最大のiがしりたい
# 答えはi+1?
x,y=map(int,input().split())
for i in range(100):
  if pow(2,i)*x>y:
    break
print(i)

Submission status: Accepted

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

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

X, Y = MI()
ans = 0

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

Submission status: Accepted

Solution code:
import math

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

ans = 0

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
def solve():
    ret = 1
    cur_num = X
    while cur_num * 2 <= Y:
        cur_num *= 2
        ret += 1
    print(ret)

if __name__ == "__main__":
    X, Y = map(int, input().split())
    solve()

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

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

cnt = 0
while True:
    if y >= x:
        cnt += 1
        y = y // 2
    else:
        print(cnt)
        exit()

Submission status: Accepted

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

max = 0
array = []
A = X
while (True):
    if A <= Y:
        array.append(A)
        A = A * 2
    else:
        break
if len(array) > max:
    max = len(array)
print(max)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import sys
from collections import deque
import copy
import itertools
from itertools import permutations
def mi() : return map(int,sys.stdin.readline().split())
def ii() : return int(sys.stdin.readline().rstrip())
def i() : return sys.stdin.readline().rstrip()
a,b=mi()
ans=0
while a<=b:
  a*=2
  ans+=1
print(ans)

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

for i in range(100):
   tmp = tmp * 2
   if  tmp > Y:
       print(count)
       sys.exit()
   else:
       count += 1

Submission status: Accepted

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

z = y//x 

temp = 1
for i in range(10000):
    temp *= 2
    if z < temp:
        print(i+1)
        exit()

Submission status: Accepted

Solution code:
X,Y=map(int,input().split())
result = []
while Y >= X:
  result.append(X)
  X *= 2
print(len(result))

Submission status: Accepted

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

Submission status: Accepted

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

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:
X,Y = map(int,input().split())
ans = 0
for i in range(Y):
    if X <= Y:
        ans += 1
        X *= 2
    else:
        break
print(ans)

Submission status: Accepted

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

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:
from math import *

def solve(x,y,ans=1):
  if x*2 > y:
    return ans
  else:
    return solve(x*2,y,ans+1)
  
X,Y = map(int,input().split())
print(solve(X,Y))

Submission status: Accepted

Solution code:
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

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

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

print(cnt - 1)

Submission status: Accepted

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

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 -*-
# import math

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

calc = X
cnt = 0

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

print(cnt)


# エラーになる・・・
# calc = math.log( (Y / X) , 2) + 1
# print( int(calc) )

Submission status: Accepted

Solution code:
from math import floor
from decimal import Decimal

A, B = list(map(int, input().split()))

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

print(c)

Submission status: Accepted

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

cand = [x]

while(cand[-1]*2<=y) :
    cand.append(cand[-1]*2)

print(len(cand))

Submission status: Accepted

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

Submission status: Accepted

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

tmp = x
ans = []
while True:
  if(tmp > y):
    break
  else:
    ans.append(tmp)
    tmp = 2*tmp
    
print(len(ans))

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 7)

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

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

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

Submission status: Accepted

Solution code:
def calc_log2_int(n):
  """
  calc maximum integer m, such that 2 ^ m <= n 
  """
  left = -1
  right = 100    # 2^100 = 10^30
  while right - left > 1:
    mid = (right + left) // 2
    if pow(2, mid) > n:
      right = mid
    else:
      left = mid
  return left


x, y = map(int, input().split())
n = y // x
print(calc_log2_int(n) + 1)

Submission status: Accepted

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

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

print(l)

# なぜWA?
# print(int(math.log2(int(y/x)) + 1))

Submission status: Accepted

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

A = X
ans = 1

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

print(ans)

Submission status: Accepted

Solution code:
x, y = map(int, input().split())
c = 0
curr = x
for q in range(x, y + 1):
    curr *= 2
    c += 1
    if curr > y:
        break
print(c)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


def sol(x,y):
    count = 1
    start = x
    while True:
        start += start
        if start >y:
            break
        count +=1
    print(count)

sol(X,Y)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import deque
X, Y = map(int, input().split())
que = deque()
que.append(X)
ans = 1

while que:
  x = que.popleft()
  nx = x * 2
  if nx <= Y:
    que.append(nx)
    ans += 1

print(ans)

Submission status: Accepted

Solution code:
from collections import defaultdict

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    x, y = map(int, input().split())
    y_devided = y // x
    y_devided_binary = format(y_devided, "b")
    print(len(y_devided_binary))

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

#入力
# s = input()
# n = int(input())
# a,b = 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))
     
def main():
    a,b = map(int, input().split())
    ans = 0
    while a <=b:
        ans+=1
        a*=2
    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())

cnt = 0

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

print(cnt)

Submission status: Accepted

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

for i in range(10**19):
  ans = ans*2
  if ans <= y:
    count += 1
  else:
    break
    
print(count)

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

c=x
a=[]
while c <= y:
    a.append(c)
    c *=2
    
print(len(a))

Submission status: Accepted

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

def main():
    X, Y = map(int, input().split())
    ret = 1
    tmp = X
    while Y>=tmp:
        if tmp*2>Y:
            break
        else:
            tmp = tmp * 2
            ret += 1

    print(ret)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from collections import deque, Counter, defaultdict
from itertools import permutations
import heapq


def resolve():
    X, Y = map(int, sys.stdin.readline().strip().split())
    ans = 0
    while X <= Y:
        ans += 1
        X <<= 1

    print(ans)


if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
#from math import gcd
import bisect
from collections import defaultdict
from collections import deque
from functools import lru_cache


#############
# Constants #
#############

MOD = 10**9+7
INF = float('inf')

#############
# Functions #
#############

######INPUT######
def I(): return int(input().strip())
def S(): return input().strip()
def IL(): return list(map(int,input().split()))
def SL(): return list(map(str,input().split()))
def ILs(n): return list(int(input()) for _ in range(n))
def SLs(n): return list(input().strip() for _ in range(n))
def ILL(n): return [list(map(int, input().split())) for _ in range(n)]
def SLL(n): return [list(map(str, input().split())) for _ in range(n)]

######OUTPUT######
def P(arg): print(arg); return
def Y(): print("Yes"); return
def N(): print("No"); return
def E(): exit()
def PE(arg): print(arg); exit()
def YE(): print("Yes"); exit()
def NE(): print("No"); exit()

#####Shorten#####
def DD(arg): return defaultdict(arg)


#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
  arr = []
  temp = n
  for i in range(2, int(-(-n**0.5//1))+1):
    if temp%i==0:
      cnt=0
      while temp%i==0: 
        cnt+=1 
        temp //= i
      arr.append([i, cnt])
  if temp!=1:
    arr.append([temp, 1])
  if arr==[]:
    arr.append([n, 1])
  return arr

#####MakeDivisors######
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

#####LCM#####
def lcm(a, b):
    return a * b // gcd (a, b)

#####BitCount#####
def count_bit(n):
  count = 0
  while n:
    n &= n -1
    count += 1
  return count

#####ChangeBase#####
def base_10_to_n(X, n):
  if X//n:
    return base_10_to_n(X//n, n)+[X%n]
  return [X%n]

def base_n_to_10(X, n):
  return sum(int(str(X)[-i])*n**i for i in range(len(str(X))))

#####IntLog#####
def int_log(n, a):
  count = 0
  while n>=a:
    n //= a
    count += 1
  return count

#############
# Main Code #
#############

X,Y = IL()
P(int_log(Y//X,2)+1)

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
def func(x, y, count):
  new_x = x * 2
  if new_x > y:
    return count
  else:
    new_count = count + 1
    return func(new_x, y, new_count)
    
x, y = [int(i) for i in input().split()]

print(func(x, y, 1))

Submission status: Accepted

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

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

print(i)

Submission status: Accepted

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

Submission status: Accepted

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

print(t)

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

count = 0

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x, y = 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())
div = y // x
i = 0
while div >= pow(2, i):
    i += 1
print(i)

Submission status: Accepted

Solution code:
a,b = list(map(int, input().split()))
cnt = 0
while b >= a:
  a = a * 2
  cnt += 1

print(cnt)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

#2^60 = 1,152,921,504,606,846,976 > 10^18である。
for i in range(61):
    if y < x * 2**i:
        print(i)
        exit()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A,B = list(map(int,input().split()))
ans = 1
for i in range(10**18):
    if A * 2 <= B:
        A *= 2
        ans +=1
    else:
        print(ans)
        exit()

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

Submission status: Accepted

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

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

Submission status: Accepted

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


input = sys.stdin.readline
def IS(cb): return cb(input().strip())
def IL(cb): return [cb(s) for s in input().strip().split()]
def IR(cb, rows): return [IS(cb) for _ in range(rows)]
def ILL(cb, rows): return [IL(cb) for _ in range(rows)]


def solve():
    X, Y = IL(int)
    ans = 1
    while Y // 2 >= X:
        ans += 1
        Y //= 2
    print(ans)

solve()

Submission status: Accepted

Solution code:
x,y=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())

n = x
ans = 0

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X,Y=[int(x) for x in input().rstrip().split()]
ans=[]
cnt=1
now=X
for i in range(1,Y+1):
    now=now*2
    if now<=Y:
        cnt+=1

    else:
        break
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
x,y=map(int,input().split())
tmp=x
for i in range(y+1):
    tmp=x*2**i
    if tmp >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())

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

Submission status: Accepted

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

arr = []
arr.append(X)
while arr[-1] * 2 <= Y:
    arr.append(arr[-1] * 2)
print(len(arr))

Submission status: Accepted

Solution code:
import fractions
#import math

def lcm(x, y):
    #return (x * y) // math.gcd(x, y)
    return (x * y) // fractions.gcd(x, y)

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

if y < 2*x: #長さが1になる場合
    print(1)
    exit()

li = [x, 2*x]
i = 0

while True:
    x = lcm(li[i], li[i+1])*2
    if x <= y:
        li.append(x)
        i += 1
    else:
        print(len(li))
        exit()

Submission status: Accepted

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

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 = list(map(int, input().split()))
# a, b, c = list(map(int, input().split()))
count = 1

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

print(count)

Submission status: Accepted

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

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:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
from decimal import Decimal, ROUND_DOWN
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

X, Y = MAP()

print(1+((Decimal(str(Y))/Decimal(str(X))).log10()/Decimal("2").log10()).quantize(Decimal('0'), rounding=ROUND_DOWN))