Problem:


Score : 300 points

Problem Statement

As a token of his gratitude, Takahashi has decided to give his mother an integer sequence.
The sequence A needs to satisfy the conditions below:

A consists of integers between X and Y (inclusive).

For each 1\leq i \leq |A|-1, A_{i+1} is a multiple of A_i and strictly greater than A_i.

Find the maximum possible length of the sequence.

Constraints

1 \leq X \leq Y \leq 10^{18}

All input values are integers.

Input

Input is given from Standard Input in the following format:

X Y

Output

Print the maximum possible length of the sequence.

Sample Input 1

3 20

Sample Output 1

3

The sequence 3,6,18 satisfies the conditions.

Sample Input 2

25 100

Sample Output 2

3

Sample Input 3

314159265 358979323846264338

Sample Output 3

31



Sample input:
3 20


Sample output:
3

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() 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)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    x,y = LI()
    ans = 1
    while x*2 <= y:
        x <<= 1
        ans += 1
    print(ans)
    return

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

count = 0
while a <= b:
    count += 1
    a *= 2

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))

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

Submission status: Accepted

Solution code:
X, Y = map(int, input().split())
l = -1
r = 100
while r - l > 1:
    m = l + (r - l) // 2
    if X * 2**m > Y:
        r = m
    else:
        l = m
print(r)

Submission status: Accepted

Solution code:
from math import log
x, y = map(int, input().split())
for i in range(64):
    x *= 2
    if x > y:
        print(i + 1)
        exit()

Submission status: Accepted

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

num = X
cnt = 0
for i in range(1000):
    if(num > Y):
        break
    num = num * 2
    cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
X,Y = map(int,input().split())
y_end = Y - Y%X
count = 0

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
# int(input()) # 入力が1つ
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 = 1
x = X
while x < Y:
  if x * 2 <= Y:
    ans += 1
    x *= 2
  else: break
print(ans)

Submission status: Accepted

Solution code:
# Problem C - Multiple Gift

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

# initialization
ans = 0

# count
while X<=Y:
    X *= 2
    ans += 1

# output
print(ans)

Submission status: Accepted

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

ai = x
ai1 = 0
res = 0
while ai1 <= y:
    ai1 = ai * 2
    if ai1 % ai == 0:
        res += 1
    ai = ai1

print(res)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

def solve():
    input = sys.stdin.readline
    X, Y = map(int, input().split())
    Ans = 0
    d = 1
    while X * d <= Y:
        d *= 2
        Ans += 1
    print(Ans)

    return 0

if __name__ == "__main__":
    solve()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def resolve():

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


resolve()

Submission status: Accepted

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

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

ans = 0

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


print(ans)

Submission status: Accepted

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

    ans = 0
    tmp = x

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

    print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    X, Y = (int(i) for i in 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())
A = []
while (x <= y):
    A.append(x)
    x *= 2
print(len(A))

Submission status: Accepted

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

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

if x > y:
    ans -= 1

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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: Accepted

Solution code:
import math
x,y=map(int,input().split())
f=0
for i in range(100):
    if x*2**i==y:
        f=1
print(math.ceil(math.log2(y)-math.log2(x))+f)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
X, Y = map(int, input().split())
i = 0
while pow(2, i + 1) * X <= Y: i += 1
print(i + 1)

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
X, Y = [int(i) for i in input().split()]
N = X
c = 1
while N<=Y:
    # print(N)
    N *= 2
    if N<=Y:
        c += 1
print(c)

Submission status: Accepted

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


resolve()

Submission status: Accepted

Solution code:
from sys import stdin
def main():
    readline=stdin.readline
    X,Y=map(int,readline().split())
    a=X
    res=1
    while a*2<=Y:
        a*=2
        res+=1
    print(res)
if __name__=="__main__":
    main()

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
dx = [0, 0, 1, -1, 1, -1, -1, 1]
dy = [1, -1, 0, 0, 1, -1, 1, -1]

x, y = map(int,input().split())
ans = [x]
while ans[-1] < y:
    ans.append(ans[-1] * 2)
    #print(ans)
if ans[-1] > y:
    print(len(ans) - 1)
else:
    print(len(ans))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

x, y = map(int, input().split())
ans = 1
memo = x
for i in range(y):
    memo *= 2
    if memo > y:
        print(ans)
        exit()
    ans += 1

Submission status: Accepted

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

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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: Accepted

Solution code:
#!/usr/bin/env python3
x,y = map(int,input().split())
#１つ前より大きくて整数倍になるのでxから２倍ずつになるのが最善
ans = 1
while True:
    if x*2 <= y:
        x *= 2
        ans += 1
    else: break
print(ans)

Submission status: Accepted

Solution code:
import math
x,y=map(int,input().split())
f=0
for i in range(100):
    if x*2**i==y:
        f=1
print(math.ceil(math.log2(y)-math.log2(x))+f)

Submission status: Accepted

