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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

ans = 0

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

Submission status: Wrong Answer

Solution code:
X,Y = map(int,input().split())
a = 1
x = X
mul = min(X,2)
cnt = 1
for i in range(10000):
  x *= mul
  if x>=Y:
    cnt+=i
    break
print(cnt)

Submission status: Wrong Answer

Solution code:
X,Y = map(int,input().split())
a = 1
x = X
mul = min(X,2)
cnt = 1
for i in range(10000):
  x *= mul
  if x>Y:
    cnt+=i
    break
print(cnt)

Submission status: Wrong Answer

Solution code:
# row = [int(x) for x in input().rstrip().split(" ")]
# n = int(input().rstrip())
# s = input().rstrip()
# row = [int(input().rstrip()) for _ in range(n)]

def resolve():
    import sys
    input = sys.stdin.readline

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

    # 何倍までできるか
    m = y / x

    # 2 ** ?
    count = 0
    num = 1
    while m >= num:
        count += 1
        num *= 2
    print(count)


if __name__ == "__main__":
    resolve()

Submission status: Wrong Answer

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

cnt = 1
calc = X

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

print(cnt)

Submission status: Wrong Answer

Solution code:
X,Y=3,20

ans=0
seki=X

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

Submission status: Wrong Answer

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

ans=0
seki=X

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

Submission status: Wrong Answer

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

#ans = int(math.log2(y/x))

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

print(ans + 1)

Submission status: Wrong Answer

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

ans = int(math.log2(y/x))

print(ans + 1)

Submission status: Wrong Answer

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

ans = int(math.log2(y) - math.log2(x))

print(ans + 1)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

tmp = A
ans = 1
while tmp < B:
    tmp *= 2
    if tmp < B:
        ans += 1
print(ans)

Submission status: Wrong Answer

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

tmp = A
ans = 0
while tmp < B:
    tmp *= 2
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
x, y = map(int, input().split())
count = 0
ans = []
x_copy = x
while x_copy < y:
    x_copy = x
    x_copy *= 2 ** count
    ans.append(x_copy)
    count += 1
print(len(ans))

Submission status: Wrong Answer

Solution code:
from math import log2

X,Y = [int(i) for i in input().split()]

