Problem:


Score: 200 points

Problem Statement

M-kun has the following three cards:

A red card with the integer A.

A green card with the integer B.

A blue card with the integer C.

He is a genius magician who can do the following operation at most K times:

Choose one of the three cards and multiply the written integer by 2.

His magic is successful if both of the following conditions are satisfied after the operations:

The integer on the green card is strictly greater than the integer on the red card.

The integer on the blue card is strictly greater than the integer on the green card.

Determine whether the magic can be successful.

Constraints

1 \leq A, B, C \leq 7

1 \leq K \leq 7

All values in input are integers.

Input

Input is given from Standard Input in the following format:

A B C
K

Output

If the magic can be successful, print Yes; otherwise, print No.

Sample Input 1

7 2 5
3

Sample Output 1

Yes

The magic will be successful if, for example, he does the following operations:

First, choose the blue card. The integers on the red, green, and blue cards are now 7, 2, and 10, respectively.

Second, choose the green card. The integers on the red, green, and blue cards are now 7, 4, and 10, respectively.

Third, choose the green card. The integers on the red, green, and blue cards are now 7, 8, and 10, respectively.

Sample Input 2

7 4 2
3

Sample Output 2

No

He has no way to succeed in the magic with at most three operations.



Sample input:
7 2 5
3


Sample output:
Yes

Submission status: Wrong Answer

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

K = int(input())

k = 0

while(k < K):
    if (A > B):
        B *= 2
        k += 1

        # print('A, B -> ', A, B)
    
    if (B > C):
        C *= 2
        k += 1
        # print('B, C -> ', B, C)



if (C > B) and (B > A):
    print('yes')
else:
    print('no')

Submission status: Wrong Answer

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

k = int(input())

for i in range(k):
    if a < b and b < c:
        print('Yes')
        exit
    elif a > b:
        b = 2 * b
    elif b > c:
        c = 2 * c
    # print(a, b, c)

if a < b and b < c:
    print('Yes')
    exit()

print('No')

Submission status: Wrong Answer

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

for _ in range(K):
    if A > B:
        B = B * 2
    elif B > C:
        C = C * 2
if A < B and B < C:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
A_list = list(map(int, input().split()))
K = int(input())
sort_ = sorted(A_list)
if(A_list == sort_):
  print("Yes")
  
  
for i in range(K):
  if(A_list[0]>=A_list[1]):
    A_list[1] = A_list[1]*2
  elif(A_list[1]>=A_list[2]):
    A_list[2] = A_list[2]*2
  else:
    exit()
  #print(A_list)
    
    
sort_ = sorted(A_list)
set_ = list(set(A_list))
if(A_list != set_):
  print("No")
elif(A_list == sort_):
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
from sys import exit
import math
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

a,b,c = mi()
k=ii()

for i in range(k):
    if b < a:
        b*=2
    elif c < b:
        c *= 2

    if(a < b and b < c):
        print("Yes")
        exit()
print("No")

Submission status: Wrong Answer

Solution code:
R,G,B=map(int,input().split())
K = int(input())
i = 1
if not(R<G and G<B):
    while i <= K:
        if R>G:
            G = G*2
            i+=1
        if G>B:
            B = B*2
            i+=1
if R<G and G<B:
    print("Yes")
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import sys

def check(r,g,b):
    return r<g and g<b

r,g,b=input().split()
r,g,b=int(r),int(g),int(b)

K=int(input())

for i in range(K):
    for j in range(K):
        for k in range(K):
            if check(r*2**(i+1),g*2**(j+1),b*2**(k+1)):
                print("True")
                sys.exit(0)
print("False")

Submission status: Wrong Answer

Solution code:
a = input().split(" ")
b = int(a[1])
c = int(a[2])
a = int(a[0])
k = int(input())
check=0
while True:
  if check == k:
    print("True")
    break;
  else:
    if int(c) - int(b) > int(b) - int(a):
      b += 1
      check += 1
    elif int(c) - int(b) < int(b) - int(a):
      a += 1
      check += 1
    else:
      print("False")
      break;

Submission status: Wrong Answer

Solution code:
A,B,C = map(int,input().split())
K = int(input())
num = 0
for i in range(K):
    if A>=B:
        B *= 2
    else:
        num = i
for j in range(K-num):
    C *= 2
if A<B<C:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a = list(map(int,input().split()))
k = int(input())
#青＞緑＞赤
r,g,b = 0,0,0
for i,num in enumerate(a):
    if i==0:
        r = num
    elif i==1:
        g = num
    elif i==2:
        b = num