Solution code:
x,y=map(int,input().split())
for i in range(1,1000000):
    x*=2
    if x>y:
        print(i)
        exit()

Submission status: Accepted

Solution code:
X, Y = map(int, input().split())
ans_list = []
ans_list.append(X)
while(1):
    temp = ans_list[-1]*2
    if temp<=Y:
        ans_list.append(temp)
    else:
        break
print(len(ans_list))

Submission status: Accepted

Solution code:
# Problem C - Multiple Gift

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

# initialization
current_num = X
count = 0

# count process
while current_num<=Y:
    count += 1
    current_num *= 2

print(count)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

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

num = y//x
# ans = int(math.log2(num) + 1)
ans = len(bin(num))-bin(num).find('1')
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X, Y = map(int, input().split())
c = Y//X
tmp = 1
for i in range(100):
    if tmp > c:
        break
    tmp *= 2
print(i)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
from decimal import *
X, Y = [int(x) for x in input().split()]
X = Decimal(str(X))
Y = Decimal(str(Y))
i = 1
cnt = 0
while True:
    if i > Decimal(Y/X):
        break
    i *= 2
    cnt += 1
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from collections import deque, Counter, defaultdict
from fractions import gcd
input = sys.stdin.readline

def eprint(s):
    sys.stderr.write('DEBUG: {}\n'.format(s))
    return

def main():
    x, y = map(int, input().split())
    cnt = 1
    
    a = x
    while True:
        eprint(a)
        if a*2 > y:
            print(cnt)
            return
        else:
            a *= 2
            cnt += 1

    return

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

