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 = 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:
                A *= 2 * i
                B *= 2 * j
                C *= 2 * k
                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())
if c>b and b>a:
    print("Yes")
else:
    while(b<a and k):
        b=b*2
        k-=1

    while(c<b and k):
        c=c*2
        k-=1
    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 b > c:
        c = 2 * c

    elif a > b:
        b = 2 * b
        # 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())

ans = False
tmp_a = a
tmp_b = b
tmp_c = c

for i in range(0,2*k+1,2):
  for j in range(0,2*k+1,2):
    for l in range(0,2*k+1,2):
      if i == 0:
        tmp_a = a
      else:
        tmp_a *= i
      if j == 0:
        tmp_b = b
      else:
        tmp_b *= j
      if l == 0:
        tmp_c = c
      else:
        tmp_c *= l
      if tmp_a < tmp_b and tmp_b < tmp_c and (i + j + l)/2 <= k:
        ans = True
        break
      tmp_a = a
      tmp_b = b
      tmp_c = c

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

Submission status: Wrong Answer

Solution code:


R,G,B=map(int,input().split())
K = int(input())
i = 1
while i <= K and not(R<=G and G<=B):
    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:
li = list(map(int,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:
import sys

def hantei(A, B, C, K):
  i = 0
  while A >= B:
    if i >= K:
      return False
      sys.exit()
    B *= 2
    i += 1
  while B >= C:
    if i >= K:
      return False
      sys.exit()
    C *= 2
    i += 1
  return True
 

A, B, C = map(int, input().split())
K = int(input())
if(hantei(A, B, C, K)):
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

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

for i in range(N):
    if C < A and B < A:
        C *= 2
    elif C > A and B < A:
        B *= 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 i in range(k + 1):
    for j in range(k + 1 - i):
        for l in range(k + 1 - i - j):
            if c * l > b * j > a * i:
                print('Yes')
                exit()

print('No')

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
# N,M = map(int,sys.stdin.readline().split())
# a = tuple(map(int,sys.stdin.readline().split())) # single line with multi param
# a = tuple(int(sys.stdin.readline()) for _ in range(N)) # multi line with single param
# a = tuple(tuple(map(int,sys.stdin.readline().rstrip().split())) for _ in range(N)) # multi line with multi param
# s = sys.stdin.readline().rstrip()
# N = int(sys.stdin.readline())
# INF = float("inf")
import sys
A,B,C = map(int,sys.stdin.readline().split())

for i in range(3):
    for j in range(4-i):
        #print(i,j)
        if A < 2**i*B and 2**i*B < 2**j*C:
            print("Yes")
            exit()
print("No")
#print(i,2**i*B,j,2**j*C)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

A, B, C = int(A), int(B), int(C)

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

if B > A and C > B:
  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+1):
  num = K-i
  for j in range(num+1):
    num2 = num-j
    if A*2**i<B*2**j:
      if B*2**j<C*2**num2:
        print("Yes")
        flag = False
        
if flag == True:
  print('No')

Submission status: Wrong Answer

Solution code:
def main():
    a, b, c = map(int, input().split())
    k = int(input())
    cnt = 0
    while(1):
        # print(a)
        # print(b)
        # print(c)
        # print('------------------')
        if cnt-1 == k:
            print('No')
            return
        cnt += 1
        if a < b and b < c:
            print('yes')
            return
        if not a < b:
            b = 2*b
        elif not b < c:
            c = 2*c
if __name__ == '__main__':
    main()

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
  elif B > C:
    C = 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())

i = 0
for i in range(k):
  if a >= b:
    b = b * 2
    i += 1
  if c >= b:
    c = c * 2
    i += 1

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

Submission status: Wrong Answer

Solution code:
import math
import collections
import fractions
import itertools
import functools
import operator

def solve():
    a, b, c = map(int, input().split())
    k = int(input())
    i = k
    for p in range(i):
        for q in range(i-p):
            for r in range(i-p-q):
                if a**p < b**q < c**r:
                    print("Yes")
                    exit()
    print("No")
    return 0

if __name__ == "__main__":
    solve()

Submission status: Wrong Answer

Solution code:
red, green, blue = map(int, input().split())
k = int(input())
for i in range(k):
    if red > green:
        green *= 2
    else:
        blue *= 2
if red < green and green < blue:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
from math import floor,ceil,sqrt,factorial,log
from collections import Counter, deque
from functools import reduce
import numpy as np
import itertools
def S(): return input()
def I(): return int(input())
def MS(): return map(str,input().split())
def MI(): return map(int,input().split())
def FLI(): return [int(i) for i in input().split()]
def LS(): return list(MS())
def LI(): return list(MI())
def LLS(): return [list(map(str, l.split() )) for l in input()]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def LLSN(n: int): return [LS() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]