for i in range(k):
    if b>g:
        b *= 2
    elif g>r:
        g *= 2
    elif r*2<g:
        r*=2

if b>g and g>r:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
A, B, C = map(int, input().split())
K = int(input())
flag = 0

for i in range(K):
  if A > B:
    B = B*2
  elif B > C:
    C = C*2
    if B < C:
      print("Yes")
      break      
  else:
    print("Yes")
    break
  flag += 1

if K == flag:
  print("No")

Submission status: Wrong Answer

Solution code:
li = input().split()
a=int(input())
magic = 0
for i in range(0,4):
    if li[0] >= li[1]:
        li[1] = li[1] * 2
        magic = magic + 1

for i in range(0,4):
    if li[1] >= li[2]:
        li[2] = li[2] * 2
        magic = magic + 1
        
if a > magic:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
k=int(input())
for i in range(k):
    if b<a:
        b=b*2
    else:
        c=c*2

if c>b and b>a:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import random as rng
import itertools as it
import collections as col
import heapq as hq
import sys
import copy as cp
sys.setrecursionlimit(10**9)


def dump_impl(*objects):
    print(*objects, file=sys.stderr)


def dump_dummy(*objects):
    pass


dump = dump_impl if "DEBUG" in sys.argv else dump_dummy


def odd(n): return n & 1


def even(n): return not odd(n)


A, B, C = map(int, input().split())
K = int(input())
for i in range(K):
    for j in range(K):
        for k in range(K):
            if i+j+k > K:
                continue
            a = A*pow(2, i)
            b = B*pow(2, j)
            c = C*pow(2, k)
            if a < b and b < c:
                print("Yes")
                exit(0)
print("No")

Submission status: Wrong Answer

Solution code:
R, G, B = map(int, input().split())
K = int(input())

for i in range(K + 1):
  g = G * i * 2
  b = B * (K - i) * 2
  r = R
  if b > g > r:
    print('Yes')
    exit()
    
print('NO')

Submission status: Wrong Answer

Solution code:
import sys
#import string
#from collections import defaultdict, deque, Counter
#import bisect
#import heapq
#import math
#from itertools import accumulate
#from itertools import permutations as perm
#from itertools import combinations as comb
#from itertools import combinations_with_replacement as combr
#from fractions import gcd
#import numpy as np

stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
MIN = -10 ** 9
MOD = 10 ** 9 + 7
INF = float("inf")
IINF = 10 ** 18

def solve():
    A, B, C = map(int, stdin.readline().rstrip().split())
    k = int(stdin.readline().rstrip())
    for i in range(k):
        if C > B > A:
            print("Yes")
            exit()
        elif B > C or A > C:
            C = C*2
        elif A > B:
            B = B*2
    if C > B >A:
        print("Yes")
    else:
        print("No")

if __name__ == '__main__':
    solve()

Submission status: Wrong Answer

Solution code:
A, B, C = input().split()
A = int(A)
B = int(B)
C = int(C)
K = input()
K = int(K)
z = 0
while B > A:
    B = B * 2
    z = z + 1
while C > B:
    C = C * 2
    z = z + 1
if K < z:
    print('NO')
else:
    print('YES')

Submission status: Wrong Answer

Solution code:
A,B,C = [int(x) for x in input().split()]
K = int(input())

while(K > 0 and A > B):
    K-=1
    B = B*2


while(K > 0 and B > C):
    K-=1
    C *= 2

if( A < B and B < C):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
# coding: utf-8
import math
import numpy
#N = int(input())
a, b, c = map(int,input().split())
#A = list(map(int,input().split()))
K =int(input())
flg = False
i = 0
while a >= b:
    b *= 2
    i += 1
    if i == K:
        break
while b >= c:
    c *= 2
    i += 1
    if i == K:
        break
if a < b < c:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

for i in range(k):
    if a > b:
        b = 2 * b
        continue
    if b > c:
        c = 2 * c
        continue
if a < b and b < c:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
a,b,c = map(lambda x: int(x), input().split())
k = int(input())

for _ in range(k):
    if b < a:
        b = 2 * b
        continue
    if c < b:
        c = 2 * c
        continue
    print('Yes')
print('No')

Submission status: Wrong Answer

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

def check(nums):
    if nums[0] < nums[1]:
        if nums[1] < nums[2]:
            print('yes')
            exit(0)

check(l)
for i in range(K):
    if l[0] > l[1]:
        l[1] *= 2
        check(l)
        continue
    elif l[1] > l[2]:
        l[2] *= 2
        check(l)
        continue

