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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

Solution code:

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


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


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


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


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


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


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


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


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


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


# show_flg = False
show_flg = True


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

    print(-1)

    return

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

    print(ans)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:

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


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


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


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


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


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


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


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


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


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


# show_flg = False
show_flg = True


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

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

    print(ans)



if __name__ == '__main__':
    main()

Submission status: Accepted

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

for i in range(1,1000):
    if (x*2**i > y):
        print(i)
        exit()

Submission status: Accepted

Solution code:
X,Y = (int(_) for _ in input().split())  
def cal_num(x,y,cnt):
    if x*2 <= y:
        cnt += 1
        return(cal_num(x*2,y,cnt))
    else:
        return(cnt)
print(cal_num(X,Y,1))

Submission status: Accepted

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

Submission status: Accepted

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

a = x
ans = 0

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

print(ans)

Submission status: Accepted

Solution code:
import sys

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

def main():
    a = x
    cnt = 0
    while a <= y:
        cnt += 1
        a *= 2
    return cnt

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

Submission status: Accepted

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

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

def solve():
  num = x
  ans = 0

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

def main():
  solve()

if __name__ == "__main__":
  main()

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())
x=X
ans=0
while True:
    if x>Y:
        break
    else:
        x*=2
        ans+=1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
X, Y = map(int, input().split())
cnt = 0
while True:
    if X < Y:
        cnt += 1
        X *= 2
    else:
        if X == Y:
            cnt += 1
        break
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())

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

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:
    x *= 2
    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:
#083C
import sys
x, y = map(int, sys.stdin.readline().split())
cnt =0
while True:
    if x <=y:
        cnt +=1
        x = x*2
    else:
        break

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

A = [X]

for i in range(0,10**8):
    Z = 2*A[i]
    if Z <= Y:
        A.append(Z)
        #print(A)
    else:
        break
print(len(A))

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

check = 0
count = 0

while check == 0:
    count += 1
    x = x * 2
    if x > y:
        check = 1

print(count)

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

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

gift = [X]
now = X
while (True):
    new = 2 * now
    if new <= Y:
        gift.append(new)
        now = new
    else:
        break

print(len(gift))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
X,Y=map(int,input().split())
answer=len(str(bin(Y//X)))-2
print(answer)

Submission status: Accepted

Solution code:
def main():
    x,y=map(int,input().split())
    y //= x
    res = 1
    while y >= 2 :
        y //= 2
        res += 1
    return res

print(main())

Submission status: Accepted

Solution code:
def main():
    x,y=map(int,input().split())
    if y // x < 2:
        return 1
    y //= x
    res = 2
    while y >= 4 :
        y //= 2
        res += 1
    return res

print(main())

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
from collections import deque
def getN():
    return int(input())
def getList():
    return list(map(int, input().split()))
import math
import bisect
from logging import getLogger, StreamHandler, DEBUG, WARNING
logger = getLogger(__name__)
handler = StreamHandler()
handler.setLevel(DEBUG)
logger.setLevel(DEBUG)
# handler.setLevel(WARNING)
# logger.setLevel(WARNING)
logger.addHandler(handler)
def main():
    x, y = getList()
    ans = 0
    while(True):
        if x <= y:
            ans += 1
            x *= 2
        else:
            break

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

Submission status: Accepted

Solution code:
x,y=map(int,input().split())
ans_li=[]
for i in range(1000):
    if x*(2**i)<=y:
        ans_li.append(i+1)
print(max(ans_li))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC083C
# 方針：Xを2倍していく時最大の数となる
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())

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

print(cnt)

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

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

ans = 0
while True:
    if x <= y:
        ans += 1
    else:
        print(ans)
        import sys
        sys.exit()
    x = x * 2

Submission status: Accepted

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

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:
import sys

if sys.platform =='ios':
	sys.stdin=open('Untitled.txt')
input = sys.stdin.readline
def MAP(): return [int(s) for s in input().split()]

X,Y= MAP()
n=X
cnt=1
while True:
	if n*2 <= Y:
		n *= 2
		cnt += 1
	else:
		break

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

while b >= a:
  a*=2
  ans+=1

print(ans)

Submission status: Accepted

Solution code:
def main():

    X, Y = map(int, input().split())
    p = X
    ans = 1
    while 2*p <= Y:
        p *= 2
        ans += 1
    return ans

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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
a = X

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
    x,y=map(int,input().split())
    ans=0
    while(y>=x):
        ans+=1
        x*=2
    print(ans)
resolve()

Submission status: Accepted

Solution code:
from sys import stdin

a,b = [int(x) for x in stdin.readline().rstrip().split()]

num = a
point = 0

while num <= b:
    num *= 2
    point += 1

print(point)

Submission status: Accepted

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

ans = 1
for i in range(1,1000000000):
    if X*(2**i)<=Y:
        ans += 1
    else:
        break
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import heapq as h
import math
import numpy as np
import copy
import itertools

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

Submission status: Accepted

Solution code:
def examC():
    X, Y = LI()
    ans = (Y//X).bit_length()
    print(ans)

import sys,copy,bisect,itertools,heapq,math
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examC()

Submission status: Accepted

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

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())
c=0
while x<=y:
    x*=2
    c+=1
print(c)

Submission status: Accepted

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

x,y = inpl()
res = 0
while x*2**res <= y:
    res += 1
print(res)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, math
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans=count=0

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, math
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans=count=0

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

Submission status: Accepted

Solution code:
import sys
import math

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

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

print(count)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(count)

Submission status: Accepted

Solution code:
#ARC088C - Multiple Gift
X, Y = list(map(int,input().split()))
p = X
count = 0
while p <= Y:
    p *= 2
    count += 1
print(count)

Submission status: Accepted

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

p = X
cnt = 0
while p <= Y:
    p *= 2
    cnt += 1

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

cnt=1
current=x

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import deque
X, Y = [int(x) for x in input().split()]
ai = X
i = 0
while ai <= Y:
  ai *= 2
  i += 1
print(i)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num_min, num_max = map(int, input().split())

def search(mult, ans):
    if mult*2 <= num_max:
        ans += 1
        search(mult*2, ans)
    else:
        print(ans)

search(num_min, 1)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,y = map(int, input().split())
a = []
i = 0
while True:
    b = 2**i
    if b*x <=y:
        i+=1
    else:
        break
print(i)

Submission status: Accepted

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

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())
line = []
line.append(x)
tmp = x
while(tmp * 2 <= y):
    line.append(tmp * 2)
    tmp *= 2
print(len(line))

Submission status: Accepted

Solution code:

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

    tmp = X
    cnt = 1

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


    print(cnt)
    



if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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


print(res)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B=map(int,input().split())
ans=0
tmp=A
while tmp<=B:
  tmp*=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())
