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: Wrong Answer

Solution code:
from math import log2

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

cnt = int(log2(y/x) + 1)

if cnt == 0:
  print(1)
  exit()

print(cnt)

Submission status: Wrong Answer

Solution code:
from math import log2

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

cnt = int(log2(y/x)) + 1
print(cnt)

Submission status: Wrong Answer

Solution code:
from math import log2

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

cnt = int(log2(y/x) + 1)
print(cnt)

Submission status: Wrong Answer

Solution code:
import math
X,Y = map(int,input().split())
if X==Y:
    n=-1
else:
    if abs(round(math.log2(Y/X))-math.log2(Y/X))<10**(-8):
        n = round(math.log2(Y/X))
    else:
        n = int(math.log2(Y/X))
print(n+1)

Submission status: Wrong Answer

Solution code:
import math
X,Y = map(int,input().split())
if abs(round(math.log2(Y/X))-math.log2(Y/X))<10**(-8):
    n = round(math.log2(Y/X))
else:
    n = int(math.log2(Y/X))
print(n+1)

Submission status: Wrong Answer

Solution code:
import math
X,Y = map(int,input().split())
n = int(math.log2(Y/X))
print(n+1)

Submission status: Wrong Answer

Solution code:
import math
x,y=[int(s) for s in input().split()]
print(int(math.log(y//x,2))+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
X, Y = map(int, input().split())
k = Y // X
h = Y % X
if h == 0:
    print(math.ceil(math.log2(k)) + 1)
else:
    print(math.ceil(math.log2(k)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
X, Y = map(int, input().split())
print (int(math.log2(Y/X)) + 1)

Submission status: Wrong Answer

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

z = y / x + 1
n = 0
while z > 0:
  z = z // 2
  n += 1

print(n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
a,b = [list(map(int, s.split())) for s in open(0)][0]
print(math.floor(math.log2(b) - math.log2(a)+1))

Submission status: Wrong Answer

Solution code:
import math
a,b = [list(map(int, s.split())) for s in open(0)][0]
print(math.floor(math.log2(b) - math.log2(a))+1)

Submission status: Wrong Answer

Solution code:
import math
a,b = [list(map(int, s.split())) for s in open(0)][0]
math.floor(math.log2(b) - math.log2(a))+1

Submission status: Wrong Answer

Solution code:
# ABC083c
import sys
import math
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

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

#y - x * 2 ** n > 0
#x * 2 ** n < y
# 2**n<y/x

print(math.floor(math.log2(y/x))+1)

Submission status: Wrong Answer

Solution code:
# ABC083 C - Multiple Gift
x,y = map(int,input().split())

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

print(i)

Submission status: Wrong Answer

Solution code:
# ABC083 C - Multiple Gift
x,y = map(int,input().split())

if x == y:
    print(0)
    exit()

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

print(i)

Submission status: Wrong Answer

Solution code:
# ABC083 C - Multiple Gift
x,y = map(int,input().split())

i = 0
t = 0
if x==y:
    print(0)
    exit()
else:
    while t < y:
        t += x*2**i
        i += 1
print(i)

Submission status: Wrong Answer

Solution code:
# ABC083 C - Multiple Gift
x,y = map(int,input().split())

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

print(i)

Submission status: Wrong Answer

Solution code:
import math
import numpy as np
x, y = list(map(int, input().split()))
print(int(np.log2(y / x) + 1))

Submission status: Wrong Answer

Solution code:
import math
import numpy as np
x, y = list(map(int, input().split()))
print(int(np.log2(y / x)) + 1)

Submission status: Wrong Answer

Solution code:
import math
x, y = list(map(int, input().split()))
print(math.floor(math.log2(y / x)) + 1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

cnt=0
while Y>=X:
  Y/=2
  cnt+=1
print(cnt)

Submission status: Wrong Answer

Solution code:
import math

X,Y=map(int,input().split())
print(int(math.log2(Y/X))+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
X, Y = map(int, input().split())
k = Y//X
ans = math.floor(math.log2(k))+1
print(ans)

Submission status: Wrong Answer

Solution code:
import math

if __name__ == '__main__':
    X, Y = map(int, input().split())
    print(int(math.log2(Y/X)+1))

Submission status: Wrong Answer

Solution code:
import math

if __name__ == '__main__':
    X, Y = map(int, input().split())
    print(int(math.log2(Y//X))+1)

Submission status: Wrong Answer

Solution code:
import math

if __name__ == '__main__':
    X, Y = map(int, input().split())
    # print(int(math.log2(Y/X))+1)
    print(0)

Submission status: Wrong Answer

Solution code:
import math

if __name__ == '__main__':
    X, Y = map(int, input().split())
    print(int(math.log2(Y/X))+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
X,Y = map(int,input().split())
import math
ans = int(math.log(Y/X)/math.log(2))+1
print(ans)

Submission status: Wrong Answer

Solution code:
import math
# X*2^n <= Yとなる最大のnを求める,
# logを取ってlogX + nlog2 <= log Y
# n <= (logY/X)/log2 = ln(Y/X)となる最大のnを求めればよい

X,Y = map(int, input().split())
ret = int(math.log(Y/X)/math.log(2))+1
print(ret)

Submission status: Wrong Answer

Solution code:
import math
x, y = map(int, input().split())
print(1 + math.floor(math.log2(y)-math.log2(x)))

Submission status: Wrong Answer

Solution code:
import math
x, y = map(int, input().split())
print(1 + int(math.log2(y)-math.log2(x)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
x, y = map(int, input().split())
print(1 + math.floor(math.log(y/x, 2)))

Submission status: Wrong Answer

Solution code:
import math

X,Y = map(int, input().split())
ret = int(math.log(Y/X)/math.log(2)+1)
print(ret)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n,m=map(int,input().split())
p=m/n
cnt=1
while True:
    if p>=2:
        p/=2
        cnt+=1
    else:
        break
print(cnt)

Submission status: Wrong Answer

Solution code:
import math

X, Y = map(int,input().split())
print(int(math.log(Y/X, 2)+1))

Submission status: Wrong Answer

Solution code:
import math

#入力
x, y = map(int, input().split())
for i in range(60):
    if 2**i - 1 < math.floor(y/x) <= 2**(i+1) - 1:
        ans = i
print(ans+1)

Submission status: Wrong Answer

Solution code:
from math import*;x,y=map(int,input().split());print(1+floor(log2(y/x)))

Submission status: Wrong Answer

Solution code:
from math import*;x,y=map(int,input().split());print(1+floor(log2(y//x)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math


def resolve():
    x, y = map(int, input().split())
    print(math.floor(math.log2(y) - math.log2(x) + 1))


if __name__ == "__main__":
    resolve()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
a,b = list(map(int,input().split()))	
print(math.floor(math.log2(b)-math.log2(a))+1)

Submission status: Wrong Answer

Solution code:
import math
a,b = list(map(int,input().split()))	
print(math.floor(math.log2(b/a))+1)

Submission status: Wrong Answer

Solution code:
import math
a,b = list(map(int,input().split()))	
print(math.ceil(math.log2(b/a)))

Submission status: Wrong Answer

Solution code:
import math

X, Y = map(int,input().split())
answer = int(math.log2(Y/X)) + 1
print(answer)

Submission status: Wrong Answer

Solution code:
from math import log2
x, y = map(int, input().split())
log2_n = log2(y) - log2(x)
print(int(log2_n // 1 + 1))

Submission status: Wrong Answer

Solution code:
from math import log

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

ans = int(log(Y / X, 2)) + 1

print(ans)

Submission status: Wrong Answer

Solution code:
X, Y = [int(_) for _ in input().split()]
tmp = X
ans = 0
while tmp < Y:
    ans += 1
    tmp *= 2
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from fractions import Fraction
import math

X, Y = [int(_) for _ in input().split()]
tmp = math.floor(math.log2(Fraction(Y, X)))
# if (2 ** tmp) * X > Y:
#     tmp -= 1
print(tmp + 1)

Submission status: Wrong Answer

Solution code:
import math

X, Y = [int(_) for _ in input().split()]
tmp = math.floor(math.log2(Y / X))
if 2 ** tmp + X > Y:
    tmp -= 1
print(tmp + 1)

Submission status: Wrong Answer

Solution code:
import math

X, Y = [int(_) for _ in input().split()]
print(math.floor(math.log2(Y / X)) + 1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

print(int(math.log2(y / x)) + 1)

Submission status: Wrong Answer

Solution code:
# Multiple Gift
import math
x, y = map(int, input().split())
x_d = 1
y_d = math.ceil(y / x)

i = 0
while True:
    if 2 ** i > y_d:
        break
    i += 1
print(i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from math import log,floor
x,y = map(int,input().split())
print(max(floor(log(y/x,2))+1,0))

Submission status: Wrong Answer

Solution code:
from math import log,floor
x,y = map(int,input().split())
print(floor(log(y//x,2))+1)

Submission status: Wrong Answer

Solution code:
from math import log, floor


i, j = map(int, input().split())
print(floor(log(j//i, 2)) + 1)

Submission status: Wrong Answer

Solution code:
x, y = map(int,input().split())
import math
print(math.floor(math.log(y/x,2))+1)

Submission status: Wrong Answer

Solution code:
import math
A,B=map(int,input().split())

print(1+int(math.log((B//A),2)))

Submission status: Wrong Answer

Solution code:
import math
A,B=map(int,input().split())

print(1+int(math.log((B/A),2)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(c)

Submission status: Wrong Answer

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

print(c)

Submission status: Wrong Answer

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

while Y >= 1:
    Y /= 2
    ans += 1

print(ans-1)

Submission status: Wrong Answer

Solution code:
import math
x,y=map(int,input().split())
k=math.floor(math.log2(y//x))
print(k+1)

Submission status: Wrong Answer

Solution code:
def serch_biggist_multiple (seedNum,limit):
    biggist_multiple = 0
    for i in range(limit):
        biggist_multiple = limit-i
        if biggist_multiple % seedNum == 0:
            return biggist_multiple

def serch_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)
    divisors.sort()
    return divisors

x,y = map(int,input().split())
ans = 0
divisors = serch_divisors(serch_biggist_multiple(x,y))
for i in divisors:
    if i%x == 0:
        ans += 1

print(ans)

Submission status: Wrong Answer

Solution code:
import math

def main():
	x,y = map(int,input().split())
	i = y/x
	i = int(math.log2(i))
	if(y%x==0):
		i+=1
	print(i)



def listtodict(a):
	b = {}
	for i in a:
		try:
			b[i] += 1
		except:
			b[i] = 1
	return b

def base_10_to_n(X, n):
	X_dumy = X
	out = ''
	while X_dumy>0:
		out = str(X_dumy%n)+out
		X_dumy = int(X_dumy/n)
	if(out == ''): return '0'
	return out

main()

Submission status: Wrong Answer

Solution code:
import math

def main():
	x,y = map(int,input().split())
	if(x==y): print('1')
	else: print(int(math.log2(y/x)) + 1)


def listtodict(a):
	b = {}
	for i in a:
		try:
			b[i] += 1
		except:
			b[i] = 1
	return b

def base_10_to_n(X, n):
	X_dumy = X
	out = ''
	while X_dumy>0:
		out = str(X_dumy%n)+out
		X_dumy = int(X_dumy/n)
	if(out == ''): return '0'
	return out

main()

Submission status: Wrong Answer

Solution code:
import math

def main():
	x,y = map(int,input().split())
	print(int(math.log2(y/x)) + 1)


def listtodict(a):
	b = {}
	for i in a:
		try:
			b[i] += 1
		except:
			b[i] = 1
	return b

def base_10_to_n(X, n):
	X_dumy = X
	out = ''
	while X_dumy>0:
		out = str(X_dumy%n)+out
		X_dumy = int(X_dumy/n)
	if(out == ''): return '0'
	return out

main()

Submission status: Wrong Answer

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

n=int(math.log2(Y/X)+1)
print(n)

Submission status: Wrong Answer

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

n=int(math.log2(Y)-math.log2(X)+1)
print(n)

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(4100000)

import logging

# logging.basicConfig(level=logging.DEBUG)

logger = logging.getLogger(__name__)

import math


def resolve():
    X, Y = [int(x) for x in sys.stdin.readline().split()]

    logger.debug('{} {}'.format(X, Y))

    print(math.floor((math.log2(Y) - math.log2(X))) + 1)


if __name__ == "__main__":
    resolve()

# AtCoder Unit Test で自動生成できる, 最後のunittest.main は消す
# python -m unittest template/template.py で実行できる
# pypy3 -m unittest template/template.py で実行できる

import sys
from io import StringIO
import unittest


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """3 20"""
        output = """3"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """25 100"""
        output = """3"""
        self.assertIO(input, output)

    def test_入力例_3(self):
        input = """314159265 358979323846264338"""
        output = """31"""
        self.assertIO(input, output)

    def test_入力例_4(self):
        input = """1 2"""
        output = """2"""
        self.assertIO(input, output)

    def test_入力例_5(self):
        input = """3 3"""
        output = """1"""
        self.assertIO(input, output)

    def test_入力例_6(self):
        input = """999999999999999999 1000000000000000000"""
        output = """1"""
        self.assertIO(input, output)

Submission status: Wrong Answer

Solution code:
from math import log
a, b  = map(int, input().split())
print(1+int(log(b/a, 2)))

Submission status: Wrong Answer

Solution code:
from math import floor, log2

X, Y = map(int, input().split())
Y /= X
ans = floor(log2(Y)) + 1
print(ans)

Submission status: Wrong Answer

Solution code:
from math import floor, log2

X, Y = map(int, input().split())
Y //= X
ans = floor(log2(Y)) + 1
print(ans)

Submission status: Wrong Answer

Solution code:
import math
X,Y=map(int,input().split())
if Y//X<2:print(1)
else:print(int(math.log2(Y//X))+1)

Submission status: Wrong Answer

Solution code:
import math
X,Y=map(int,input().split())
if Y//X<2:print(0)
else:print(int(math.log2(Y//X))+1)

Submission status: Wrong Answer

Solution code:
import math
X,Y=map(int,input().split())
print(int(math.log2(Y//X))+1)

Submission status: Wrong Answer

Solution code:
from math import log, floor
X, Y = map(int, raw_input().split())

Z = float(Y)/X
print int(floor(log(Z, 2))) + 1

Submission status: Wrong Answer

Solution code:
from math import log, floor
X, Y = map(int, raw_input().split())

Z = floor(float(Y)/X)
print int(floor(log(Z, 2))) + 1

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
X,Y=map(int,input().split())
print(math.floor(math.log2(Y/X))+1)

Submission status: Wrong Answer

Solution code:
import math
X,Y=map(int,input().split())
print(math.floor(math.log2(Y//X))+1)

Submission status: Wrong Answer

Solution code:
import math
x,y=map(int,input().split())
ans=math.floor(math.log(y/x,2))+1
if x==y:
    print(0)
else:
    print(ans)

Submission status: Wrong Answer

Solution code:
import math
x,y=map(int,input().split())
ans=math.floor(math.log(y/x,2))+1
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log2
from heapq import heappop, heappush, heapify, heappushpop
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

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()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

X, Y = MAP()
print(int(log2(Y/X)//1)+1)

Submission status: Wrong Answer

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log2
from heapq import heappop, heappush, heapify, heappushpop
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

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()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

X, Y = MAP()
print(int(log2(Y/X))+1)

Submission status: Wrong Answer

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log2
from heapq import heappop, heappush, heapify, heappushpop
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

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()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

X, Y = MAP()
print(int((log2(Y/X+1)+1)//1))

Submission status: Wrong Answer

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log2
from heapq import heappop, heappush, heapify, heappushpop
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

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()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

X, Y = MAP()
print(int(log2(Y/X+1)+1))

Submission status: Wrong Answer

Solution code:
import math

X, Y = map(int,input().split())
print(math.floor(math.log(Y/X, 2))+1)

Submission status: Wrong Answer

Solution code:
import math

X, Y = map(int,input().split())
print(int(math.log(Y/X, 2))+1)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Mon Jun 24 21:42:42 2019

@author: Owner
"""


X, Y = list(map(int, input().split()))
cnt = 0
for n in range(Y):
    if X*2**n ==Y:
        cnt = n +1
        break
    elif X*2**n >Y:
        cnt = n
    else:
        pass

print(cnt)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Mon Jun 24 21:42:42 2019

@author: Owner
"""


X, Y = list(map(int, input().split()))
cnt = 0
for n in range(Y):
    if X*2**n >=Y:
        cnt = n
        break
    else:
        pass

print(cnt)

Submission status: Wrong Answer

Solution code:
import math

x,y=map(int,input().split())
ans=math.log2(y/x)
if not ans==int(ans):
    ans=int(ans)+1
else:
    ans=int(ans)
print(ans)

Submission status: Wrong Answer

Solution code:
import math

x,y=map(int,input().split())
if x==1:
    print(math.floor(math.log2(y/x)))
else:
    print(math.floor(math.log2(y/x)+1))

Submission status: Wrong Answer

Solution code:
import math

x,y=map(int,input().split())
print(math.floor(math.log2((y/x)+1)))

Submission status: Wrong Answer

Solution code:
import math

x,y=map(int,input().split())
print(math.floor(math.log2(y//x)+1))

Submission status: Wrong Answer

Solution code:
import math

x,y=map(int,input().split())
print(math.floor(math.log2(y/x)+1))

Submission status: Wrong Answer

Solution code:
import math

x,y=map(int,input().split())
print(int(math.log2(y/x))+1)

Submission status: Wrong Answer

Solution code:
import math
x, y = [int(i) for i in input().split()]
print(int(math.log2(y)-math.log2(x))+1)

Submission status: Wrong Answer

Solution code:
import math
x, y = [int(i) for i in input().split()]
print(int(math.log2(y/x))+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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


def log2(x, y):
    temp = 0
    while y >= 2 * x:
        temp += 1
        y /= 2
    return temp


print(int(log2(x, y))+1)

Submission status: Wrong Answer

Solution code:
from math import log2

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

print(int(log2(y / x))+1)

Submission status: Wrong Answer

Solution code:
from math import log2

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

print(int(log2(y) - log2(x))+1)

Submission status: Wrong Answer

Solution code:
from math import log
x, y = map(int,input().split())
print(int(log(y/x, 2))+1)

Submission status: Wrong Answer

Solution code:
from math import ceil, log
x, y = map(int,input().split())
print(ceil(log(y/x, 2)))

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
import sys
import math
INF = float("inf")


def solve(X: int, Y: int):
    # print(math.log2(Y)-math.log2(X))
    print(1+int(math.log2(Y)-math.log2(X)))
    return


def main():

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    X = int(next(tokens))  # type: int
    Y = int(next(tokens))  # type: int
    solve(X, Y)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys
import math

X, Y = map(int, sys.stdin.readline().split())

ans = math.floor(math.log2(math.floor(Y/X))) + 1
print(ans)

Submission status: Wrong Answer

Solution code:
import sys
import math

X, Y = map(int, sys.stdin.readline().split())

ans = math.floor(math.log2(Y/X)) + 1
print(ans)

Submission status: Wrong Answer

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

c = 0
n = x

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

print(c)

Submission status: Wrong Answer

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

print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np


# 入力n以下の最大の2のべきを出力
# 2**(out) <= (in) < 2**(out+1)
# power2_smaller(8) = 3
# power2_smaller(9) = 3
def power2_smaller(num):
    return len(str(bin(num))[2:])-1

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

ans = power2_smaller(int(Y/X)) + 1
print(ans)

Submission status: Wrong Answer

Solution code:
import math
X, Y = map(int, input().split())
print(math.floor(math.log2(Y // X)) + 1)

Submission status: Wrong Answer

Solution code:
import math

X, Y = map(int, input().split())
print(math.floor(math.log2(Y / X)) + 1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
x,y=map(int,input().split())
print(int(math.log2(y)-math.log2(x))+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

X, Y = map(int,input().split())
print(int(math.log(Y//X, 2))+1)

Submission status: Wrong Answer

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

# 方針 greedy
# Xから初めて、2倍2倍していってYに達する手前で止めればよい
# この倍々操作の回数が数列の長さだが、これは簡単に数値計算で求まる
# つまり log_2(X/Y) を整数に丸め込んだやつ
# コーナーケースに注意

from math import log2
X, Y = list(map(int, input().split()))

print(int(log2(Y // X)+1))

Submission status: Wrong Answer

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

# 方針 greedy
# Xから初めて、2倍2倍していってYに達する手前で止めればよい
# この倍々操作の回数が数列の長さだが、これは簡単に数値計算で求まる
# つまり log_2(X/Y) を整数に丸め込んだやつ
# コーナーケースに注意

from math import log2
X, Y = list(map(int, input().split()))


print(int(log2(Y/X))+1)

Submission status: Wrong Answer

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

# 方針 greedy
# Xから初めて、2倍2倍していってYに達する手前で止めればよい
# この倍々操作の回数が数列の長さだが、これは簡単に数値計算で求まる
# つまり log_2(X/Y) を整数に丸め込んだやつ

from math import log2
X, Y = list(map(int, input().split()))

print(int(log2(Y)-log2(X)))

Submission status: Wrong Answer

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

# 方針 greedy
# Xから初めて、2倍2倍していってYに達する手前で止めればよい
# この倍々操作の回数が数列の長さだが、これは簡単に数値計算で求まる
# つまり log_2(X/Y) を整数に丸め込んだやつ

from math import log2
X, Y = list(map(int, input().split()))

print(int(log2(Y)-log2(X)+1))

Submission status: Wrong Answer

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

# 方針 greedy
# Xから初めて、2倍2倍していってYに達する手前で止めればよい
# この倍々操作の回数が数列の長さだが、これは簡単に数値計算で求まる
# つまり log_2(X/Y) を整数に丸め込んだやつ

from math import log2
X, Y = list(map(int, input().split()))

print(int(log2(Y/X)+1))

Submission status: Wrong Answer

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

num = X
counter = 0

if num == 1:
    counter += 1
    num += 1

for i in range (1, Y):
    if num >= Y:
        break

    else:
        counter += 1
        num *= 2

print(counter)

Submission status: Wrong Answer

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

num = X
counter = 0

if num == 1:
    counter += 1
    num += 1

for i in range (1, Y):
    if num >= Y:
        print(num,counter)
        break

    else:
        print(num)
        counter += 1
        num *= 2

print(counter)

Submission status: Wrong Answer

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

max_int = Y // X

i = 1
while max_int > 2**i:
    i += 1
print(i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
X,Y=map(int, input().split())
print(1 + int(math.log2(Y//X)))

Submission status: Wrong Answer

Solution code:
import math
X, Y = map(int, input().split(" "))
print(int(math.log2(Y/X))+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

x, y = map(int, input().split())
ans = 0
for k in range(1, 1000):
    # print(y / (x * 2**k))
    if int(y / (x * 2**k)) < 1:
        ans = k
        break
print(ans)

Submission status: Wrong Answer

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

x, y = map(int, input().split())
ans = 0
for k in range(1, 100):
    # print(y / (x * 2**k))
    if int(y / (x * 2**k)) < 1:
        ans = k
        break
print(ans)