print('no')

exit(0)

Submission status: Wrong Answer

Solution code:
r, g, b =map(int,input().split())
k = int(input())

for i in range(k):
    if r > g:
        g *= 2
    elif g > b:
        b *= 2
    
if r < g < b:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a = list(map(int,input().split()))
k = int(input())
#青＞緑＞赤
r,g,b = 0,0,0
for i,num in enumerate(a):
    if i==0:
        r = num
    elif i==1:
        g = num
    elif i==2:
        b = num

for i in range(k):
    if b*2>g:
        b *= 2
    elif g*2>r:
        g *= 2
    elif r*2<g:
        r*=2

if b>g and g>r:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

k = n

while a >= b and k >= 1:
    b = 2*b
    k -= 1
    if a >= b and k == 0 :
        print('No')

while a < b and b >= c and k >= 1:
    c = 2*c
    k -= 1
    if b >= c and k == 0:
        print('No')
    if b < c and k>=0:
        print('Yes')

Submission status: Wrong Answer

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

for i in range(K):
    tmp = min(B,C)
    if(B==tmp):
        B *= 2
    else:
        C *= 2
    # print(A,B,C)
if A< B and B<C:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
from sys import stdin

def main():
    a, b, c = [int(x) for x in stdin.readline().rstrip().split()]
    k = int(input())

    n = 0
    bb = b
    while bb < a:
        bb = bb * 2
        n += 1
    
    if n > k:
        print("No")
        return

    m = k - n

    cc = c
    for i in range(m):
        cc = cc * 2

    if cc > bb:
        print("Yes")
    else:
        print("No")
    
    

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

r = ABC[0]
b = ABC[1]
g = ABC[2]

for i in range(K):
    if (r < b and b < g):
        print("Yes")
        exit()
    elif (r > b):
        b *= 2
    elif (b > g):
        g *= 2

if (r < b and b < g):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a,b,c,k=map(int,open(0).read().split())
import sys
count=0
while b<a:
    b*=2
    count+=1
    if count>k:
        print('No')
        sys.exit()
while c<b:
    c*=2
    count+=1
    if count>k:
        print('No')
        sys.exit()
print('Yes')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
k=int(input())
d={"a":a,"b":b,"c":c}
for i in range(k+1):
    if d["a"]<d["b"]<d["c"]:
        print("Yes")
        exit()
    elif d["a"]>d["b"]:
        d["b"]*=2
    elif d["a"]>d["c"]:
        d["c"]*=2
    elif d["b"]>d["c"]:
        d["c"]*=2
print("No")

Submission status: Wrong Answer

Solution code:
import sys

input = sys.stdin.readline

def main():
    ans = 'No'
    a,b,c = map(int, input().split())
    k=int(input())
    for _ in range(3):
        if a>=b:
            b*=2
        elif b>=c:
            c*=2
    if a<b<c:
        ans='Yes'

    print(ans)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

score = 0
for bx2 in range(k+1):
    cx2 = k-bx2
    
    if a < b*2**bx2 < c*2**cx2:
        print("Yes")
        print(bx2, cx2)
        score = 1
        break
        
if score == 0:
    print("No")

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
k=int(input())
cnt=0
while not a<b:
  cnt+=1
  b*=2  
while not b<c:
  cnt+=1
  c*=2  
print('yes' if k>=cnt else 'no')

Submission status: Wrong Answer

Solution code:
li = input().split()
a=int(input())
magic = 0
for i in range(0,8):
    if li[0] >= li[1]:
        li[1] = li[1] * 2
        magic = magic + 1

for i in range(0,8):
    if li[1] >= li[2]:
        li[2] = li[2] * 2
        magic = magic + 1
        
if a >= magic:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
A,B,C = map(int,input().split())
K = int(input())
if A<B<C:
  print("Yes")
for i in range(K):
  if A > B:
    B = B*2
  else:
    C = C*2
  if A<B<C:
    print("Yes")
    exit()
print("No")

Submission status: Wrong Answer

Solution code:
import sys
import math
from collections import deque
a,b,c=map(int,input().split())
k=int(input())
i=0
while b<=a:
    b*=2
    i+=1
    if i>k:
        print('No')
        sys.exit()
while c<=b:
    c*=2
    i==1
    if i>k:
        print('No')
        sys.exit()
if i<=k:
    print('Yes')

Submission status: Wrong Answer

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

for _ in range(K):
    if B < A:
        B = B * 2
    elif C < B:
        C = C * 2