A,B,C = MI()
K = I()

ans = False

def check(a,b,c):
    return a < b and b < c

for i in range(K):
   
    if A >= B:
        B = B * 2
    elif B >= C:
        C = C * 2
    print(A,B,C)
    if check(A,B,C):
        print("Yes")
        exit() 

print("No")

Submission status: Wrong Answer

Solution code:
li = list(map(int,input().split()))
lis = []
k = int(input())

for i in range(1,len(li)):
    while li[i] < li[i-1] and k:
        li[i] = li[i]*2
        k-=1
for i in range(1,len(li)):
    if li[i] <= li[i-1]:
        print('No')
        break
else:
    print('Yes')

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

Submission status: Wrong Answer

Solution code:
#: Author - Soumya Saurav
import sys,io,os,time
from collections import defaultdict
from collections import OrderedDict
from collections import deque
from itertools import combinations
from itertools import permutations
import bisect,math,heapq
alphabet = "abcdefghijklmnopqrstuvwxyz"

input = sys.stdin.readline

########################################
a , b , c  = map(int, input().split())
k = int(input())
if a < b < c:
	print("Yes")
	exit()
if b < a:
	mul = a - b
	mul = mul//2 
	if mul > k:
		print("No")
		exit()
	else:
		k-=mul
		b*=mul*2
	#print("!",mul,b)
if b > c:
	mul = b - c
	mul = mul//2
	if mul > k:
		print("No")
	else:
		print("Yes")
	exit()
print("Yes")

Submission status: Wrong Answer

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

k = 0

for i in range(q+1):
    for j in range(0, q-i+1):
        print(i, j)
        B_ = B * (2 ** i)
        C_ = C * (2 ** j)
        if A < B_ and B_ < C_ and A < C_:
            k = 1
if k != 0:
    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())
cnt = 0

while A > B and cnt >= K:
    B = B*2
    cnt += 1

if cnt >= K:
    print("No")
else:
    while B > C and cnt >= K:
        C = C*2
        cnt += 1

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

Submission status: Wrong Answer

Solution code:

def main():
    a,b,c = list(map(int, input().split()))
    k = int(input())
    
    for i 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")
   
if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
a, b, c = map(int, input().split())#赤midoriao
k = int(input())
#赤＜緑＜青
if a < b and b<c:
  print("Yes")