cnt = 0

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

print(cnt)

Submission status: Accepted

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

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

Submission status: Accepted

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

flg = 0
cnt = 0
while flg == 0:
	x *= 2
	cnt += 1
	if(x > y):
		flg = 1
print (cnt)

Submission status: Accepted

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

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

print(len(bin(Y // X)[2:]))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ARC088C - Multiple Gift
X, Y = list(map(int,input().split()))
a = X
count = 0
while Y >= a:
    a = a*2
    count += 1
print(count)

Submission status: Accepted

Solution code:
from math import log
X, Y = map(int, input().split())
a=0
while X<=Y:
    X*=2
    a+=1
print(a)

Submission status: Accepted

Solution code:
#!/usr/bin/python3

import sys
# input = sys.stdin.readline
sys.setrecursionlimit(100000)
INF = float('inf')
MOD = 10**9+7
EPS = 10**-7

#N = int(input())
#A = [int(x) for x in input().split()]
#V = [[0] * 100 for _ in range(100)]

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

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

print(ans)

Submission status: Accepted

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


def solve(X: int, Y: int):
    n=0
    while Y >= X*2**n:
        n+=1
    print(n)

    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    X = int(next(tokens))  # type: int
    Y = int(next(tokens))  # type: int
    solve(X, Y)

if __name__ == '__main__':
    main()

Submission status: 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:
def input():
    import sys
    return sys.stdin.readline().rstrip()


def main():
    import math
    import collections
    import itertools

    x, y = map(int, input().split())
    check = y // x
    n = 0
    while 2 ** n <= check:
        n += 1
    print(n)
    # print(int(math.log2(y / x)) + 1)




if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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())
a=0
while x<=y:
    x*=2
    a+=1
print(a)

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

n = X
res = 0
while n <= Y:
  res += 1
  n *= 2

print(res)

Submission status: Accepted

Solution code:
x,y = list(map(int,input().split()))
n =[]
while x<=y:
  n.append(x)
  x*=2
print(len(n))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# 貪欲法で解く
X, Y = map(int, input().split()) # X, Yの入力
A = [X] # Aをlistで管理、ひとまずXは入るので入れておく
while A[-1] * 2 <= Y: # A_{i+1} = 2A_iとするのが最善、これをYを超えない範囲で順に追加していく
    A.append(A[-1] * 2)
print(len(A)) # Aの長さ、すなわち解答の出力

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,y = [int(_) for _ in input().split()]
c = 0
t = x
while t <= y:
    c += 1
    t = t * 2
print(c)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

val = x
counter = 1

while val * 2 <= y:
    val = val * 2
    counter += 1

print(counter)

Submission status: Accepted

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

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

Submission status: Accepted

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

n = 0

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

print(n)

Submission status: Accepted

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

Submission status: Accepted

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

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())
print(len(bin(Y//X))-2)

Submission status: Accepted

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

def main(X,Y):
    count = 1
    num = X
    while(num*2<=Y):
        num *= 2
        count += 1
    print(count)

if __name__ == '__main__':
    X,Y = map(int, input().split())
    main(X,Y)

Submission status: Accepted

Solution code:
def cc083():
    import sys
    x,y = list(map(int, input().split()))

    if x == y:
        print(1)
        sys.exit()

    m = x
    d = 1
    while True:
        m *= 2
        if m > y:
            print(d)
            sys.exit()
        d += 1

cc083()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

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

count = 0
tmp = x
while True:
    if tmp > y:
        print(count)
        break
    tmp *= 2
    count += 1

Submission status: Accepted

Solution code:
import math
a,b = [list(map(int, s.split())) for s in open(0)][0]
ans = 0
while a <= b:
    a *= 2
    ans += 1
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

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

# print(math.floor(math.log2(y/x))+1)
ans = 0
while (x <= y):
    ans += 1
    x *= 2
print(ans)