if A < B and B < C:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
A,B,C = map(int,input().split())
K = int(input())
num = 0
for i in range(K):
    if A>B:
        B *= 2
    else:
        num = i
for j in range(K-num):
    C *= 2
if A<B<C:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
def main():
    a,b,c=map(int,input().split())
    k=int(input())
    cnt=0
    while cnt < k:
        cnt+=1
        if a > b: b*=2
        elif b > c: c*=2
        else: 
            break
    if a < b and b < c: print('Yes')
    else: print('No')
    return

if __name__=='__main__':
    main()

Submission status: Wrong Answer

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

for i in range(K):
    if (A > B):
        B = B * 2
    elif (B > C):
        C = C * 2

    if (A < B and B < C):
        print("Yes")
        exit(0)

print("No")

Submission status: Wrong Answer

Solution code:
a,b,c = map(int,input().split())
k = int(input())
count = 0
for i in range(k):
    if b < a:
        b *= 2
        count += 1
    elif a < b and c < b:
        c *= 2
        count += 1
    if count == k:
        break

if a < b and b < c:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
K=int(input())
if a>=b:
  for i in range(3):
    b=b*2
    if b>a:
      A=i+1
      break
else:
  A=0
n=0
if b>=c:
  for j in range(3):
    c=c*2
    if c<=b:
      n+=1
    else:
      break
else:
  n=0
if A+n<=K:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
a,b,c = [int(num) for num in input().split()]
k = int(input())

operation = 0

while operation < k and b < a:
    b *= 2
    operation += 1

while operation < k and c < b:
    c *= 2
    operation += 1

if a < b < c:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
A,B,C=map(int,input().split())
K=int(input())
flag=True
for i in range(K):
    if A>B:
        B*=2
        continue
    if B>C:
        C*=2
        continue
    if C>B and B>A:
        flag=False
        break
if C>B and B>A:
    flag=False
print('Yes' if flag==False else "No")

Submission status: Wrong Answer

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

for num in range(K):
  if (A >= B):
    B = 2*B
  elif B >= C:
    C = 2*C
  elif A >= C:
    C = 2*C
  else:
    A = A *2

if A<B and B < C and A < C:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

cnt = 0
while B <= A:
    cnt += 1
    B *= 2
while C <= B:
    cnt += 1
    C *= 2
print(cnt)
if cnt <= K:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a,b,c=map(int, input().split())
k=int(input())
for i in range(k):
    if a*2<b:
        a*=2
    elif b*2<c:
        b*=2
    elif c*2>b:
        c*=2
    else:
        print('No')
        exit()

print('Yes')

Submission status: Wrong Answer

Solution code:
import sys
import math
from collections import deque
a,b,c=map(int,input().split())
k=int(input())
i=0
while b<=a:
    b*=2
    i+=1
    if i>k:
        print('No')
        sys.exit()
while c<+b:
    c*=2
    i==1
    if i>k:
        print('No')
        sys.exit()
if i<=k:
    print('Yes')

Submission status: Wrong Answer

Solution code:
#B
a, b, c = map(int, input().split())
K=int(input())
for i in range(K):
    if a>c:
        c=2*c
    elif a>b:
        b=2*b
    elif b>c:
        c=2*c
    else:
        c=2*c
if a<b and b<c:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
A,B,C = map(int,input().split())
K = int(input())
import math

x = math.ceil(math.log2(A/B))
if x < 0:
    x = 0
    
y = math.ceil(math.log2((B*(2**x))/C))



if y < 0:
    y = 0

if 2*x + y <= K:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
A, B, C = map(int, input().split())
K = int(input())
import math
x = math.ceil(math.log2(A / B))
y = math.ceil(math.log2(B * 2 ** x / C))
if x + y <= K:
    ans = 'Yes'
else:
    ans = 'No'
print(ans)

Submission status: Wrong Answer

Solution code:
A,B,C = map(int,input().split())
K = int(input())
for i in range(K):
    for j in range(K-i):
        for k in range(K-i-j):
            if A*(2**i)<B*(2**j) and B*(2**j)<C*(2**k):
                print('Yes')
                exit()

print('No')

Submission status: Wrong Answer