else:
  while k > 0:
    if a >= b:
      b = b*2
      k-=1
    if b >= c and k>0:
      c = c*2
      k -=1
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):
    tmp = min(B,C)
    if(B==C):
        C *= 2
    elif(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:
a = list(map(int, input().split()))
k = int(input())

for i in range(k):
    a[a.index(min(a))] *= 2
    if a[0]<a[1]<a[2]:
        ans = 'Yes'
        break
else:
    ans = 'No'
print(ans)

Submission status: Wrong Answer

Solution code:
import math
import collections
import bisect
from collections import deque
from copy import copy, deepcopy


def main():
    A, B, C = map(int, input().split())
    K = int(input())
    ans = 0
    tmp1 = math.ceil(math.log2((A + 0.1) / B))
    if tmp1 > 0:
        B = B * (2**tmp1)
        ans += tmp1
    tmp2 = math.ceil(math.log2((B + 0.1) / C))
    if tmp2 > 0:
        ans += tmp2
    #print(tmp1, tmp2)
    if ans <= K:
        print("YES")
    else:
        print("NO")


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
from collections import defaultdict,deque
import math
def gcd(a,b):
    return b if not a%b else gcd(b,a%b)
def lcm(a,b):
    return (a*b)//gcd(a,b)

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

    cnt = 0
    while(cnt<k):
        if(c<b):
            c*=2
            cnt+=1
        elif(b<=a):
            b*=2
            cnt+=1
        else:
            cnt+=1

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
s = input().split()

A = int(s[0])
B = int(s[1])
C = int(s[2])

K = int(input())

result = False

for i in range(1, K+1):
  if A < B * (2 ** i):
    if (B * (2 ** i)) < C * (2 ** (K - i)):
      result = True
      break
    
if result:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

Solution code:
"""
b > g > r

"""

r, g, b = list(map(int, input().split()))
k = int(input())
flag = False
for i in range(k):
    if r > b and g > b:
        b *= 2
    elif r > g:
        g *= 2
    if b > g > r:
        flag = True

print("Yes") if flag else print("No")

Submission status: Wrong Answer

Solution code:
import math

ao, mi, aka = map(int, input().split(" "))
k = int(input())

for i in range(k):
    if mi <= aka:
        mi *= 2
        continue
    if ao <= mi:
        ao *= 2
        continue
    ao *= 2

if ao > mi > aka:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
#b

# B > A
# C > B

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

k = 0
while B<A:
    B*=2
    k += 1

while C<B:
    C*=2
    k+=1
    
if k<=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 = int(math.log2(A / B)) + 1
y = int(math.log2(B * 2 ** x / C)) + 1
if x + y <= K:
    ans = 'Yes'
else:
    ans = 'No'
print(ans)

Submission status: Wrong Answer

Solution code:
import sys
import numpy as np

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')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
A,B,C = map(int,input().split(" "))
K = int(input())
for i in range(1,K+1):
    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:
a,b,c=map(int,input().split())
k=int(input())
s=0
for i in range(4):
    if b*(2**i)>a:
        s=i
        break
b*=2**s
t=0
for i in range(4):
    if c*(2**i)>b:
        t=i
        break
if s+t>=k:
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
if __name__ == '__main__':
    a,b, c = map(int, input().split())

    n = int(input())
    count = 0
    if b <= a:
        x = a // b
        z1 = a % b
        if x >=1 and x <=2:
            count+=1
        elif x>=3 and x <=4:
            count+=2
        else:
            count+=3
        if z1==0:
            count+=1
    b2 =  b*(2**count)
    if c <= b2:
        y = b2 // c
        z2 = b2 %c
        if y >=1 and y <=2:
            count+=1
        elif y>=3 and y <=4:
            count+=2
        else:
            count+=3
        if z2 ==0:
            count+=1

    if count <= n:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

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

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

    if (C>B):
        break
    else:
        C=C*2
        continue
        
if (A<B) & (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 + C):
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

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

ans = 'No'
for j in range(K):
    G = B*2*(j+1)
    Bl = C*2*(K-(j+1))
    if G > A and Bl > G :
        ans = 'Yes'
        break

print(ans)

Submission status: Wrong Answer

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


for i in range(1,k+1):
    if b*2**i > a and c*2**(k-i) > b*2**i:
        print("Yes")
        exit()

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:

def main():
    A, B, C = (int(x) for x in input().split(" "))
    K = int(input())
    for i in range(K):
        if A < B:
            if B < C:
                print("Yes")
                exit()
            C = 2*C
        else:
            B = 2*B
        print(A, B, C)

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


if __name__ == '__main__':
    main()

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==C):
        C *= 2
    elif(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:
a,b,c = map(int,input().split())
k = int(input())

for kk in range(k):
  if not a < b:
    b *=2
    k -=1
  if not b < c:
    c *=2
    k -=1
  if k <= 0 or a<b<c:
    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())

flag=0
for i in range(0, k+1):
  bb = b * (2**i)
  j = k-i
  cc = c * (2**j)
  if (a < bb) and (bb < cc):
    print('Yes')
    flag=1

if flag==0:
  print('No')

Submission status: Wrong Answer

Solution code:
A,B,C = map(int,input().split(" "))
K = int(input())
for i in range(1,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:
a,b,c=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")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import sys
import math
from collections import defaultdict,deque
from itertools import permutations
ml=lambda:map(int,input().split())
ll=lambda:list(map(int,input().split()))
ii=lambda:int(input())
ip=lambda:list(input())
ips=lambda:input().split()
sys.setrecursionlimit(10**6)
"""========main code==============="""

t=1
for _ in range(t):
    a,b,c=ml()
    k=ii()
    ans="No"
    
    for i in range(k+1):
        for j in range((k+1-i)):
            for k in range((k+1-i-j)):
                p=pow(2,i)
                q=pow(2,j)
                r=pow(2,k)
                arr=[p,q,r]
                arr.sort()
                for l in list(permutations(arr)):
                    if(c*l[0]>b*l[1] and b*l[1]>a*l[2]):
                        ans="Yes"
    print(ans)

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
k=int(input())
mm=max(a,b)
ans=0
g=0
if mm>=c:
    for i in range(1,4):
        if c*(2**i)>mm:
            ans+=1
            g+=1
            break
        g+=1
        ans+=1
f=0
if b<=a:
    for i in range(1,4):
        if b*(2**i)>a:
            f+=1
            ans += 1
            break
        f+=1
        ans += 1
if ans<=k and b*2**f<c*2**g:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
a,b,c=map(int,input().split())
k=int(input())
s=0
for i in range(4):
    if b*(2**i)>a:
        s=i
        break
b*=2**s
t=0
for i in range(4):
    if c*(2**i)>b:
        t=i
        break
if s+t>k:
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
# Template 1.0
import sys, re
from collections import deque, defaultdict, Counter, OrderedDict
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log,floor
from heapq import heappush, heappop, heapify, nlargest, nsmallest
def STR(): return list(input())
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def list2d(a, b, c): return [[c] * b for i in range(a)]
def sortListWithIndex(listOfTuples, idx):   return (sorted(listOfTuples, key=lambda x: x[idx]))
def sortDictWithVal(passedDic):
    temp = sorted(passedDic.items(), key=lambda kv: (kv[1], kv[0]))
    toret = {}
    for tup in temp:
        toret[tup[0]] = tup[1]
    return toret
def sortDictWithKey(passedDic):
    return dict(OrderedDict(sorted(passedDic.items())))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

a,b,c = MAP()

k = INT()

temp = floor(log(a/b, 2))+1
if(temp>0):
    b=b*(2**temp)

temp1 = floor(log(b/c, 2))+1
# print(temp, b, temp1)
if(temp+temp1<=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))
if x < 0:
    x = 0
    
