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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

#ans = int(math.log2(Y) - math.log2(X))
#print(ans+1)
while X <= Y:
  X *= 2
  cnt += 1
print(cnt)

Submission status: Accepted

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

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

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

print(ans)

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:
#from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
from fractions import gcd
from itertools import combinations,permutations,accumulate, product # (string,3) 3回
#from collections import deque
from collections import deque,defaultdict,Counter
import decimal
import re
import math
import bisect
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#
# my_round_int = lambda x:np.round((x*2 + 1)//2)
# 四捨五入g
#
# インデックス系
# int min_y = max(0, i - 2), max_y = min(h - 1, i + 2);
# int min_x = max(0, j - 2), max_x = min(w - 1, j + 2);
#
#
import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7
#mod = 9982443453
#mod = 998244353
from sys import stdin
readline = stdin.readline
def readInts():
  return list(map(int,readline().split()))
def readTuples():
    return tuple(map(int,readline().split()))
def I():
  return int(readline())
x,y = readInts()
cnt = 1
while x <= y:
    x += x
    if x <= y:
        cnt += 1
print(cnt)

Submission status: Accepted

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

if y < 2*x:
    print(1)
    exit()

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

print(ans)

Submission status: Accepted

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


X, Y = LI()
count = 1
total = X
for i in range(1000000):
    total *= 2
    if total > Y:
        break
    count += 1
print(count)

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())
pin=x
ans=1

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

Submission status: Accepted

Solution code:
X, Y = map(int, input().split())
ans = 1
for i in range(Y):
  X = X*2
  if X > Y:
    break
  else:
    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())
k = 0
while X*2**k<=Y:
    k += 1
print(k)

Submission status: Accepted

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

ans = 0
for i in range(1000):
    if x * 2**i > y:
        break
    ans = i+1

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:
import sys
input = sys.stdin.readline

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
ins = lambda: input().rstrip()
ini = lambda: int(input().rstrip())
inm = lambda: map(int, input().split())
inl = lambda: list(map(int, input().split()))
out = lambda x: print('\n'.join(map(str, x)))

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

Submission status: Accepted

Solution code:
# coding:utf-8
x, y = map(int, input().split())
ans = [x]
a = x

while a * 2 <= y:
    a = a * 2
    ans.append(a)

#print(ans, len(ans))
print(len(ans))

Submission status: Accepted

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

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

n = 0
A = 0
#初項X,公比nの数列において何項目がY以下で最大か
while Y>=A:
    n += 1
    A = (2**(n-1))*X
print(n-1)

Submission status: Accepted

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

Submission status: Accepted

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

c = 1
while True:
  X *= 2
  if X > Y:
    break
  c += 1
print(c)

Submission status: Accepted

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

for i in range(1, 101):
    if x > y:
        ans = i - 1
        break
    x *= 2

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(1, 101):
    if X > Y:
        ans = i - 1
        break
    X *= 2

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(i)

Submission status: Accepted

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

K=[X]
for i in range(1,Y//X+100):
    if X*2<=Y:
        X=X*2
        K.append(X)
    else:
        break
print(len(K))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
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())
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):
  cnt+=1
  x*=2
print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

while t!=1:
  t//=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 sys,bisect,string,math,time,functools,random,fractions
from heapq import heappush,heappop,heapify
from collections import deque,defaultdict,Counter
from itertools import permutations,combinations,groupby
rep=range;R=range
def Golf():n,*t=map(int,open(0).read().split())
def I():return int(input())
def S_():return input()
def IS():return input().split()
def LS():return [i for i in input().split()]
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 NI(n):return [int(input()) for i in range(n)]
def NI_(n):return [int(input())-1 for i in range(n)]
def StoLI():return [ord(i)-97 for i in input()]
def ItoS(n):return chr(n+97)
def LtoS(ls):return ''.join([chr(i+97) for i in ls])
def Ra():return map(int,open(0).read().split())
def GI(V,E,ls=None,Directed=False,index=1):
    org_inp=[];g=[[] for i in range(V)]
    FromStdin=True if ls==None else False
    for i in range(E):
        if FromStdin:
            inp=LI()
            org_inp.append(inp)
        else:
            inp=ls[i]
        if len(inp)==2:
            a,b=inp;c=1
        else:
            a,b,c=inp
        if index==1:a-=1;b-=1
        aa=(a,c);bb=(b,c);g[a].append(bb)
        if not Directed:g[b].append(aa)
    return g,org_inp