Solution code:
import sys
from math import ceil, floor, sqrt, sin, cos, pi
from itertools import accumulate, permutations, combinations
from fractions import gcd # 最大公約数
from collections import deque, Counter
from operator import itemgetter
from heapq import heappop,heappush
sys.setrecursionlimit(10**7)
def lcm(x, y): return ((x * y) // gcd(x, y)) # 最小公倍数
# list(map(int, input().split()))

a, b, c = map(int, input().split())
k = int(input())

for _ in range(k):
    if a > b:
        b *= 2
    else:
        c *= 2

if a < b < c:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

def isMoreK(c):
  return c > K

count = 0
while A >= B:
  B *= 2
  count += 1
  while B >= C:
    C *= 2
    count += 1

if isMoreK(count):
  print('No')
else:
  print('Yes')

Submission status: Wrong Answer

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

num_a = 0
for i in range(8):
    if a > b:
        num_a += 1
        b *= 2
    else:
        break

num_b = 0
for i in range(8):
    if b > c:
        num_b += 1
        c *= 2
    else:
        break
if num_a + num_b <= k:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

for i in range(K):
    for j in range(K):
        for k in range(K):
            if i+j+k != K:
                continue
            a = A*pow(2,i)
            b = B*pow(2,j)
            c = C*pow(2,k)
            if a < b and b < c:
                print("Yes")
                exit()
print("No")

Submission status: Wrong Answer

Solution code:
import os
import sys
from io import BytesIO, IOBase
# from collections import defaultdict as dd
# from collections import deque as dq
# import itertools as it
# from math import sqrt, log, log2
# from fractions import Fraction

def main():
    t = 1
    for _ in range(t):
        # n = int(input)
        r, g, b = map(int, input().split())
        k = int(input())
        #nums = list(map(int, input().split()))

        # b>g>r
        if b>g>r:
            print('Yes')
        elif g>r:
            while b <= g and k:
                b <<= 1
                k -= 1
            
            if k == 0 and b<= g:
                print('No')
            else:
                print('Yes')

        elif b > r:
            while g <= r and k:
                g <<= 1
                k -= 1
            
            if k == 0 and g<= r:
                print('No')
            elif g >= b:
                print('No')
            else:
                print('Yes')
        
        else:
            while g <= r and k:
                g <<= 1
                k -= 1
            while b <= g and k:
                b <<= 1
                k -= 1
            

            if k == 0 and (b<=r or g<=r or b<=g):
                print('No')
            else:
                print('Yes')




        




































# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
    newlines = 0
    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None
 
    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()
 
    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()
 
    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)

class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip("\r\n")
# endregion
 
if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:

if __name__ == "__main__":
    A, B, C = map(int, input().split())
    K = int(input())

    for i in range(K):
        if C <= A:
            C *= 2
        elif B <= A:
            B *= 2
        elif C <= B:
            C *= 2
        print(A, B, C)

    if A < B < C:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

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

for a in range(K):
    if A>B:
        B*=2
    elif B>C:
        C*=2
if A<B and B<C:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

for k in range(K):
  if A < B < C:
    print("Yes")
    exit()
  if A > B:
    B *= 2
  elif B > C:
    C *= 2
    
if A < B < C:
  print("Yes")
  exit()
print("No")

Submission status: Wrong Answer

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

while B<A:
    B *= 2
    K -= 1
while C<A:
    C *= 2
    K -= 1
if K>0:
    print("Yes")
else :
    print("No")

Submission status: Wrong Answer

