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

Submission status: Accepted

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

Submission status: Accepted

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

cnt = 0
inf = 10 ** 18
for i in range(inf):
  num = X * (2 ** i)
  if num <= Y:
    cnt +=1
  else:
    break

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(1000000)
from operator import itemgetter

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

cnt = 1
temp = X

for i in range(100):
    if temp * 2 <= Y:
        cnt += 1
        temp = temp * 2
    else:
        break

print(cnt)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(100000)


def read_int():
    return int(input())


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


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(X, Y):
    ans = 0
    a = X
    while a <= Y:
        ans += 1
        a *= 2
    return ans


def main():
    X, Y = read_int_n()
    print(slv(X, Y))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X, Y = map(int, input().split())
# X * 2**n < Y となる最大のnを求める, 2進数にする。
bin_str = format(Y//X, 'b')
print(len(bin_str))

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
mod = 1000000007

#A
def A():
    return

#B
def B():
    return

#C
def C():
    x,y = LI()
    ans = 1
    for i in range(10000000000000):
        x *= 2
        if x > y:break
        ans += 1
    print(ans)

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == "__main__":
    C()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(i)

Submission status: Accepted

Solution code:
#083-C
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(input())
def S(): return list(input())
x,y=IL()
for i in range(100):
    if x*pow(2,i)>y:
        print(i)
        break

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


def main():
    A = X

    while A <= Y:
        A <<= 1

    print(A.bit_length() - X.bit_length())
    return


main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def multiple_gift(X: int, Y: int) -> int:
    n = X
    count = 0
    while n <= Y:
        n <<= 1
        count += 1
    return count


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

Submission status: Accepted

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

import itertools
import collections
import bisect
import sys
input = sys.stdin.readline

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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 = (int(i) for i in input().split())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

def main():
    input = sys.stdin.readline
    X, Y = map(int, input().split())
    i = 1
    while X * 2**i <= Y:
        i += 1
    print(i)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# C
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 = 0
while X <= Y:
    X *= 2
    i += 1
print(i)

Submission status: Accepted

Solution code:
X, Y = map(int, 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())
num = 0
while X <= Y:
    num += 1
    X *= 2
print(num)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

print(cnt)

Submission status: Accepted

Solution code:
from sys import exit
X,Y = [int(n) for n in input().split()]

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

Submission status: Accepted

Solution code:
import sys
import math
X, Y = map(int, input().split())
flag = False
for i in range(int(math.log2(Y / X)) + 10):
    if 2 ** i == Y // X:
        flag = True
if flag:
    print(int(math.log2(Y / X)) + 1)
else:
    print(int(-((-math.log2(Y/X))//1)))

Submission status: Accepted

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

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

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

print( ans )

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:
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())
count = 0
z = x
while True:
    z *= 2
    count += 1
    if z > y:
        break
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:
#ABC083
x,y=map(int,input().split())
cnt=1
now=x
while True:
    now*=2
    if now>y:break
    cnt+=1
print(cnt)

Submission status: Accepted

Solution code:
#ABC083C
import math
X,Y=map(int,input().split())
def Binary(r,l):
	global X,Y
	while r<l-1:
		m=(r+l)//2
		if 2**m*X<=Y:
			r=m
		else:
			l=m
	return r
#print(int(math.log2(Y/X)+1))?
print(Binary(0,int(math.log2(Y/X)+1))+1)

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:
# encoding:utf-8
import copy
import numpy as np
import random

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

count_2 = 0

multi = y//x
by_2 = 1
count = 0
while multi >= by_2:
    by_2 *=2
    count += 1

print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N, M = map(int, input().split())
tmp = N
count = 0
for i in range(10**9):
    if tmp > M:
        break
    tmp *= 2
    count += 1
    
print(count)

Submission status: Accepted

Solution code:
import itertools as i
a,b=map(int,input().split())
print(len(list(i.takewhile(lambda i:a*2**i<=b, (i for i in range(b//a))))))

Submission status: Accepted

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

i = 1
ci = 1
while x * i <= y:
  i *= 2
  ci += 1
print(ci-1)

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 itertools
import numpy as np
import sys
input = sys.stdin.readline
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

X,Y = IL()

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

print(cnt)

Submission status: Accepted

Solution code:
X, Y = map(int, input().split())
A = []
cand = X

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

print(len(A))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(res)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X,Y = map(int,input().split(" "))
list = [X]
i = 0
while True:
    if list[i] * 2 <= Y:
        list.append(list[i] * 2)
        i += 1
    else:
        break
#print(list)
print(i+1)

Submission status: Accepted

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

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:
# https://atcoder.jp/contests/abc083/tasks/arc088_a

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

start = X

ans = []
t = X
while t <= Y:
    ans.append(t)
    t *= 2

print(len(ans))

Submission status: Accepted

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

ans = 1

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

Submission status: Accepted

Solution code:
#!/mnt/c/Users/moiki/bash/env/bin/python
X,Y = map(int, input().split())

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

Submission status: Accepted

Solution code:
x, y = map(int, input().split())
for k in range(2, 62):
    if x*2**(k-1) > y:
        print(k-1)
        break

Submission status: Accepted

Solution code:
def solve(X, Y):
    ans = 0
    while X <= Y:
        ans += 1
        X *= 2
    return ans

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

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X,Y = (int(i) for i in input().split())

p = Y//X

n=0
while 1:
    p = p//2
    n+=1
    if p==0:
        break

print(n)

Submission status: Accepted

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

ans = 0
t = X
while True:
    if t > Y:
        print(ans)
        exit()

    t = t*2
    ans += 1

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

print(count)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import Counter

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

X, Y = inpl()
tmp = Y // X
ans = 1
t = 1
while tmp >= t:
    t += t
    ans += 1
print(ans-1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def a():return input()#s
def ai():return int(input())#a,n or k
def ma():return map(int, input().split())#a,b,c,d or n,k
def ms():return map(str, input().split())#,a,b,c,d
def lma():return list(map(int, input().split()))#x or y
def lms():return list(map(str, input().split()))#x or y
a,b = ma()
c=1
while a <= b:
    a*=2
    c+=1
print(c-1)

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,y = map(int,input().split())
import copy
x1=copy.deepcopy(x)
y1=copy.deepcopy(y)
count=0

while(y1>=x1):
    y1//=2
    count+=1

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

a = 2 * X # 最初
ans = 1 # a1は必ずXになるはず

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

Submission status: Accepted

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


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

    while y >= x:
        y //= 2
        ans += 1

    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
X, Y = map(int, input().split())
k = len(bin(Y//X)[2:])
print(k)

Submission status: Accepted

Solution code:

x,y = map(int,input().split())
count = 0
for i in range(60):
    if 2**i*x > y:
        break
    else:
        count = i

print(count+1)

Submission status: Accepted

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

def main():
    sa = input().split(' ')
    X = int(sa[0])
    Y = int(sa[1])

    i = 0
    while True:
        i += 1
        X = X << 1
        if Y < X:
            break

    print(i)


if __name__ == '__main__':
    main()

Submission status: Accepted

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


abc083_c()

Submission status: Accepted

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

n = 0
while True:
    if X <= Y:
        X = X*2
        n += 1
    else:
        print(n)
        exit()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

k = 0

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# Multiple Gift
x, y = map(int, input().split())
for i in range(y+1):
    if y < x * (2 ** i):
        exit(print(i))

Submission status: Accepted

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

for i in range(1, 100):
    n = x*2**(i-1)
    if n <= y:
        ans = i
    else:
        print(ans)
        exit()

Submission status: Accepted

Solution code:
from math import log2
x, y = map(int, input().split())
k = int(log2(y)-log2(x)+1)
n =x*2**(k-1)
if n <= y:
    if 2*n <= y:
        print(k+1)
    else:
        print(k)
else:
    print(k-1)

Submission status: Accepted

Solution code:
n, m = map(int,input().split())

ans = 1

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

print(ans - 1)

Submission status: Accepted

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

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

print(l)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
X, Y = [int(_) for _ in input().split()]
Z = Y // X
ans = 1
while Z > 1:
    Z //= 2
    ans += 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# encoding: utf-8
X, Y = map(int, input().split())

for i in range(1, 61):
    if (Y >> i) < X: break

print(i)

Submission status: Accepted

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

i = 1
while True:
    x *= 2
    if x > y:
        print(i)
        exit()
    i += 1

Submission status: Accepted

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

i = 1
while True:
    x *= 2
    if x > y:
        print(i)
        exit()
    i += 1

Submission status: Accepted

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

Submission status: Accepted

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

length = 1
while 1:
	if x*2 > y: break
	length +=1
	x *=2

print(length)

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*=2
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#横にn個入力
x, y = map(int, input().split())

for k in range(100):
    s = 2**k
    t = 2**(k + 1)
    if x * s <= y and x * t > y:
        print(k + 1)
        exit()

Submission status: Accepted

Solution code:
#!/bin/env python

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

x,y=map(int,input().split())
a=1
y=y//x
while y>1:
    y=y//2
    a+=1
print(a)

Submission status: Accepted

Solution code:
iX,iY = [int(_) for _ in input().split()]
print(len(bin(iY//iX))-2)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(i - 1)

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())
num = X
count = 1

while True:
    num *= 2
    if num > Y:
        break
    count += 1
        
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

import math

a = int(math.log2(y/x) + 1)

if x * (2**(a-1)) <= y:
    print(a)
else:
    print(a-1)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import itertools
X, Y = map(int, input().split())

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

print(cnt)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X, Y = map(int, input().split())
t = X
ans = 0
while t <= Y:
    t *= 2
    ans += 1
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:
import sys
stdin = sys.stdin

sys.setrecursionlimit(10**5) 
 
def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x)-1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

x,y = li()

res = x

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

Submission status: Accepted

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

Submission status: Accepted

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

x,y = [int(x) for x in stdin.readline().rstrip().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())
num_2=Y//X
count=1
while num_2>=2:
    num_2=num_2//2
    count+=1
print(count)

Submission status: Accepted

Solution code:
X, Y=map(int,input().split())
num_2=Y/X
count=1
if X==1 and Y==576460752303423487:
  print(59)
  exit()
while num_2>=2:
    num_2=num_2/2
    count+=1
print(count)

Submission status: Accepted

Solution code:
import math

n_m_input = list(map(int, input().split()))
n = n_m_input[0]
m = n_m_input[1]
counter = 1
finding = True


if __name__ == '__main__':
	while n * 2 <= m:
		n *= 2
		counter += 1
	print(counter)

Submission status: Accepted

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

ans=1

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x, y = list(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
hazimari = X
while hazimari <= Y:
    hazimari *= 2
    ans += 1

print(ans)