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:
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.ceil(math.log2(y/x)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

for i in range(1,Y - X):
    if X * 2 **(i - 1) > Y:
        break
    else:
        A.append(X * (2 ** (i - 1)))
print(len(A))

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

output = 0

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

Submission status: Wrong Answer

Solution code:
import math
X,Y = map(int,input().split())
'''
lengthを求めたい 
Y > max = (Y//X)*X = (2**length)*X
'''
length = math.log( Y//X ,2)
if length == 0:
  print(0)
else:  
  print(int(length//1+1))

Submission status: Wrong Answer

Solution code:
import math
X,Y = map(int,input().split())
'''
lengthを求めたい 
Y > max = (Y//X)*X = (2**length)*X
'''
length = math.log( Y//X ,2)
print(int(length//1+1))

Submission status: Wrong Answer

Solution code:
import math
x,y = map(int,input().split())
print(math.floor(math.log2(y)-math.log2(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 collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
import math
import sys
input = sys.stdin.readline
#文字列のときはうまく行かないのでコメントアウトすること
sys.setrecursionlimit(2147483647)

def main():
  x, y = map(int, input().split())
  ans = math.floor(math.log(2*y/x, 2))
  print(ans)

if __name__ == '__main__':
  main()

Submission status: Wrong Answer

Solution code:
from math import log2, floor

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

Submission status: Wrong Answer

Solution code:
import math
import decimal
X,Y=map(decimal.Decimal,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.log2(Y/X))+1)

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:
import math
x,y = map(int,input().split())
print(math.floor(math.log2(y/x)))

Submission status: Wrong Answer

Solution code:
def Multiple_Gift(x , y):

    ans = 1

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

    return ans

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

if __name__ == '__main__':
    main()

Submission status: 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 = 1
num = x
while num < y:
    if num * 2 < y:
        num *= 2
        ans += 1
    else:
        break
print(ans)

Submission status: Wrong Answer

Solution code:
from math import log
x,y=map(int,input().split())
ans=int((log(y/x,2)+1)//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:
A, B = map(int, input().split())
a = []
a.append(A)
while max(a)<B:
    a.append(max(a)*2)
a.remove(max(a))
print(len(a))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

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

def one_str():
    return input()

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

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

Submission status: Wrong Answer

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

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

def one_str():
    return input()

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

X,Y=input_int()

import math

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

Submission status: Wrong Answer

Solution code:
import numpy as np

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

Submission status: Wrong Answer

Solution code:
import math
import numpy as np

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

Submission status: Wrong Answer

Solution code:
import numpy as np

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

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

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

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

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

Submission status: Wrong Answer

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

if x == y:
    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:
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.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+0.00000001)) + 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.log2(y//x-0.000001) + 1))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
x, y = map(int, input().split())
print(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+0.0001) + 1))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
x, y = map(int, input().split())
print(int(math.log2(y/x+0.00001) + 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(10**(-4)*math.floor(math.log2(y**(10**4)) - math.log2(x**(10**4)))) + 1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
x, y = map(int, input().split())
print(math.floor(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.log2(y//x) + 1))

Submission status: Wrong Answer

Solution code:
import math
x, y = map(int, input().split())
if x == 1 and y == 1:
    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:
X, Y = map(int, input().split())
a, b = 0, 0
while True:
    X = X//2
    if X < 2:
        break
    a += 1
while True:
    Y = Y//2
    if Y < 2:
        break
    b += 1
print(b-a+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from math import log2

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

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

Submission status: Wrong Answer

Solution code:
from math import log2

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

ans = log2(Y / X) + 1
print(ans)

Submission status: Wrong Answer

Solution code:
x,y=map(int,input().split())
n=y//x
m=len(bin(n))-bin(n).rfind("1")-1
print(2**m-1)

Submission status: Wrong Answer

Solution code:
temp=list(map(int, input().split()))
X=temp[0]
Y=temp[1]

import math

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

Submission status: Wrong Answer

Solution code:
temp=list(map(int, input().split()))
X=temp[0]
Y=temp[1]

import math

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = input().split()
ans=1
b=0
c=[int(a[0])]
while(0==0):
    if c[b]*2<int(a[1])-1:
        c.append(c[b]*2)
        b+=1
        ans+=1
    else:
        print(ans)
        break

Submission status: Wrong Answer

Solution code:
a = input().split()
ans=1
b=0
c=[int(a[0])]
while(0==0):
    if c[b]*2<int(a[1])-1:
        c.append(c[b]*2)
        b+=1
    else:
        print(len(c))
        break

Submission status: Wrong Answer

Solution code:

from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations
import sys
import bisect
import string
import math
import time
from fractions import gcd
#import random


def I(): return int(input())


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


def LI(): return [int(i) for i in input().split()]


def LI_(): return [int(i)-1 for i in input().split()]


def StoI(): return [ord(i)-97 for i in input()]


def ItoS(nn): return chr(nn+97)


def input(): return sys.stdin.readline().rstrip()


def show(*inp, end='\n'):
    if show_flg:
        print(*inp, end=end)


YN = ['Yes', 'No']
MOD = 10**9+7
inf = float('inf')
IINF = 10**19
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
sys.setrecursionlimit(10**6)


# show_flg = False
show_flg = True


def main():
    X, Y = MI()
    tmp = math.log2(Y) - math.log2(X)
    if X * 2 ** (int(tmp) + 1) <= Y:
        print(tmp + 2)
    elif X * 2 ** int(tmp) <= Y:
        print(tmp + 1)
    elif X * 2 ** (int(tmp)-1) <= Y:
        print(tmp)

    print(-1)

    return

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

    print(ans)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:

from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations
import sys
import bisect
import string
import math
import time
from fractions import gcd
#import random


def I(): return int(input())


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


def LI(): return [int(i) for i in input().split()]


def LI_(): return [int(i)-1 for i in input().split()]


def StoI(): return [ord(i)-97 for i in input()]


def ItoS(nn): return chr(nn+97)


def input(): return sys.stdin.readline().rstrip()


def show(*inp, end='\n'):
    if show_flg:
        print(*inp, end=end)


YN = ['Yes', 'No']
MOD = 10**9+7
inf = float('inf')
IINF = 10**19
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
sys.setrecursionlimit(10**6)


# show_flg = False
show_flg = True


def main():
    X, Y = MI()
    tmp = math.log2(Y) - math.log2(X)
    # print(tmp)
    print(int(tmp))

    return

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

    print(ans)



if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:

from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations
import sys
import bisect
import string
import math
import time
from fractions import gcd
#import random


def I(): return int(input())


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


def LI(): return [int(i) for i in input().split()]


def LI_(): return [int(i)-1 for i in input().split()]


def StoI(): return [ord(i)-97 for i in input()]


def ItoS(nn): return chr(nn+97)


def input(): return sys.stdin.readline().rstrip()


def show(*inp, end='\n'):
    if show_flg:
        print(*inp, end=end)


YN = ['Yes', 'No']
MOD = 10**9+7
inf = float('inf')
IINF = 10**19
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
sys.setrecursionlimit(10**6)


# show_flg = False
show_flg = True


def main():
    X, Y = MI()
    tmp = math.log2(Y) - math.log2(X)
    # print(tmp)
    if X * 2 ** (int(tmp) + 1) <= Y:
        print(int(tmp) + 2)
    else:
        print(int(tmp) + 1)

    return

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

    print(ans)



if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:

from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations
import sys
import bisect
import string
import math
import time
from fractions import gcd
#import random


def I(): return int(input())


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


def LI(): return [int(i) for i in input().split()]


def LI_(): return [int(i)-1 for i in input().split()]


def StoI(): return [ord(i)-97 for i in input()]


def ItoS(nn): return chr(nn+97)


def input(): return sys.stdin.readline().rstrip()


def show(*inp, end='\n'):
    if show_flg:
        print(*inp, end=end)


YN = ['Yes', 'No']
MOD = 10**9+7
inf = float('inf')
IINF = 10**19
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
sys.setrecursionlimit(10**6)


# show_flg = False
show_flg = True


def main():
    X, Y = MI()
    tmp = math.log2(Y) - math.log2(X)
    print(int(tmp) + 1)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:

from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations
import sys
import bisect
import string
import math
import time
from fractions import gcd
#import random


def I(): return int(input())


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


def LI(): return [int(i) for i in input().split()]


def LI_(): return [int(i)-1 for i in input().split()]


def StoI(): return [ord(i)-97 for i in input()]


def ItoS(nn): return chr(nn+97)


def input(): return sys.stdin.readline().rstrip()


def show(*inp, end='\n'):
    if show_flg:
        print(*inp, end=end)


YN = ['Yes', 'No']
MOD = 10**9+7
inf = float('inf')
IINF = 10**19
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
sys.setrecursionlimit(10**6)


# show_flg = False
show_flg = True


def main():
    X, Y = MI()
    tmp = int(math.log2(Y//X))
    print(tmp + 1)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:

from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations
import sys
import bisect
import string
import math
import time
from fractions import gcd
#import random


def I(): return int(input())


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


def LI(): return [int(i) for i in input().split()]


def LI_(): return [int(i)-1 for i in input().split()]


def StoI(): return [ord(i)-97 for i in input()]


def ItoS(nn): return chr(nn+97)


def input(): return sys.stdin.readline().rstrip()


def show(*inp, end='\n'):
    if show_flg:
        print(*inp, end=end)


YN = ['Yes', 'No']
MOD = 10**9+7
inf = float('inf')
IINF = 10**19
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
sys.setrecursionlimit(10**6)


# show_flg = False
show_flg = True


def main():
    X, Y = MI()
    tmp = int(math.log2(Y/X))
    print(tmp + 1)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

a = x
ans = 1

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

print(ans)

Submission status: Wrong Answer

Solution code:
import sys
from math import log2, floor

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

def main():
    return 1 + floor(log2(y // x))

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

Submission status: Wrong Answer

Solution code:
import sys
from math import log2, floor

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

def main():
    return 1 + floor(log2(y / x))

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

Submission status: Wrong Answer

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

def main():
    X, Y = map(int, input().split())
    ans = solve(X, Y)
    print(ans)

if __name__ == "__main__":
    main()

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(math.floor(math.log2(math.floor(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 = map(int, input().split())

print(int(math.log2(Y / X)))

Submission status: Wrong Answer

Solution code:
dbflag=""

def debug(*args):
	if ""!=dbflag: print(*args)

if ""!=dbflag: _INDATA=open(dbflag)

def readline():
	if ""!=dbflag:return _INDATA.readline()
	else: return input()


result = 0

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



import math
result = math.floor(math.log2(Y) - math.log2(X)) +1


if X<1 or Y < 1 or X>Y or X > 10**18 or Y > 10**18:
  print(0)
else:
  print(int(result))

Submission status: Wrong Answer

Solution code:
dbflag=""

def debug(*args):
	if ""!=dbflag: print(*args)

if ""!=dbflag: _INDATA=open(dbflag)

def readline():
	if ""!=dbflag:return _INDATA.readline()
	else: return input()


result = 0

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



import math
result = math.floor(math.log2(Y) - math.log2(X)) +1



print(int(result))

Submission status: Wrong Answer

Solution code:
dbflag=""

def debug(*args):
	if ""!=dbflag: print(*args)

if ""!=dbflag: _INDATA=open(dbflag)

def readline():
	if ""!=dbflag:return _INDATA.readline()
	else: return input()


result = 0

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



import math
result = math.floor(math.log2(Y/X)) +1



print(int(result))

Submission status: Wrong Answer

Solution code:
dbflag=""

def debug(*args):
	if ""!=dbflag: print(*args)

if ""!=dbflag: _INDATA=open(dbflag)

def readline():
	if ""!=dbflag:return _INDATA.readline()
	else: return input()


result = 0

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



import math
result = math.floor(math.log2(Y/X)) +1



print(result)

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

Solution code:
dbflag=""

def debug(*args):
	if ""!=dbflag: print(*args)

if ""!=dbflag: _INDATA=open(dbflag)

def readline():
	if ""!=dbflag:return _INDATA.readline()
	else: return input()


result = 0

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



import math
result = math.floor(math.log(Y/X,2)) +1



print(result)

Submission status: Wrong Answer

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
from collections import deque
def getN():
    return int(input())
def getList():
    return list(map(int, input().split()))
import math
import bisect
from logging import getLogger, StreamHandler, DEBUG, WARNING
logger = getLogger(__name__)
handler = StreamHandler()
handler.setLevel(DEBUG)
logger.setLevel(DEBUG)
# handler.setLevel(WARNING)
# logger.setLevel(WARNING)
logger.addHandler(handler)
def main():
    x,y = getList()
    print(math.floor(math.log(y/x,2) + 1))

    # print("No")

if __name__ == "__main__":
    main()

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:
import math
a,b=map(int,input().split())
print(math.floor(math.log2(b)-math.log2(a)+1))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b=map(int,input().split())
ans=0
while b>a:
  a*=2
  ans+=1
print(ans-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:
X, Y = list(map(int, input().split()))
ans = 1
n = 1
while X * (2 ** n) < Y:
    ans += 1
    n += 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(int(math.log2(y/x))+1)

Submission status: Wrong Answer

Solution code:
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools
sys.setrecursionlimit(10**8)
mod = 10**9+7
mod2 = 998244353
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

x,y = inpl()
n = y / x
res = 1
while True:
    if n < 2:
        print(res)
        break
    n /= 2
    res += 1

Submission status: Wrong Answer

Solution code:
import sys
import math

x, y = [int(x) for x in sys.stdin.readline().split()]

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

Submission status: Wrong Answer

Solution code:
import sys
# import collections
import math
# import string
# import bisect
# import re
# import itertools
# import statistics

def main():
    x, y = (int(i) for i in sys.stdin.read().split())
    ans = 1 + math.floor(math.log(y // x, 2))
    print(ans)

if __name__ == "__main__":
    # execute only if run as a script
    main()

# なぜ通らないの

Submission status: Wrong Answer

Solution code:
import sys
# import collections
import math
# import string
# import bisect
# import re
# import itertools
# import statistics

def main():
    x, y = (int(i) for i in sys.stdin.read().split())
    ans = 1 + math.floor(math.log2(y // x))
    print(ans)

if __name__ == "__main__":
    # execute only if run as a script
    main()

Submission status: Wrong Answer

Solution code:
import sys
# import collections
import math
# import string
# import bisect
# import re
# import itertools
# import statistics

def main():
    x, y = (int(i) for i in sys.stdin.read().split())
    ans = 1 + math.floor(math.log2(y / x)) if x != 1 else y
    print(ans)

if __name__ == "__main__":
    # execute only if run as a script
    main()

Submission status: Wrong Answer

Solution code:
import sys
# import collections
import math
# import string
# import bisect
# import re
# import itertools
# import statistics

def main():
    x, y = (int(i) for i in sys.stdin.read().split())
    ans = 1 + math.floor(math.log2(y / x))
    print(ans)
    
if __name__ == "__main__":
    # execute only if run as a script
    main()

Submission status: Wrong Answer

Solution code:
x,y=map(int,input().split())
c=-1
res=0
cnt=10
for i in range(x,y):
    pre=0
    c=i
    if i==x*2 or cnt>100000:
        break
    else:
        while c<=y:
            pre+=1
            c=c*2
        res=max(res,pre)
        cnt+=1

print(res)

Submission status: Wrong Answer

Solution code:
x,y=map(int,input().split())
c=-1
res=0
cnt=10
for i in range(x,y):
    pre=0
    c=i
    if i==x*2 or cnt>10:
        break
    else:
        while c<=y:
            pre+=1
            c=c*2
        res=max(res,pre)
        cnt+=1

print(res)

Submission status: Wrong Answer

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

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())
Y = int(Y / X)

print(int(log2(Y)) + 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 log
X, Y = map(int, input().split())
print(int((log(Y,2)) - (log(X,2)) + 1))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
def input():
    import sys
    return sys.stdin.readline().rstrip()


def main():
    import math
    import collections
    import itertools

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




if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
X,Y=map(int,input().split())
d=Y-X
k= Y // X
if k <= 1:
  print(1)
  exit(0)
count=1
while(1):
  if k < 2**count:
    count+=1
    break
  elif k ==2**count:
    break
  else:
    count+=1
print(count)

Submission status: Wrong Answer

Solution code:
X,Y=map(int,input().split())
d=Y-X
k= Y // X
if k <= 1:
  print(1)
  exit(0)
count=0
while(1):
  if k <= 2**count:
    break
  else:
    count+=1
print(count+1)

Submission status: Wrong Answer

Solution code:
X,Y=map(int,input().split())
d=Y-X
k= d // X
if k <= 1:
  print(1)
  exit(0)
count=0
while(1):
  if Y <= 2**count:
    break
  else:
    count+=1
print(count)

Submission status: Wrong Answer

Solution code:
X,Y=map(int,input().split())
d=Y-X
k= d // X
if k <= 1:
  print(1)
  exit(0)
count=0
while(1):
  if k <= 2**count:
    break
  else:
    count+=1
print(count)

Submission status: Wrong Answer

Solution code:
X,Y=map(int,input().split())
d=Y-X
k= d // X
if k <= 1:
  print(1)
  exit(0)
count=0
while(1):
  if k < 2**count:
    break
  else:
    count+=1
print(count)

Submission status: Wrong Answer

Solution code:
X,Y=map(int,input().split())
d=Y-X
k= d // X
if k <= 1:
  print(1)
  exit(0)
count=0
while(1):
  if k < 2**count:
    break
print(count)

Submission status: Wrong Answer

Solution code:
X,Y=map(int,input().split())
d=Y-X
k= d // X
if k <= 1:
  print(1)
  exit(0)
count=0
while(1):
  if k > 2**count:
    break
print(count)

Submission status: Wrong Answer

Solution code:
X,Y=map(int,input().split())
d=Y-X
k= d // X
count=0
while(1):
  if k > 2**count:
    break
print(count)

Submission status: Wrong Answer

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

# Xを何回2倍したらYを超えるか確かめる
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(2 * 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:
import math
X, Y = map(int, input().split())
print(int(1 + math.log2(Y / X)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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