def GGI(h,w,search=None,replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1):
    #h,w,g,sg=GGI(h,w,search=['S','G'],replacement_of_found='.',mp_def={'#':1,'.':0},boundary=1) # sample usage
    mp=[boundary]*(w+2);found={}
    for i in R(h):
        s=input()
        for char in search:
            if char in s:
                found[char]=((i+1)*(w+2)+s.index(char)+1)
                mp_def[char]=mp_def[replacement_of_found]
        mp+=[boundary]+[mp_def[j] for j in s]+[boundary]
    mp+=[boundary]*(w+2)
    return h+2,w+2,mp,found
def TI(n):return GI(n,n-1)
def accum(ls):
    rt=[0]
    for i in ls:rt+=[rt[-1]+i]
    return rt
def bit_combination(n,base=2):
    rt=[]
    for tb in R(base**n):s=[tb//(base**bt)%base for bt in R(n)];rt+=[s]
    return rt
def gcd(x,y):
    if y==0:return x
    if x%y==0:return y
    while x%y!=0:x,y=y,x%y
    return y
def YN(x):print(['NO','YES'][x])
def Yn(x):print(['No','Yes'][x])
def show(*inp,end='\n'):
    if show_flg:print(*inp,end=end)

mo=10**9+7
inf=float('inf')
FourNb=[(-1,0),(1,0),(0,1),(0,-1)];EightNb=[(-1,0),(1,0),(0,1),(0,-1),(1,1),(-1,-1),(1,-1),(-1,1)];compas=dict(zip('WENS',FourNb));cursol=dict(zip('LRUD',FourNb))
l_alp=string.ascii_lowercase
sys.setrecursionlimit(10**9)
read=sys.stdin.buffer.read;readline=sys.stdin.buffer.readline;input=lambda:sys.stdin.readline().rstrip()

########################################################################################################################################################################

show_flg=False
show_flg=True

ans=0

x,y=LI()

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

while tmp <= y:
    a.append(tmp)
    tmp *= 2

print(len(a))

Submission status: Accepted

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

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# AtCoder Regular Contest 088
# C - Multiple Gift

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 = 1
now = x

while True:
    now *= 2
    if now > y:
        break
    ans += 1

print(ans)

Submission status: Accepted

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

ans = 0
a0 = x
while(a0<=y):
    ans += 1
    a0 = a0 * 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
 
def main():
    x, y = map(int, readline().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())
i = 1
while x *(2 ** i) <= y:
    i += 1

print(i)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x, y = map(int, input().split())
ans = 1 ; num = x
while True :
    if num * 2 <= y :
        ans += 1
        num *= 2
    else :
        break
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())
l = []
ans = 1

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

