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 = [int(x) for x in input().split()]
a = math.log2(Y/X)
print(int(a) + 1) if a.is_integer() else print(math.ceil(a))

Submission status: Wrong Answer

Solution code:
import math
X, Y = [int(x) for x in input().split()]
print(math.ceil(math.log2(Y/X)))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys
from math import floor, log
x, y = [int(i) for i in sys.stdin.readline().split()]
y /= x
x = 1
print(floor(log(y, 2)) + 1)

Submission status: Wrong Answer

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

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

if X==2:
    x=Y
else:
    x=Y/X
N=0
temp=1
while temp<=x:
    temp*=2
    N+=1
print(N)

Submission status: Wrong Answer

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

x=Y/X
N=0
temp=1
while temp<=x:
    temp*=2
    N+=1
print(N)

Submission status: Wrong Answer

Solution code:
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
import math
import bisect
import random
from itertools import permutations, accumulate, combinations
import sys
import string
from bisect import bisect_left, bisect_right
from math import factorial, ceil, floor


INF = float('inf')
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LIM(): return list(map(lambda x:int(x) - 1, sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def LIRM(n): return [LIM() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
mod = 1000000007



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


print(cnt)

Submission status: Wrong Answer

Solution code:
import math

x,y=map(int,input().split())
print(int(math.log(y, 2)-math.log(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:
import math
a=list(map(int,input().split()))
print(math.floor(math.log2(a[1]/a[0]))+1)

Submission status: Wrong Answer

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

if 2**(ans-1) <= y/x and y/x < 2**ans:
  print(ans)
elif 2**(ans) <= y/x and y/x < 2**(ans+1):
  print(ans+1)
elif 2**(ans-2)<=y/x and y/x < 2**(ans-1):
  print(ans-1)
else:
  print("error")

Submission status: Wrong Answer

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

pre_ans = math.log2(y/x)

if pre_ans.is_integer():
  ans = pre_ans + 1
else:
  ans = math.ceil(pre_ans)

  
print(ans)

Submission status: Wrong Answer

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

pre_ans = math.log2(y/x)
ans = math.ceil(pre_ans)

if pre_ans == ans:
  ans += 1

  
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x,y=map(int,input().split())
import math
p=math.log(y/x,2)+10**(-3)*5
print(int(p)+1)

Submission status: Wrong Answer

Solution code:
x,y=map(int,input().split())
import math
p=math.log(y/x,2)+10**(-5)
print(int(p)+1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x,y=map(int,input().split())
import math
p=math.log(y/x,2)+10**(-9)
print(int(p)+1)

Submission status: Wrong Answer

Solution code:
x,y=map(int,input().split())
import math
p=math.log(y/x,2)+10**(-18)
print(int(p)+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)) + 1)

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

Solution code:
import math

X,Y = map(int,input().split())
a = int(math.log(Y/X,2))
print(a+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:
import math

n = list(map(int,input().split()))
X = n[0]
Y = n[1]

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

Submission status: Wrong Answer

Solution code:
import math

n = list(map(int,input().split()))
X = n[0]
Y = n[1]

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

from math import log2
print(1 + int(log2(Y // X)))

Submission status: Wrong Answer

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

from math import log2
print(1 + int(log2(Y / X)))

Submission status: Wrong Answer

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

import math
print(int(math.log2(xy[1] / xy[0])) + 1)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if X == Y:
  print('1')
  
else:
  for i in range(Y//X+1):
    print(X*2**i)
    if X*(2**i) > Y:
      print(i)
      exit()

Submission status: Wrong Answer

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

if X == Y:
  print('1')
else:
  for i in range(Y//X):
    if X*2**i > Y:
      print(i)
      exit()

Submission status: Wrong Answer

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

for i in range(Y//X):
  if X*2**i > Y:
    print(i)
    exit()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

while x < y:
    x *= 2
    counter += 1
    
print(counter-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:
import math

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

a = X
print(math.ceil(math.log2(Y / a)))

Submission status: Wrong Answer

Solution code:
import math

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print(c)

Submission status: Wrong Answer

Solution code:
import math
X,Y = map(int,input().split())
#a_n = X*2^(n-1)
tmp = int(math.log2(Y/X))
n = tmp + 1
print(n)

Submission status: Wrong Answer

Solution code:
import math
X,Y = map(int,input().split())
#a_n = X*2^(n-1)
tmp = int(math.log2(Y//X))
n = tmp + 1
print(n)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

n = y / x
if x == y:
	print(1)
else:
	c = 0
	while n >= 2:
		n = n / 2
		c += 1
	print(1 + c)

Submission status: Wrong Answer

Solution code:
import math

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

n = y / x
if x == y:
	print(1)
else:
	print(1 + int(math.log2(n) // 1))

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

Solution code:
import math
t = input().split(" ")
x = float(t[0])
y = float(t[1])
z = math.log(y/x, 2)
z //= 1.0
print(int(z) + 1)

Submission status: Wrong Answer

Solution code:
import math
X, Y = map(int, input().split())
res = 0
print(int(math.log2(Y / X)) + 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 = map(int, input().split())
cnt = 1;
while x < y:
    x *= 2
    cnt += 1
print(cnt)

Submission status: Wrong Answer

Solution code:
def inpl(): return [int(i) for i in input().split()]
import math
X, Y = inpl()
print(1+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;print((lambda l:math.floor(1e-3+math.log2(l[1]/l[0]))+1)(list(map(int,input().split()))))

Submission status: Wrong Answer

Solution code:
import math;print(int((lambda l:math.floor(math.log(l[1]//l[0],2))+1)(list(map(int,input().split())))))

Submission status: Wrong Answer

Solution code:
import math;print(int((lambda l:math.floor(1e-9+math.log2(l[1]/l[0]))+1)(list(map(int,input().split())))))

Submission status: Wrong Answer

Solution code:
import math;print((lambda l:math.floor(1e-6+math.log2(l[1]/l[0]))+1)(list(map(int,input().split()))))

Submission status: Wrong Answer

Solution code:
import math;print((lambda l:math.floor(1e-9+math.log2(l[1]/l[0]))+1)(list(map(float,input().split()))))

Submission status: Wrong Answer

Solution code:
import math;print((lambda l:math.floor(1e-5+math.log2(l[1]/l[0]))+1)(list(map(int,input().split()))))

Submission status: Wrong Answer

Solution code:
import math;print((lambda l:math.floor(1e-9+math.log2(l[1]/l[0]))+1)(list(map(int,input().split()))))

Submission status: Wrong Answer

Solution code:
import math;print((lambda l:math.floor(math.log2(l[1]/l[0]))+1+1e-9)(list(map(int,input().split()))))

Submission status: Wrong Answer

Solution code:
import math;print((lambda l:math.floor(math.log2(l[1]/l[0]+1e-9))+1)(list(map(int,input().split()))))

Submission status: Wrong Answer

Solution code:
import math;print((lambda l:math.floor(math.log2(l[1]/l[0])+1e9)+1)(list(map(int,input().split()))))

Submission status: Wrong Answer

Solution code:
import math;print((lambda l:math.floor(math.log2(l[1]/l[0]))+1)(list(map(int,input().split()))))

Submission status: Wrong Answer

Solution code:
import math

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

n = y / x
if x == y:
	print(0)
else:
	print(1 + int(math.log2(n) // 1))

Submission status: Wrong Answer

Solution code:
import math

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

n = y / x

print(1 + int(math.log2(n) // 1))

Submission status: Wrong Answer

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

n = y / x

c = 1
while True:
	if n / 2 >= 1:
		c += 1
		n = n / 2
	else:
		break

print(c)

Submission status: Wrong Answer

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

s_in = lambda: stdin.readline()[:-1] # s = s_in()
d_in = lambda: int(stdin.readline()) # N = d_in()
ds_in = lambda: list(map(int, stdin.readline().split())) # List = ds_in()

X, Y = ds_in()
print(int(math.log2(2*Y/X)))

Submission status: Wrong Answer

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

s_in = lambda: stdin.readline()[:-1] # s = s_in()
d_in = lambda: int(stdin.readline()) # N = d_in()
ds_in = lambda: list(map(int, stdin.readline().split())) # List = ds_in()

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

Submission status: Wrong Answer

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

s_in = lambda: stdin.readline()[:-1] # s = s_in()
d_in = lambda: int(stdin.readline()) # N = d_in()
ds_in = lambda: list(map(int, stdin.readline().split())) # List = ds_in()

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

def main():
    t = input().split(" ")
    X, Y = int(t[0]), int(t[1])

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

    print(r)

main()

Submission status: Wrong Answer

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

i = 1
while y >= (x * (2 ** i)) and y >= (x * (2 ** (i + 1))):
	i += 1

print(i + 1)

Submission status: Wrong Answer

Solution code:
import math 
a,b=map(int,input().split())
s=int(b/a).bit_length()
print(s)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

#
A = lambda i: X*2**(i-1)

#
n = math.log2(Y/X) + 1
if n==int(n):
    print(int(n))
    exit()

n = int(n)
#print(A(n-1), A(n), A(n+1))
if Y<A(n-1):
    print(n-2)
    exit()
if Y<A(n):
    print(n-1)
    exit()
if Y<A(n+1):
    print(n)
    exit()

Submission status: Wrong Answer

Solution code:
from math import *

X,Y = map(int,raw_input().split(" "))

ans = 0
v = 2
for i in range(62):
    if X * v <= Y:
        ans = max(ans,i+2)
    v *= 2
print ans

Submission status: Wrong Answer

Solution code:
from math import *

X,Y = map(int,raw_input().split(" "))

def gen_twos():
    res = []
    x = 2
    for i in range(60):
        res.append(x)
        x *= 2
    return res
 
def solve():
    twos = gen_twos()
    
    ans = 0
    for tw in twos:
        if tw > Y:
            continue
        
        zm = floor(float(Y) / tw)
        if tw * zm < X:
            continue
        
        v = int(tw * zm)
        cnt = 0
        while v >= X:
            cnt += 1
            if v % 2:
                break
            v /= 2
        ans = max(ans,cnt)
    print ans

solve()

Submission status: Wrong Answer

Solution code:
S = input()
n = len(S)
seq = []
for i in range(n-1):
    if S[i] != S[i+1]:
        seq.append(max(i+1, n-i-1))

print(min(seq))

Submission status: Wrong Answer

Solution code:
import math

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

i = int(math.log(Y/X, 2)) + 1
print(i)

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.log(Y/X,2)+1))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def getAns(x,y):
    num=int(y/x)
    res=1
    while num>1:
        num = int(num/2)
        res+=1
    return res

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

Submission status: Wrong Answer

Solution code:
from math import frexp
a, b = map(int, input().split())
print(frexp(b)[1]-frexp(a)[1]+1)

Submission status: Wrong Answer

Solution code:
from math import log

X, Y = [int(val) for val in raw_input().split(" ")]

print int(log(Y,2) - log(X,2))+1

Submission status: Wrong Answer

Solution code:
from math import log

X, Y = [int(val) for val in raw_input().split(" ")]

print int(log(Y*1e-9, 2) + log(1e9/X, 2))+1

Submission status: Wrong Answer

Solution code:
from math import log

X, Y = [float(val) for val in raw_input().split(" ")]

print int(log(Y/X, 2.))+1

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import numpy as np


def bigLog(v):
    n = 8
    if(len(v)>n):
        v1 = float(v[0:n])
        k = len(v[n:])
        v2 = float(v[n:])
        v = float(v)
        logv =k*np.log(10)+np.log(v1) + (v2/v1)/(10.0 ** n)
        return logv
    else:
        v = float(v)
        return np.log(v)
    

inp = input().split(" ")
x = inp[0]
y = inp[1]

logx = bigLog(x)
logy = bigLog(y)

print(int(1+np.floor((logy - logx + 0.00000001 ) / np.log(2))))

Submission status: Wrong Answer

Solution code:
import numpy as np


def bigLog(v):
    n = 10
    if(len(v)>n):
        v1 = float(v[0:n])
        k = len(v[n:])
        v2 = float(v[n:])
        v = float(v)
        logv =k*np.log(10)+np.log(v1) + (v2/v1)/(10.0 ** n)
        return logv
    else:
        v = float(v)
        return np.log(v)
    

inp = input().split(" ")
x = inp[0]
y = inp[1]

logx = bigLog(x)
logy = bigLog(y)

print(int(1+np.floor((logy - logx + 0.00000001 ) / np.log(2))))

Submission status: Wrong Answer

Solution code:
import numpy as np


inp = input().split(" ")
x = float(inp[0])
y = inp[1]
if len(y) > 7:
    y1 = float(y[0:7])
    y2 = float(y[7:])
    logy =7*np.log(10)+np.log(y1) + (y2/y1)/10000000.0
    print(int(1+np.floor((logy - np.log(x) + 0.00000001 ) / np.log(2))))

else:
    y = float(y)
    print(int(1+np.floor((np.log(y)-np.log(x) + 0.0000000001 ) / np.log(2))))

Submission status: Wrong Answer

Solution code:
import numpy as np


inp = input().split(" ")
x = float(inp[0])
y = inp[1]
if len(y) > 7:
    y1 = float(y[0:7])
    y2 = float(y[7:])
    logy =7*np.log(10)+np.log(y1) + y2/y1/10000000
    print(int(1+np.floor((logy - np.log(x) + 0.00000001 ) / np.log(2))))

else:
    print(int(1+np.floor((np.log(float(y))-np.log(x) + 0.00000001 ) / np.log(2))))

Submission status: Wrong Answer

Solution code:
import numpy as np


inp = input().split(" ")
x = float(inp[0])
y = inp[1]
if len(y) > 7:
    y1 = float(y[0:7])
    y2 = float(y[7:])
    logy =7*np.log(10)+np.log(y1) + y2/y1
    print(int(1+np.floor((logy - np.log(x) + 0.00000001 ) / np.log(2))))

else:
    print(int(1+np.floor((np.log(float(y))-np.log(x) + 0.00000001 ) / np.log(2))))

Submission status: Wrong Answer

Solution code:
import numpy as np


inp = input().split(" ")
x = float(inp[0])
y = float(inp[1])

print(int(1+np.floor((np.log(y)-np.log(x) + 0.00000001 ) / np.log(2))))

Submission status: Wrong Answer

Solution code:
import numpy as np


inp = input().split(" ")
x = float(inp[0])
y = float(inp[1])

print(int(1+np.floor((np.log(y)-np.log(x) + 0.0000000001 ) / np.log(2))))

Submission status: Wrong Answer

Solution code:
import numpy as np


inp = input().split(" ")
x = float(inp[0])
y = float(inp[1])

print(int(1+np.floor((np.log(y)-np.log(x)) / np.log(2))))

Submission status: Wrong Answer

Solution code:
import numpy as np


inp = input().split(" ")
x = float(inp[0])
y = float(inp[1])

print(1+np.floor((np.log(y)-np.log(x)) / np.log(2)))

Submission status: Wrong Answer

Solution code:
'''input
10 100
'''
from math import log,floor,ceil
x,y = map(float,raw_input().split())
x1 = int(log(y,2)-log(x,2))
print x1+1

Submission status: Wrong Answer

Solution code:
'''input
10 100
'''
from math import log,floor,ceil
x,y = map(float,raw_input().split())
ans = 0
m = 1
while y >= m*x:
	ans += 1
	m <<= 1
print ans

Submission status: Wrong Answer

Solution code:
'''input
10 100
'''
from math import log,floor,ceil
x,y = map(float,raw_input().split())
x1 = int(log(y,2)-log(x,2))
print x1+1

Submission status: Wrong Answer

Solution code:
'''input
25 100
'''
from math import log,floor,ceil
x,y = map(float,raw_input().split())
d = y/x
x1 = int(ceil(log(d,2)))
x2 = int(floor(log(d,2)))
if (2**x1)*x <= y:
	print x1+1
else:
	print x2+1

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
X, Y = map(int, input().split())
# X * (2**(n-1)) <= Y
# 2**(n-1) <= Y/X
# n-1 <= log_2 (Y/X)

from math import log2
eps = 10**(-9)
print(1 + int(log2(Y/X)+eps))

Submission status: Wrong Answer

Solution code:
X, Y = map(int, input().split())
# X * (2**(n-1)) <= Y
# 2**(n-1) <= Y/X
# n-1 <= log_2 (Y/X)

from math import log2
print(1 + int(log2(Y/X)))

Submission status: Wrong Answer

Solution code:
'''input
010
'''

def list_input():
    return list(map(int,input().split()))
def map_input():
    return map(int,input().split())
def map_string():
    return input().split()
    
s = input()
n = len(s)
l = (n-1)//2
r = n//2
ans = n//2
cur = s[l]
while l >= 0:
	if s[l] == s[r] and s[l] == cur:
		ans += 1
		l -= 1
		r += 1
	else: break
print(ans)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python
import math 
X, Y = map(int, input().split())
n = Y//X 
ans = math.log2(n)
ans = int(ans) + 1

print(ans)
#print(n)

Submission status: Wrong Answer

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

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

'''
X2^n <= Y
logX + n <= logY
'''

logX = math.log2(X)
logY = math.log2(Y)
logYX = math.log2(Y/X)

print(math.floor(logYX) + 1)

Submission status: Wrong Answer

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

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

'''
X2^n <= Y
logX + n <= logY
'''

logX = math.log2(X)
logY = math.log2(Y)

print(int(math.floor(logY - logX + 1)))

Submission status: Wrong Answer

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

import math
X, Y = map(int, raw_input().split())

'''
X2^n <= Y
logX + n <= logY
'''

logX = math.log(X, 2)
logY = math.log(Y, 2)
logY_X = math.log(Y/X, 2)

#print int(math.floor(logY - logX + 1))
ans = int(math.floor(logY_X) + 1)

if X > Y:
    print 0
else:
    print ans

Submission status: Wrong Answer

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

import math
X, Y = map(int, raw_input().split())

'''
X2^n <= Y
logX + n <= logY
'''

logX = math.log(X, 2)
logY = math.log(Y, 2)
logY_X = math.log(Y/X, 2)

#print int(math.floor(logY - logX + 1))
ans = int(math.floor(logY_X) + 1)

if ans == 1:
    print 0
else:
    print ans

Submission status: Wrong Answer

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

import math
X, Y = map(int, raw_input().split())

'''
X2^n <= Y
logX + n <= logY
'''

logX = math.log(X, 2)
logY = math.log(Y, 2)
logY_X = math.log(Y/X, 2)

#print int(math.floor(logY - logX + 1))
print int(math.floor(logY_X) + 1)

Submission status: Wrong Answer

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

import math
X, Y = map(int, raw_input().split())

'''
X2^n <= Y
logX + n <= logY
'''

logX = math.log(X, 2)
logY = math.log(Y, 2)

print int(math.floor(logY - logX + 1))

Submission status: Wrong Answer

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

import math
X, Y = map(int, raw_input().split())

'''
X2^n <= Y
logX + n <= logY
'''

logX = math.log(X, 2)
logY = math.log(Y, 2)

print int(math.ceil(logY - logX))

Submission status: Wrong Answer

Solution code:
'''input
010
'''

def list_input():
    return list(map(int,input().split()))
def map_input():
    return map(int,input().split())
def map_string():
    return input().split()
    
s = input()
n = len(s)
cnt = 0
for i in s:
	if i == '0': cnt += 1
print(cnt)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
'''input
100000000
'''

def list_input():
    return list(map(int,input().split()))
def map_input():
    return map(int,input().split())
def map_string():
    return input().split()
    
s = input()
n = len(s)
cnt = 0
for i in s:
	if i == '0': cnt += 1
print(cnt)

Submission status: Wrong Answer

Solution code:
import math

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

ans = int(math.log(y/x, 2))

print(ans + 1)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

import decimal
import math


def solve(x, y):
    decimal.getcontext().prec = 100
    r = decimal.Decimal(y // x)
    return int(math.log2(r)) + 1


def main():
    x, y = (int(z) for z in input().split())
    res = solve(x, y)
    print(res)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
def i1():
 return int(input())
def i2():
 return [int(i) for i in input().split()]
[x,y]=i2()
k=0
n=1
while y>0:
 y-=n*x
 k+=1
 n*=2
print(k)

Submission status: Wrong Answer

Solution code:
# your code goes here
import math

s = raw_input().split()
x = float(s[0])
y = float(s[1])
z = math.log(y/x, 2)
print int(z) + 1

Submission status: Wrong Answer

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

Submission status: Time Limit Exceeded

Solution code:
X, Y = map(int, input().split())
multiple = [int(i) for i in range(X, Y+1) if i % X == 0]
ans = 0

for i in range(len(multiple)):
    if multiple[i] % X == 0:
        X = multiple[i]
        ans += 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#-*-coding:utf-8-*-
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

def main():
    x,y=map(int,readline().split())
    ans=0
    while x<=y:
        x*=2
        ans+=1
    print(ans)

if __name__=="__main__":
    main()

Submission status: Accepted

Solution code:
# author:  Taichicchi
# created: 27.09.2020 23:04:41

import sys

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

cnt = 0

while x <= y:
    x *= 2
    cnt += 1

print(cnt)

Submission status: Accepted

Solution code:
# coding: utf-8


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

    print(ans)

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X,Y = list(map(int,input().split()))
#X, 2X, 4X,...,2^(t-1)*X<=Yとなる最大のt
#10^18 はだいたい2^60だから全部試せそう
for t in range(1,100):
    if 2**(t-1)*X<=Y:
        out = t
    else:
        break
print(out)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

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

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

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


if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

cnt = 0
calc = X

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

print(cnt)

Submission status: Accepted

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

    return ans


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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():
    x, y = map(int, input().split())
    cnt = 1

    while True:
        x *= 2
        if x <= y:
            cnt += 1
        else:
            break

    print(cnt)


if __name__ == "__main__":
    main()