y = math.ceil(math.log2((B*(2**x))/C))


if y < 0:
    y = 0

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

Submission status: Wrong Answer

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

d=2**k

if d*b>a:
    print('Yes')
elif d*c > 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 b < a:
        b *= 2
    if b > c:
        c *= 2

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

Submission status: Wrong Answer

Solution code:
l = list(map(int,input().split()))
r, g, b = l[0], l[1], l[2]
k = int(input())

for _ in range(k):
  if r >= g:
    g *= 2
  elif g >= b:
    b *= 2
  else:
    print('Yes')
    break

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")
  exit()
  
  
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:
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
  else:
    A = A *2

if A<B and B < C and A < C:
  print("Yes")
else:
  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:
word = input()
nums = word.split()
numin = [0,0,0]
seiko = 0
for j in range(3):
    numin[j] = int(nums[j])
k = int(input())

for i in range(k+1):
    if numin[0] >= numin[1]:
        numin[1] *= 2
    elif numin[1] >= numin[2]:
        numin[2] *= 2
    else:
        seiko = 1
        print('Yes')

if seiko == 0:
    print('No')

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!
# 幅優先探索（行きがけ）
import collections
import sys
import copy
import re
import math


def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())


def main():
    A, B, C = LI()
    K = I()
    for i in range(K):
        if A >= B:
            B *= 2
        else:
            K -= (i)
            break

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


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

YES = "Yes"  # type: str
NO = "No"  # type: str


def solve(A: int, B: int, C: int, K: int):
    flag = False
    for k1 in range(K):
        for k2 in range(K):
            for k3 in range(K):
                if not k1 + k2 + k3 <= K:
                    break
                if B * (2 ** k2) > A * (2 ** k1) and C * (2 ** k3) > B * (2 ** k2):
                    flag = True

    if flag == True:
        print(YES)
    else:
        print(NO)
    return


# Generated by 1.1.7.1 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()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    C = int(next(tokens))  # type: int
    K = int(next(tokens))  # type: int
    solve(A, B, C, K)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

while n > 0:
    if flg == 0:
        b = b * 2
        n = n - 1
        #print(a,b,c)
        if a < b:
            flg = 1
    else:
        c = c * 2
        n = n - 1
        #print(a,b,c)
        if b < c:
            print('Yes')
            exit()

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("Yes")
                sys.exit(0)
print("No")

Submission status: Wrong Answer

Solution code:
import sys
import numpy as np

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')
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')
else:
    for _ in range(K):
        if A >= B:
            B *= 2
        elif B >= C:
            C *= 2
        if A < B < C:
            print('Yes')
            break
    else:
        print(A, B, C)
        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())

for i in range(K):
  if A < B < C:
    break
  elif B > C:
    C *= 2
  elif A > B:
    B *= 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())
if c>b and b>a:
    print("Yes")
    exit()
else:
    while(k>0):
        if b<a:
            b*=2
            k=k-1
        else:
            c*=2
            k=k-1
    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 kk in range(k):
  if not a < b:
    b *=2
    k -=1
  if not b < c:
    c *=2
    k -=1
  if k <= 0:
    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())

while a > b and k > 0:
    b *= 2
    k -= 1
    

while b > c and k > 0:
    c *= 2
    k -= 1

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

Submission status: Wrong Answer

Solution code:
import sys

def I(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def main():
    a, b, c = MI()
    k = I()
    res = k
    flag = True
    if b < a:
        for i in range(k):
            b *= 2
            res -= 1
            if b > a:
                break
        else:
            flag = False
    if c < b:
        for i in range(res):
            c *= 2
            res -= 1
            if c > b:
                break
        else:
            flag = False
    if flag:
        print('Yes')
    else:
        print('No')



if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
# A: red, B: green, C: blue
# A < B < C

A, B, C = [ int(v) for v in input().split(" ") ]
K = int(input())

# A < B
for i in range(K):
  if A > B:
    B *= 2
    K -= 1
  else:
    break

for i in range(K):
  if B > C:
    C *= 2
    K -= 1
  else:
    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())

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