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

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

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

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

print(count)

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

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

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

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

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

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

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

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

print(cnt)

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

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

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

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

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


if __name__ == '__main__':
    main()

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

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

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

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

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

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

cnt = 0

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

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

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

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

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

main()

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

Solution (Python):



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


calc = X
cnt = 0

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

print(cnt)

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

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

cand = [x]

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

print(len(cand))

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

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

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

Solution (Python):
x,y=map(int,input().split())
a=[x]
while a[-1]<=y:
    a.append(a[-1]*2)
print(len(a)-1)

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

Solution (Python):
def calc_log2_int(n):
  """
  calc maximum integer m, such that 2 ^ m <= n 
  """
  left = -1
  right = 100    
  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)

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

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

print(l)

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

A = X
ans = 1

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

print(ans)

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

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

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