ans = len(l)
if X == Y:
    ans = 1
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
x, y = map(int, input().split())
print(len(bin(y // x)) - 2)

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 sys

input = sys.stdin.readline

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

X, Y = map(int, input().split())
a = X
ans = 0
for i in itertools.count(1):
    if a <= Y:
        ans += 1
        a = a*2
    else:
        break
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(a)

Submission status: 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:
def solve():
    X, Y = map(int, input().split())
    count = 0
    while X <= Y:
        count += 1
        X *= 2;
    print(count)
if __name__ == "__main__":
    solve()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

count = 1
while True:
    num = X * (2 ** (count - 1))
    if num > Y:
        print(count - 1)
        break
    count += 1

Submission status: Accepted

Solution code:
X,Y=map(int,input().split())
cnt=1
tmp=[X]
while True:
  if tmp[-1]*2<=Y:
    tmp.append(tmp[-1]*2)
    cnt+=1
  else:
    break
print(cnt)

Submission status: Accepted

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

from math import log2

x,y = readInts()

kouho = int(log2(y)-log2(x)+1)-1

ans = kouho-1

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

Submission status: Accepted

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

from math import log2

x,y = readInts()
ans = 0

i = 1
while 1:
	if x*2**(i-1)<=y:
		ans+=1
		i+=1
	else:
		print(ans)
		break

Submission status: Accepted

Solution code:
X, Y = map(int, input().split())
v = X
Ans = 0
while v <= Y:
    Ans += 1
    v *= 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:
#!/usr/bin/env python
# coding: utf-8

# In[10]:


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


# In[12]:


mylist = []
for i in range(Y//X):
    tmp = X*(2**i)
    if tmp <= Y:
        mylist.append(tmp)
    else:
        break
print(len(mylist))


# In[ ]:

Submission status: Accepted

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


resolve()

Submission status: Accepted

Solution code:
import sys
import math
import itertools as it
def I():return int(sys.stdin.readline().replace("\n",""))
def I2():return map(int,sys.stdin.readline().replace("\n","").split())
def S():return str(sys.stdin.readline().replace("\n",""))
def L():return list(sys.stdin.readline().replace("\n",""))
def Intl():return [int(k) for k in sys.stdin.readline().replace("\n","").split()]
def Lx(k):return list(map(lambda x:int(x)*-k,sys.stdin.readline().replace("\n","").split()))

if __name__ == "__main__":
    x, y = I2()
    cnt = 0
    while x <= y:
        x *= 2
        cnt += 1
    print(cnt)

Submission status: Accepted

Solution code:
X, Y = map(int, input().split())
twoLine = [2 ** (i) for i in range(61)]
for i in range(len(twoLine)):
    if X * twoLine[i] > Y:
        print(i)
        exit()

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

Submission status: Accepted

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

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

if x == y:
    ans += 1

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(n)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(cnt)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#from statistics import median
#import collections
#aa = collections.Counter(a) # list to list || .most_common(2)で最大の2個とりだせるお a[0][0]
#from fractions import gcd
#from itertools import combinations # (string,3) 3回
#from collections import deque
from collections import defaultdict
#import bisect
#
#    d = m - k[i] - k[j]
#    if kk[bisect.bisect_right(kk,d) - 1] == d:
#
#
#
# pythonで無理なときは、pypyでやると正解するかも！！
#
#

import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7
#mod = 9982443453
def readInts():
  return list(map(int,input().split()))
def I():
  return int(input())
x,y = readInts()
cnt = 0
while x <= y:
    cnt += 1
    x += x
print(cnt)

Submission status: Accepted

Solution code:
import sys

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

    return 0

if __name__ == "__main__":
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

left = 1
right = 100
while left+1 < right:
    mid = (left+right)//2
    if x*(2**(mid-1)) <= y:
        left = mid
    else:
        right = mid
print(left)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

# A[i+1] = 2 * A[i] と構成すればよさげ
# このとき A[0] = X とすれば A[n] = X * pow(2, n-1)

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

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip()
 
x, y = map(int, input().split())

cnt = 1

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

a = [X]

for i in range(10000000):
    if a[-1]*2 <= Y:
        a.append(a[-1]*2)
    else:
        break

print(len(a))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = X
count = 0

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

Submission status: Accepted

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

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

print(n)

Submission status: Accepted

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

Submission status: Accepted

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


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


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


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


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


x, y = invr()
count = 0
while x <= y:
    x *= 2
    count += 1
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import itertools
#n=int(input())
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())
i = 0
while x <= y:
    x = x * 2
    i += 1
print(i)

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

input = sys.stdin.readline


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

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

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**6)

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

i=0
z=x
while z<=y:
    z*=2
    i+=1

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:
import math
X, Y = map(int, input().split())
c = math.log2(Y // X)
if 2 ** int(c) <= Y // X:
  print(int(c) + 1)
else:
  print(int(c))

Submission status: Accepted

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

Submission status: Accepted

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

ans = 1
while x<y:
    x*=2
    ans+=1
    if x>y:
        ans-=1
        break
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())
#AはX以上Y以下の整数からなるリスト
l=[X]
while l[-1]*2<=Y:
    l.append(l[-1]*2)
    
#print(l)
print(len(l))

Submission status: Accepted

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

while True:
  X *= 2
  if X > Y:
    print(ans)
    exit()
  ans += 1

Submission status: Accepted

Solution code:
x,y = map(int,input().split())
cnt = 1
for i in range(x,y+1):
    x = x*2
    if x > y:
        break
    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())
count = 1
while True:
    if 2*x <= y:
        count+=1
        x*=2
    else:
        break
print(count)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,y=[int(_) for _ in 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(y>=x*2):
    x = x*2
    ans+=1
print(ans)

Submission status: Accepted

Solution code:
x,y=map(int,input().split())
a=y-x
c=0
b=0
for i in range(1000):
    b=x*2**i
    if b>y:
        break
    else:
        c+=1  
print(c)

Submission status: Accepted

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

n = a[0]
count = 0

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

Submission status: Accepted

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

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

print(num)