print(int(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())
key=Y//X
ans=math.floor(math.log2(key))
print(ans+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if y%2!=0:
    y-=1

cnt=0
while y>=x:
    cnt+=1
    y/=2

print(cnt)

Submission status: Wrong Answer

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

while z < y:
    z += x ** j
    j += 1

if z == y:
    print(j+1)
else:
    print(j)

Submission status: Wrong Answer

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

for i in range(Y-X):
    t = X * 2**i
    if t <=Y:
        l.append(t)
    else:
        break   

ans = len(l)
print(ans)

Submission status: Wrong Answer

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

for i in range(Y-X):
    if i == 0:
        t = X
        l.append(t)
    else:
        t = t * 2
        if t <=Y:
            l.append(t)
        else:
            break

ans = len(l)
print(ans)

Submission status: Wrong Answer

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

for i in range(Y-X):
    if i == 0:
        t = X
        l.append(t)
    else:
        t = t * 2
        if t <=Y:
            l.append(t)
        else:
            break

ans = len(l)
print(ans)

Submission status: Wrong Answer

Solution code:
import math


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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
import numpy


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

n = int(numpy.log2(numpy.longdouble(y/x)))

print(n+1)

Submission status: Wrong Answer

Solution code:
import math
import numpy


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

n = int(numpy.log2(y)-numpy.log2(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 = map(int,input().split(" "))

n = int(math.log2(y)-math.log2(x))

print(n+1)

Submission status: Wrong Answer

Solution code:
#n=int(input())
#s,t=input().split()
n,m = map(int, input().split())
#l=list(map(int, input().split()))

a=0
while n<m:
    a=a+1
    n=n*2

print(a)

Submission status: Wrong Answer

Solution code:
#n=int(input())
#s,t=input().split()
n,m = map(int, input().split())
#l=list(map(int, input().split()))

a=0
while n<m:
    a=a+1
    n=n*2



print(a)

Submission status: Wrong Answer

Solution code:
from collections import defaultdict
def readInt():
	return int(input())
def readInts():
	return list(map(int, input().split()))
def readChar():
	return input()
def readChars():
	return input().split()

from math import log2

x,y = readInts()
print(int(log2(y)-log2(x)+1))

Submission status: Wrong Answer

Solution code:
X, Y = map(int, input().split())
twoLine = [X*(2 ** i) for i in range(61)]
# 2分探索で調べる
left = -1
right = len(twoLine)
while right - left > 1:
    middle = (right + left) // 2
    if twoLine[middle] > Y:
        right = middle
    else:
        left = middle
print(middle)

Submission status: Wrong Answer

Solution code:
import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))

x,y=mp()
for i in range(10*5):
    x*=2
    if x>y:
        print(i+1)
        exit()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
X,Y = list(map(int,input().split()))
if X == 1 and Y ==1:
  print(1)
  exit()
if X == 1:
  X = 2
A = Y//X
B = A//2
num = 0
ans = 0
for i in range(1,10000000):
    num += 2**i
    if num > B:
        ans = i+1
        break
if X*(2**ans) <= Y:
    ans += 1
print(ans)

Submission status: Wrong Answer

Solution code:
X,Y = list(map(int,input().split()))
A = Y//X
B = A//2
num = 0
ans = 0
for i in range(1,10000000):
    num += 2**i
    if num > B:
        ans = i+1
        break
if X*(2**ans) <= Y:
    ans += 1
print(ans)

Submission status: Wrong Answer

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

ans = X
count = 0
while(ans < Y):
  if(ans*2>Y):
    exit()
  else:
    ans = ans * 2
    count += 1
    
print(ans)

Submission status: Wrong Answer

Solution code:
a,b = map(int,input().split())
if a == b == 1:
  print(1)
  exit()
  
div = b/a

n = 0

while 2**n <= div:

    n +=1

print(n)

Submission status: Wrong Answer

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

div = b/a

n = 0

while 2**n <= div:

    n +=1

print(n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# For taking integer inputs.
import math
from decimal import Decimal


def inp():
    return(int(input()))


# For taking List inputs.
def inlist():
    return(list(map(int, input().split())))


# For taking string inputs. Actually it returns a List of Characters, instead of a string, which is easier to use in Python, because in Python, Strings are Immutable.
def instr():
    s = input()
    return(list(s[:len(s)]))


# For taking space seperated integer variable inputs.
def invr():
    return(map(Decimal, input().split()))


x, y = invr()

a = y // x

res = (math.log(a) / math.log(2)) + 1
print(int(res))

Submission status: Wrong Answer

Solution code:
# For taking integer inputs.
import math


def inp():
    return(int(input()))


# For taking List inputs.
def inlist():
    return(list(map(int, input().split())))


# For taking string inputs. Actually it returns a List of Characters, instead of a string, which is easier to use in Python, because in Python, Strings are Immutable.
def instr():
    s = input()
    return(list(s[:len(s)]))


# For taking space seperated integer variable inputs.
def invr():
    return(map(int, input().split()))


x, y = invr()

a = y // x

res = int(math.log(a) // math.log(2)) + 1
print(res)

Submission status: Wrong Answer

Solution code:
# For taking integer inputs.
import math


def inp():
    return(int(input()))


# For taking List inputs.
def inlist():
    return(list(map(int, input().split())))


# For taking string inputs. Actually it returns a List of Characters, instead of a string, which is easier to use in Python, because in Python, Strings are Immutable.
def instr():
    s = input()
    return(list(s[:len(s)]))


# For taking space seperated integer variable inputs.
def invr():
    return(map(int, input().split()))


x, y = invr()

a = y / x

res = int(math.log(a) // math.log(2)) + 1
print(res)

Submission status: Wrong Answer

Solution code:
# For taking integer inputs.
import math


def inp():
    return(int(input()))


# For taking List inputs.
def inlist():
    return(list(map(int, input().split())))


# For taking string inputs. Actually it returns a List of Characters, instead of a string, which is easier to use in Python, because in Python, Strings are Immutable.
def instr():
    s = input()
    return(list(s[:len(s)]))


# For taking space seperated integer variable inputs.
def invr():
    return(map(int, input().split()))


x, y = invr()

a = y / x

res = int(math.log(a) / math.log(2)) + 1
print(res)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from math import log

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from math import log2, floor

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

Submission status: Wrong Answer

Solution code:
a = list(map(float,input().split()))
x = a[0]
y = a[1]

n = a[0] * 2
count = 1

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

Submission status: Wrong Answer

Solution code:
a = list(map(float,input().split()))
x = a[0]
y = a[1]

n = a[0]
count = 0

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

Submission status: Wrong Answer

Solution code:
a = list(map(int,input().split()))
x = a[0]
y = a[1]

n = a[0]
count =1

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

Submission status: Wrong Answer

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

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())
import math
k=int(math.log2(y/x))+1
print(k)

Submission status: Wrong Answer

Solution code:
import numpy as np

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

n = 1 + int(np.log2(y/x))
print(n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

comp=Y//X
log=math.floor(math.log2(comp))
#print(log)

print(log+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 / X, 2)) + 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:
from collections import deque
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import product,permutations,combinations,combinations_with_replacement
from collections import defaultdict,Counter
from bisect import bisect_left,bisect_right
# from math import gcd,ceil,floor,factorial
# from fractions import gcd
from functools import reduce
from pprint import pprint

INF = float("inf")

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

def mylistinput(n):
    return [ list(myinput()) for _ in range(n) ]

def mycol(data,col):
    return [ row[col] for row in data ]

def mysort(data,col,reverse_flag):
    data.sort(key=lambda x:x[col],reverse=reverse_flag)
    return data

def mymax(data):
    M = -1*float("inf")
    for i in range(len(data)):
        m = max(data[i])
        M = max(M,m)
    return M

def mymin(data):
    m = float("inf")
    for i in range(len(data)):
        M = min(data[i])
        m = min(m,M)
    return m

def mycount(ls,x):
    # lsはソート済みであること
    l = bisect_left(ls,x)
    r = bisect_right(ls,x)
    return (r-l)

def myoutput(ls,space=True):
    if space:
        if len(ls)==0:
            print(" ")
        elif type(ls[0])==str:
            print(" ".join(ls))
        elif type(ls[0])==int:
            print(" ".join(map(str,ls)))
        else:
            print("Output Error")
    else:
        if len(ls)==0:
            print("")
        elif type(ls[0])==str:
            print("".join(ls))
        elif type(ls[0])==int:
            print("".join(map(str,ls)))
        else:
            print("Output Error")

from math import ceil,floor,log
x,y = myinput()

# if x==y:
#     print(1)
#     exit()

ans = int( floor(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:
x,y = tuple(map(int,input().split()))

for i in range(1,10*4):
  x<<=1
  if x>y:
    print(i)
    break

Submission status: Wrong Answer

Solution code:
from collections import deque
from heapq import heapify,heappop,heappush,heappushpop
from copy import copy,deepcopy
from itertools import product,permutations,combinations,combinations_with_replacement
from collections import defaultdict,Counter
from bisect import bisect_left,bisect_right
# from math import gcd,ceil,floor,factorial
# from fractions import gcd
from functools import reduce
from pprint import pprint

INF = float("inf")

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

def mylistinput(n):
    return [ list(myinput()) for _ in range(n) ]

def mycol(data,col):
    return [ row[col] for row in data ]

def mysort(data,col,reverse_flag):
    data.sort(key=lambda x:x[col],reverse=reverse_flag)
    return data

def mymax(data):
    M = -1*float("inf")
    for i in range(len(data)):
        m = max(data[i])
        M = max(M,m)
    return M

def mymin(data):
    m = float("inf")
    for i in range(len(data)):
        M = min(data[i])
        m = min(m,M)
    return m

def mycount(ls,x):
    # lsはソート済みであること
    l = bisect_left(ls,x)
    r = bisect_right(ls,x)
    return (r-l)

def myoutput(ls,space=True):
    if space:
        if len(ls)==0:
            print(" ")
        elif type(ls[0])==str:
            print(" ".join(ls))
        elif type(ls[0])==int:
            print(" ".join(map(str,ls)))
        else:
            print("Output Error")
    else:
        if len(ls)==0:
            print("")
        elif type(ls[0])==str:
            print("".join(ls))
        elif type(ls[0])==int:
            print("".join(map(str,ls)))
        else:
            print("Output Error")

from math import ceil,floor,log
x,y = myinput()

ans = floor(log(floor(y/x),2)) + 1
print(ans)

Submission status: Wrong Answer

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

for i in range(1,10*4):
  x<<=1
  if x>y:
    print(i)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

input = sys.stdin.readline
MOD = 1000000007

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


if math.log(Y//X) == int(math.log(Y//X)):
    print(int(math.log2(Y//X)))
else:
    print(int(math.log2(Y//X))+1)

Submission status: Wrong Answer

Solution code:
import sys
import math

input = sys.stdin.readline
MOD = 1000000007

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

if X == 1 & Y == 1:
    print(0)
else:
    print(int(math.log2(Y//X))+1)

Submission status: Wrong Answer

Solution code:
import sys
import math

input = sys.stdin.readline
MOD = 1000000007

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())
n = math.log2(y/x)
if x == 1:
    n = int(n)
else:
    n = int(n)+1
print(n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b= map(int,input().split())
c = b//a
ans = 0
for i in range(10000):
    if 2**i <= c < 2**(i+1) :
        ans += i
print(a,b,c,ans +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:
X,Y = map(int, input().split())
import math


if X != 1:
    tmp1 = math.floor(math.log((Y/X),2))
    print(tmp1 + 1)
if X == 1 :
    tmp2 = math.floor(math.log((Y/X),2))
    print(tmp2)

Submission status: Wrong Answer

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

tmp1 = math.floor(math.log((Y/X),2))
print(tmp1 + 1)

Submission status: Wrong Answer

Solution code:
def myAnswer(X:int,Y:int) -> int:
   if(X*2 > Y): return 1
   ans = X
   total = 1
   while True:
      print(ans)
      ans *= 2
      if(ans > Y):
         break
      else:
         total += 1
   return total


def modelAnswer():
   tmp=1
def main():
   X, Y = map(int,input().split())
   print(myAnswer(X,Y))
if __name__ == '__main__':
   main()

Submission status: Wrong Answer

Solution code:
def myAnswer(X:int,Y:int) -> int:
   if(X*2 > Y): return 0
   ans = X
   total = 1
   while True:
      ans *= 2
      if(ans > Y):
         break
      else:
         total += 1
   return total


def modelAnswer():
   tmp=1
def main():
   X, Y = map(int,input().split())
   print(myAnswer(X,Y))
if __name__ == '__main__':
   main()

Submission status: Wrong Answer

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

for i in range(60):
  a = x*(2**i)
  if(a<=y):
    continue
  else:
    print(i)
    break

Submission status: Wrong Answer

Solution code:
import math
x,y = map(int,input().rstrip().split(' '))
n = int(math.log2(y/x)) if(y>x) else 0
print(n+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
x,y = map(int,input().rstrip().split(' '))
n = int(math.log2(y//x))
print(n)

Submission status: Wrong Answer

Solution code:
import math
x,y = map(int,input().rstrip().split(' '))
n = int(math.log2(y/x))
print(n)

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())
from math import log2
print(1+int(0.01+log2(y/x)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

cnt = 0
num = a
while num<b:
  cnt += 1
  num *= 2
  
print(cnt)

Submission status: Wrong Answer

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

import math
p = int(math.log(y/x, 2))
#print(p)

print(p+1)

Submission status: Wrong Answer

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

import math
p = int(math.log(y//x, 2))
#print(p)

print(p+1)

Submission status: Wrong Answer

Solution code:
def solve():
    a,y = map(int,input().split())
    ans = 1
    while(a<=y):
        a*=2
        ans+=1
    print(ans)
if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

Solution code:
import sys
import os

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    X, Y = il()
    ret = 0
    while True:
        X *= 2
        ret += 1
        if X >= Y: break

    print(ret)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
import sys
import os

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    X, Y = il()
    ret = 1
    while True:
        X *= 2
        if X >= Y: break
        ret += 1

    print(ret)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

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, acos, atan, asin, log
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 decimal import *
def input(): return sys.stdin.readline().strip()
def STR(): return input()
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 = sys.maxsize
mod = 10 ** 9 + 7
dx = [0, 0, 1, -1, 1, -1, -1, 1]
dy = [1, -1, 0, 0, 1, -1, 1, -1]
getcontext().prec = 28

x, y = MAP()
n = int(Decimal(log(Decimal(y) / Decimal(x), 2)))
print(n + 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, acos, atan, asin, log
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
def input(): return sys.stdin.readline().strip()
def STR(): return input()
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 = sys.maxsize
mod = 10 ** 9 + 7
dx = [0, 0, 1, -1, 1, -1, -1, 1]
dy = [1, -1, 0, 0, 1, -1, 1, -1]

x, y = MAP()
print(int(log(y / x, 2)) + 1)

Submission status: Wrong Answer

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

for i in range(y):
    if x * 2**i <= y:
        continue
    else:
        print(i)
        break

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if b < 2*a:
  print(1)
else:
  print((b-a)//a+1)

Submission status: Wrong Answer

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

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 math

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

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

print(ans)

Submission status: Wrong Answer

Solution code:
import math

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

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

print(ans)

Submission status: Wrong Answer

Solution code:
import math

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

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

print(ans)

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())
num = x
for i in range(2, y//x+1):
    num *= 2
    if num > y:
        print(i - 1)
        exit()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math
X, Y = [int(x) for x in input().split()]
a = math.log2(Y/X)
i = 0
while i <= a:
    i += 1
print(i)