Solution code:
def digit(N,n):#nは正の整数、N進法での桁数、許容は１０＾１０００
    if n<N:
        return 1
    else:
        return 1+digit(N,n//N)

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

m=Y//X
print(digit(2,m))

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
number = X
while number <= Y:
    number *= 2
    ans += 1
print(ans)

Submission status: Accepted

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

con = 0

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from functools import lru_cache
import bisect


class Scanner():
    def int():
        return int(sys.stdin.readline().rstrip())

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

    def map_int():
        return [int(x) for x in Scanner.string().split()]

    def string_list(n):
        return [input() for i in range(n)]

    def int_list_list(n):
        return [Scanner.mapInt() for i in range(n)]

    def int_cols_list(n):
        return [int(input()) for i in range(n)]


class Math():
    def gcd(a, b):
        if b == 0:
            return a
        return Math.gcd(b, a % b)

    def lcm(a, b):
        return (a * b) // Math.gcd(a, b)

    def roundUp(a, b):
        return -(-a // b)

    def toUpperMultiple(a, x):
        return Math.roundUp(a, x) * x

    def toLowerMultiple(a, x):
        return (a // x) * x

    def nearPow2(n):
        if n <= 0:
            return 0
        if n & (n - 1) == 0:
            return n
        ret = 1
        while(n > 0):
            ret <<= 1
            n >>= 1
        return ret

    def isPrime(n):
        if n < 2:
            return False
        if n == 2:
            return True
        if n % 2 == 0:
            return False
        d = int(n ** 0.5) + 1
        for i in range(3, d + 1, 2):
            if n % i == 0:
                return False
        return True


MOD = int(1e09) + 7


def main():
    # sys.stdin = open("sample.txt")
    X, Y = Scanner.map_int()
    ans = 1
    while X <= Y:
        if X * 2 <= Y:
            X *= 2
            ans += 1
        else:
            break
    print(ans)
    return


if __name__ == "__main__":
    main()

Submission status: Accepted

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

c=0

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

ans = [X]
while True:
    if (ans[-1] * 2) <= Y:
        ans.append(ans[-1] * 2)
    else:
        break
print(len(ans))

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

A = [X]
while A[-1] <= Y:
    A.append(A[-1] * 2)

answer = len(A) - 1
print(answer)

Submission status: Accepted

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

A =[]
while X <= Y:
    A.append(X)
    X += X
print(len(A))

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


def solve(X: int, Y: int):
    z = X
    c = 0
    while z <= Y:
        z *= 2
        c += 1
    return c


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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

cnt = 0
s = x

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

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:
# -*- coding: utf-8 -*-
X, Y = map(int, input().split())
count = 0
a = X

while a <= Y:
    a = 2 * a
    count += 1

print(count)

Submission status: Accepted

Solution code:
x,y = map(int,input().split())
counter = 1
tmp = x
for i in range(y):
    tmp = tmp * 2
    if tmp <= y :
        counter +=1
    else:
        break
print(counter)

Submission status: Accepted

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    x, y = list(map(int, input().rstrip('\n').split()))
    t = x
    cnt = 1
    while True:
        t *= 2
        if t <= y:
            cnt += 1
        else:
            print(cnt)
            exit()


if __name__ == '__main__':
    slove()

Submission status: Accepted

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

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

print(result)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

X, Y = list(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())

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

Submission status: Accepted

Solution code:
def slove():
    import sys
    input = sys.stdin.readline
    n, m = list(map(int, input().rstrip('\n').split()))
    cnt = 1
    t = n
    while True:
        t *= 2
        if t <= m:
            cnt += 1
        else:
            print(cnt)
            exit()


if __name__ == '__main__':
    slove()

Submission status: Accepted

Solution code:
def main():
    X, Y = [int(i) for i in input().split()]
    
    ans = 1
    pre = X

    while True:
        pre *= 2
        if pre <= Y:
            ans += 1
        else:
            break
    print(ans)

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
from collections import deque
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
def solve():
  x,y = (int(i) for i in input().split())
  ans = 0
  while (x<=y):
    ans += 1
    x *= 2
  print(ans)
solve()

Submission status: Accepted

Solution code:
import itertools
x, y = [int(el) for el in input().split(' ')]

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

Submission status: Accepted

Solution code:
x, y = map(int, input().split())
if 1 <= x <= y <= 10 ** 18:
    a = x
    alist = []
    while a <= y:
        alist.append(a)
        a *= 2
    print(len(alist))
else:
    print('hoge!')

Submission status: Accepted

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

upper = Y // X

i = 0
while upper >= 2 ** i:
    i += 1

print(i)

Submission status: Accepted

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))*x <= y and y < (2**ans)*x:
  print(ans)
elif (2**(ans))*x <= y and y < (2**(ans+1))*x:
  print(ans+1)
elif (2**(ans-2))*x<=y and y < (2**(ans-1))*x:
  print(ans-1)
else:
  print("error")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,y=map(int,input().split())
ans=1
for i in range(1000):
	if x*2>y:
		print(ans)
		exit()
	else:
		ans+=1
		x*=2

Submission status: Accepted

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

Submission status: Accepted

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

A = [X]

while A[-1] <= Y:
  A.append(A[-1] * 2)
  
print(len(A)-1)

Submission status: Accepted

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

#n=int(input())
tmp = input().split()
x,y = list(map(lambda a: int(a), tmp))

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

Submission status: Accepted

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

for i in range(64):
    if X * (2 ** i) > Y:
        print(i)
        break

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

ret = 0

while X <= Y:
    ret += 1
    X *= 2

print(ret)

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

Solution code:
#from math import log2
X, Y = map(int, input().split())
#print(int(log2(Y) - log2(X)) + 1)
cnt = 0
while X <= Y:
    Y //= 2
    cnt += 1
print(cnt)

Submission status: Accepted

Solution code:
import math

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

k = (Y//X).bit_length()
print(k)

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

cnt = 0
dec = X

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

Submission status: Accepted

Solution code:
X,Y=map(int,input().split())
MOD=10**9+7

ans=1
while 1:
	X=X*2
	if X<=Y:
		ans+=1
	else:
		break
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

if X > Y:
    print(0)
    exit()
else:
    ans = 1

while True:
    X = X * 2
    if X <= Y:
        ans += 1
    else:
        break

print(ans)

Submission status: Accepted

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

#print()
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

count = 0

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

print(count)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(i)

Submission status: Accepted

Solution code:
from statistics import mean, median,variance,stdev
import numpy as np
import sys
import math
import fractions
import itertools
import copy
#以下てんぷら
def j(q):
    if q==1: print("Yes")
    elif q == 0:print("No")
    exit(0)


"""
def ct(x,y):
    if (x>y):print("+")
    elif (x<y): print("-")
    else: print("?")
"""

def ip():
    return int(input())
def printrow(a):
    for i in range(len(a)):
        print(a[i])
def combinations(n,r):
    if n<r:return 0
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
def permutations(n,r):
    if n<r:return 0
    return math.factorial(n) // math.factorial(n - r)
def lcm(x, y):
    return (x * y) // fractions.gcd(x, y)


#n = ip()                                     #入力整数1つ
n,k= (int(i) for i in input().split())       #入力整数横2つ以上
#a = [int(i) for i in input().split()]        #入力整数配列
#a = input()                                  #入力文字列
#a = input().split()                          #入力文字配列
#n = ip()                      #入力セット(整数改行あり)(1/2)
#a=[ip() for i in range(n)]    #入力セット(整数改行あり)(2/2)
#a=[input() for i in range(n)]    #入力セット(整数改行あり)(2/2)
#jの変数はしようできないので注意
#全足しにsum変数使用はsum関数使用できないので注意
s = 0
while n<=k:
    s+=1
    n*=2
print(s)

Submission status: Accepted

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

x, y = getlist()
ans = 1
while True:
	x *= 2
	if x <= y:
		ans += 1
	else:
		break

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

count = 1
result = X*2**(count-1)

while result < Y:
    count +=1
    result = X *2**(count-1)

if result> Y:
    print(count -1)
else:
    print(count)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,y=map(int,input().split())
for i in range(70):
  if x*(2**i)>y:
    print(i)
    break

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
X, Y = [int(i) for i in input().split()]
print(len(bin(Y // X)) - 2)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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


main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    x , y =f()

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

solve()