Solution code:
import sys
from collections import deque
import numpy as np
import math
sys.setrecursionlimit(10**6)
def S(): return sys.stdin.readline().rstrip()
def SL(): return map(str,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def IL(): return map(int,sys.stdin.readline().rstrip().split())

if __name__=='__main__':
    a,b,c = IL()
    k = I()
    ab = a/b
    cb = math.ceil(math.log2(ab))
    b *= 2**cb
    if a==b:
        cb += 1
        b *= 2
    bc = b/c
    cc = math.ceil(math.log2(bc))
    c *= 2*cc
    if b==c:
        cc += 1
    if cb+cc<=k:
        print("Yes")
    else:
        print('No')
    exit()

Submission status: Wrong Answer

Solution code:
A,B,C = [int(x) for x in input().split()]
K = int(input())
for b in range(1,K+1):
    if A < B * 2**b:
        kb = b
        break
if B * 2**kb < C * 2**(K-kb):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
def main():
    a, b, c = list(map(int, input().split()))
    k = int(input())
    if b == 1 or c == 1:
        print('No')
        return
    count = 0
    while count < k:
        if b < a:
            b *= 2
            count += 1
        elif c < b:
            c *= 2
            count += 1
    if a < b and b < c:
        print('Yes')
    else:
        print('No')

main()

Submission status: Wrong Answer

Solution code:
a,b,c=map(int, input().split())
k = int(input())
magic = 0
while a > b:
  b = b * 2
  magic = magic + 1
while b > c:
  c = c * 2
  magic = magic + 1
if magic <= k:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
R,G,B = map(int,input().split())
K = int(input())
# R < G < B
for k in range(K):
    if G < R:
        G = G*2
    else:
        B = B*2
if R < G and  G < B:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

for i in range(k):
    if a <= b:
        b *=2
    elif b <= c:
        c *= 2

if c > b & b > a:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

for _ in range(k):
    if b < a:
        b *= 2
        continue
    if c < b:
        c *= 2
        continue

if a < b and b < c:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
A,B,C=map(int,input().strip().split())
K=int(input())
if A<B and B<C:
    print("Yes")
i=0
while i<K:
    if A>=B:
        B*=2
    else:
        C*=2
    if A<B and B<C:
        print("Yes")
        break
    i+=1
else:
    print("No")

Submission status: Wrong Answer

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

token=0
for i in range(k+1):
    c_c=c*(2**i)
    for j in range(k-i+1):
        b_c=c*(2**j)
        if a<b_c and b_c < c_c:
            token=1

if token : print("Yes")
else : print("No")

Submission status: Wrong Answer

Solution code:
a,b,c = map(int,input().split())
k = int(input())
x = 0
for i in range(k):
    if 2*i*b > a:
        x += i
        break
else:
    print('No')
    quit()
if 2*(k-x)*c > 2*x*b:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
abc = input('')
a = int(abc.split()[0])
b = int(abc.split()[1])
c = int(abc.split()[2])
k = int(input(''))

result = False
for i in range(k):
    if a>b:
        b*=2
    elif b>c:
        c*=2
#    print('{}/{}/{}'.format(a,b,c))
    if a<b and b < c:
        result = True
        break

if result:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
A, B, C = map(int, input().split())
K = int(input())
flag = False

for i in range(K):
  if A>B:
    B = B*2
    continue
  if B>C:
    C = C*2
    continue

if A<B<C:
  flag = True
    
print("Yes") if flag else print("No")

Submission status: Wrong Answer

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

for k in range(K):
    if A > B:
        B = 2*B
        continue
    elif B > C:
        C = 2*C
        continue
        
if A < B and B < C:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
A,B,C = map(int,input().split(" "))
K = int(input())
for i in range(K):
    if A > B :
        B = B*2
    if B > C :
        C = C*2

if C > B & B > A:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
def solve(A, B, C, K):
    for k in range(0, K+1):
        for n in range(0, k+1):
            if A <= (2**n)*B <= (2**(k-n))*C:
                return True
    return False
A, B, C = map(int,input().split())
K = int(input())
if solve(A, B, C, K):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

for _ in range(K):
    if A > B:
        B *= 2
    elif B > C:
        C *= 2
if A < B < C:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
a = list(map(int,input().split()))
k = int(input())
#青＞緑＞赤
r,g,b = 0,0,0
for i,num in enumerate(a):
    if i==0:
        r = num
    elif i==1:
        g = num
    elif i==2:
        b = num

for i in range(k):
    if b<g:
        b *= 2
    elif g<r:
        g *= 2

if b>g and g>r:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import numpy as np
import sys
from collections import deque
from collections import defaultdict
import heapq
import collections
import itertools
import bisect
from scipy.special import comb
import copy
sys.setrecursionlimit(10**6)


def zz():
    return list(map(int, sys.stdin.readline().split()))


def z():
    return int(sys.stdin.readline())


def S():
    return sys.stdin.readline()[:-1]


def C(line):
    return [sys.stdin.readline() for _ in range(line)]


A, B, C = zz()
K = z()

# A<B<C　にしたい
for i in range(K):
    if (A > B):
        B *= 2
    elif (B > C):
        C *= 2

if (A < B < C):
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
li = input().split()
a=int(input())
magic = 0
for i in range(0,3):
    if li[0] >= li[1]:
        li[1] = li[1] * 2
        magic = magic + 1

for i in range(0,3):
    if li[1] >= li[2]:
        li[2] = li[2] * 2
        magic = magic + 1
        
if a >= magic:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a,b,c = map(int, input().split())
k = int(input())
for i in range(k):
    if b<a:
        b*=2
    else:
        c*=2
if a<b<c:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

for i in range(K):
    if B < A:
        B *= 2
    elif C < B:
        C *= 2

if B > A and C > B:
    print("Yes")
else:
    print("No")