Problem:


Score : 200 points

Problem Statement

Takahashi and Aoki will have a battle using their monsters.

The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.

The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...
Here, an attack decreases the opponent's health by the value equal to the attacker's strength.
The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.

If Takahashi will win, print Yes; if he will lose, print No.

Constraints

1 \leq A,B,C,D \leq 100

All values in input are integers.

Input

Input is given from Standard Input in the following format:

A B C D

Output

If Takahashi will win, print Yes; if he will lose, print No.

Sample Input 1

10 9 10 10

Sample Output 1

No

First, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.

Next, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.

Takahashi's monster is the first to have 0 or less health, so Takahashi loses.

Sample Input 2

46 4 40 5

Sample Output 2

Yes



Sample input:
10 9 10 10


Sample output:
No

Submission status: Accepted

Solution code:
tk_hp, tk_atk, ao_hp, ao_atk = map(int,input().split())


while(1):
    ao_hp -= tk_atk

    if(ao_hp <= 0):
        print("Yes")
        exit()

    tk_hp -=  ao_atk

    if(tk_hp <= 0):
        print("No")
        exit()

Submission status: Accepted

Solution code:
import math
T_Tairyoku,T_Atack,A_Tairyoku,A_Atack=map(int,input().split())
T=(math.ceil(A_Tairyoku/T_Atack))
A=(math.ceil(T_Tairyoku/A_Atack))

if T==A:
  print('Yes')
elif T>A:
  print('No')
elif A>T:
  print('Yes')

Submission status: Accepted

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

while A>0 or C>0:
  if C>B:
    C-=B
  else:
    print('Yes')
    exit()
  if A>D:
    A-=D
  else:
    print('No')
    exit()

Submission status: Accepted

Solution code:
a,b,c,d = map(int, raw_input().split(' '))
turn = False
while(a > 0 and c > 0):
    if turn:
        a -= d
    else:
        c -= b
    
    turn = not(turn)
print 'Yes' if a > 0 else 'No'

Submission status: Accepted

Solution code:
a,b,c,d=(int(x) for x in input().split())

for i in range(1,101):
  if (c - i*b) <= 0:
    print('Yes')
    break
  elif (a - i*d) <= 0:
    print('No')
    break
  else:
    continue

Submission status: Accepted

Solution code:
a_hp,a_power,b_hp,b_power = map(int, input().split())

while a_hp>0 or b_hp>0:
  b_hp = b_hp - a_power
  if b_hp <=0:
    break
  a_hp = a_hp - b_power
  if a_hp <=0:
    break

if a_hp >= b_hp:  
  print('Yes')
else: 
  print('No')

Submission status: Accepted

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

  takahashi_hp = a
  aoki_hp = c
  while True:
    aoki_hp -= b
    if aoki_hp <= 0:
      print('Yes')
      break

    takahashi_hp -= d
    if takahashi_hp <= 0:
      print('No')
      break



if __name__ == '__main__':
  main()

Submission status: Accepted

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

if c % b == 0:
    takahashi = c // b
else:
    takahashi = c // b + 1

if a % d == 0:
    aoki = a // d
else:
    aoki = a // d + 1

# print(takahashi)
# print(aoki)

if takahashi <= aoki:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
line = input().split(" ")
a = 0
while a<1:
    line[2] = int(line[2]) - int(line[1])
    if int(line[2])<=0:
        print("Yes")
        break
    line[0] = int(line[0]) - int(line[3])
    if int(line[0])<=0:
        print("No")
        break

Submission status: Accepted

Solution code:
HP_t, ATK_t, HP_a, ATK_a = [int(x) for x in input().split()]
while True:
    HP_a = HP_a - ATK_t
    if HP_t <= 0:
        print('No')
        break
    HP_t = HP_t - ATK_a
    if HP_a <= 0:
        print('Yes')
        break

Submission status: Accepted

Solution code:
A,B,C,D = map(int,input().split( ))
if C%B == 0:
    num_takahashi = C//B
else:
    num_takahashi = C//B + 1
if A%D == 0:
    num_aoki = A//D
else:
    num_aoki = A//D + 1
if num_takahashi <= num_aoki:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

    if -(-c//b) <=-(-a//d):
        return 'Yes'
    else:
        return 'No'
    
print(solve())

Submission status: Accepted

Solution code:
l1 = list(map(int,input().split()))
while l1[0] > 0 and l1[2] > 0:
    l1[2] -= l1[1]
    if l1[2] <= 0:
        answer = "Yes"
        break
    l1[0] -= l1[3]
    if l1[0] <= 0:
        answer = "No"
        break
print(answer)

Submission status: Accepted

Solution code:
abcd = list(map(int, input().split()))
saki=0
while abcd[0]>0 and abcd[2]>0:
    abcd[2]-=abcd[1]
    if abcd[2]<=0:
        saki=1
    abcd[0]-=abcd[3]


if saki==1:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

while True:
  c-=b
  if c<=0:
    print("Yes")
    break
  a-=d
  if a<=0:
    print("No")
    break

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
count_a = 0
count_b = 0
if c % b == 0:
    count_a = c//b
else:
    count_a = c//b + 1

if a % d == 0:
    count_b = a//d
else:
    count_b = a//d + 1

if count_a <= count_b:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
print('Yes' if (a+d-1)//d >= (c+b-1)//b else 'No')

Submission status: Accepted

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

turn = 0
while True:
    if turn % 2 == 0:
        c -= b
    else:
        a -= d
    if a <= 0 or c <= 0:
        break
    else:
        turn += 1

print("Yes" if turn % 2 == 0 else "No")

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
while A > 0 and C > 0:
    C = C - B
    if C <= 0:
        break
    else:
        A = A - D
if A <= 0:
    ans = 'No'
else:
    ans = 'Yes'
print(ans)

Submission status: Accepted

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

if(a[2]%a[1]>=1):
  ans_a=int(a[2]/a[1])+1
else:
  ans_a=int(a[2]/a[1])
if(a[0]%a[3]>=1):
  ans_b=int(a[0]/a[3])+1
else:
  ans_b=int(a[0]/a[3])
if(ans_a <=ans_b):
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

while True:
    c = c-b
    if c <= 0:
        print('Yes')
        exit()
    a = a-d
    if a <= 0:
        print('No')
        exit()

Submission status: Accepted

Solution code:
#B
import sys
a, b, c, d = map(int, input().split())
for i in range(100):
    c -= b
    if c <= 0:
        print('Yes')
        break
    else:
        a -= d
        if a <= 0:
            print('No')
            break

Submission status: Accepted

Solution code:
def attack_num(HP,A):
    if HP%A == 0:
        return HP//A
    return HP//A + 1

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

if attack_num(C,B)  <= attack_num(A,D) :
    print("Yes")
else :
    print("No")

Submission status: Accepted

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

while a>0 and c>0:
  c -= b
  if c<=0:
    print("Yes")
    break
  a -= d
  if a<=0:
    print("No")
    break

Submission status: Accepted

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

while C > 0 and A > 0 :
    C = C - B
    A = A - D

    if C <= 0:
        print("Yes")
        break
    if A <= 0:
        print("No")
        break

Submission status: Accepted

Solution code:
A,B,C,D=map(int,input().split())
takahashi=A
aoki=C
count=1
while (takahashi>0 and aoki>0):
    count=count+1
    if count % 2 == 0:
        aoki=aoki-B
    else:
        takahashi = takahashi - D

if aoki <= 0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

taka1 = a//d
taka2 = a%d
aoki1 = c//b
aoki2 = c%b

if a%d != 0:
    taka1 += 1
if c%b != 0:
    aoki1 += 1

if taka1 >= aoki1:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
i = 0
while True:
    if i % 2 == 0:
        c -= b
    else:
        a -= d
    i += 1

    if a <= 0:
        print('No')
        break
    elif c <= 0:
        print("Yes")
        break

Submission status: Accepted

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

E = C - B
F = A - D

for i in range(1000):
  if E <= 0:
    print('Yes')
    break
  elif F <= 0:
    print('No')
    break
  else:
    E = E - B
    F = F - D

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
count_takahashi = 0
count_aoki = 0

while (A - D) > 0:
    A -= D
    count_takahashi += 1

while (C - B) > 0:
    C -= B
    count_aoki += 1

if count_takahashi >= count_aoki:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import numpy as np
import math
import scipy as sp
import queue
import collections

MOD = 10 ** 9 + 7
INF = 10 ** 9

def main(kwargs):
    a = kwargs["a"]
    b = kwargs["b"]
    c = kwargs["c"]
    d = kwargs["d"]

    res = 'No'

    while True:
        if res == 'No':
            c -= b
            res = 'Yes'

            if c <= 0:
                break
        else:
            a -= d
            res = 'No'

            if a <= 0:
                break

    return res

if __name__ == "__main__":
    kwargs = {}

    cin = input().split()
    #kwargs["n"] = cin[0]
    #kwargs["n"], kwargs["k"] = cin
    #kwargs["n"] = [int(i) for i in cin][0]
    kwargs["a"], kwargs["b"], kwargs["c"], kwargs["d"] = [int(i) for i in cin]

    cout = main(kwargs)
    print(cout)

Submission status: Accepted

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

while (a>=0 and c>=0):
  c=c-b
  if c<=0 :
    print("Yes")
    break
  else :
    a=a-d
    if a<=0 :
      print("No")
      break

Submission status: Accepted

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


while( True ):
  C -= B
  if( C <= 0 ):
    print("Yes")
    break
  A -= D
  if( A <= 0 ):
    print( "No")
    break

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
while a>0 and c>0:
    c-=b
    if c>0:
        a-=d
    else:
        break
if a>0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import math

A, B, C, D = list(map(int, input().split(" ")))

if math.ceil(C/B) <= math.ceil(A/D):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
def main():
    A, B, C, D = map(int, input().split())
    for i in range(300):
        if i % 2 == 0:
            C -= B
            if C <= 0:
                print("Yes")
                break
        else:
            A -= D
            if A <= 0:
                print("No")
                break
if __name__ == "__main__":
    main()

Submission status: Accepted

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

cnt = 0
while (a > 0 and c > 0):
    if cnt % 2 == 0:
        c = c - b
    else:
        a = a - d
    cnt += 1

if c <= 0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    A, B, C, D = map(int, input().split())
    print("Yes" if -(-A//D) >= -(-C//B) else "No")

Submission status: Accepted

Solution code:
try:
  a,b,c,d=[int(x) for x in input().split()]
  while(a>0 and c>0):
    c=c-b
    if(c<=0):
      break
    a=a-d
    
  if(a<=0):
    print("No")
    
  else:
    print("Yes")
    
except:
  pass

Submission status: Accepted

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

A = list(map(int, input().split()))

tak_turn = A[0] // A[3]
if ( A[0] % A[3] > 0 ):
  tak_turn += 1

aok_turn = A[2] // A[1]
if ( A[2] % A[1] > 0 ):
  aok_turn += 1

if ( tak_turn >= aok_turn ):
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
com =list(map(int,input().split()))
t_s = com[0]
t_a = com[1]
a_s = com[2]
a_a = com[3]
while 1:
    a_s -= t_a
    if a_s <= 0:
        print("Yes")
        break
    t_s -= a_a
    if t_s <= 0:
        print("No")
        break

Submission status: Accepted

Solution code:
A,B,C,D=map(int,input().split())
while C>0:
    A=A-D
    C=C-B

if A>0:
    print('Yes')
else:
    if A+D>0:
        print('Yes')
    else:
        print("No")

Submission status: Accepted

Solution code:
A,B,C,D = map(int,input().split())
while True:
  C = C - B
  if C <= 0:
    break
  A = A - D
  if A <= 0:
    break
print('Yes' if A > 0 else 'No')

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
takahashi=c//b
if c%b!=0:
  takahashi+=1
aoki=a//d
if a%d!=0:
  aoki+=1

if takahashi<=aoki:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

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

while(True):
  C -= B
  if (C <= 0):
    print('Yes')
    break
  A -= D
  if (A <= 0):
    print('No')
    break

Submission status: Accepted

Solution code:
a,b,c,d = map(int, input().split())
if (a-1)//d >= (c-1)//b:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

while A > 0 and C > 0:
    C -=B
    if C <=0:
        break
    A -=D
if A > 0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

for i in range(1, 10000):
    if i%2 != 0:
        c -= b
    else:
        a -= d

    if a <= 0:
        print('No')
        exit()
    elif c <= 0:
        print('Yes')
        exit()

Submission status: Accepted

Solution code:
li = list(map(int,input().split()))
takahashiturn=int(li[2]/li[1])
if li[2]%li[1]!=0:
    takahashiturn+=1
aokiturn=int(li[0]/li[3])
if li[0]%li[3]!=0:
    aokiturn+=1
if takahashiturn<=aokiturn:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
line = input()
a, b, c, d = line.split(" ")
a, b, c, d = int(a), int(b), int(c), int(d)

max = max(a,c)

for i in range(max):
    c = c - b
    if c <= 0:
        print("Yes")
        break
    a  = a - d
    if a <= 0:
        print("No")
        break

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
while(True):
  C -= B
  if C <= 0:
    print("Yes")
    break
  A -= D
  if A <= 0:
    print("No")
    break

Submission status: Accepted

Solution code:
[a, b, c, d] = [int(i) for i in input().split()]
while a > 0 and c > 0:
    c -= b
    a -= d
if c <= 0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a=list(map(int,input().split(" ")))
A=a[2]
B=a[0]
while True:
    A-=a[1]
    if A<=0:
        print("Yes")
        break
    B-=a[3]
    if B<=0:
        print("No")
        break

Submission status: Accepted

Solution code:
from math import ceil
a, b, c, d = map(int, input().split())

if ceil((c / b)) <= ceil((a / d)):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
t_life, t_attack, a_life, a_attack = list(map(int, input().split()))
#  体力　攻撃力
t_c = 0
a_c = 0

while True:
    a_life -= t_attack
    t_c += 1
    if a_life <= 0:
        break


while True:
    t_life -= a_attack
    a_c += 1
    if t_life <= 0:
        break

if t_c <= a_c:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
str = input().split()
a = int(str[0])
b = int(str[1])
c = int(str[2])
d = int(str[3])
num = 0
while num == 0 :
    c = c - b
    if c <= 0:
        print("Yes")
        break
    a = a - d
    if a <= 0:
        print("No")
        break

Submission status: Accepted

Solution code:
a = list(map(int, input().split()))
th = a[0]
ta = a[1]
ah = a[2]
aa = a[3]

while 1 == 1:
    ah = ah - ta
    if ah <= 0:
        print('Yes')
        break
    th = th - aa
    if th <= 0:
        print('No')
        break

Submission status: Accepted

Solution code:
def main():
    A, B, C, D = map(int, input().split())
    import math
    taka = math.ceil(A / D)
    aoki = math.ceil(C / B)
    if taka >= aoki:
        print("Yes")
    else:
        print("No")

main()

Submission status: Accepted

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

turn = 'T'
while True:
    if turn == 'T':
        c = c - b
        turn = 'A'
        if c <= 0:
            print("Yes")
            break
    elif turn == 'A':
        a = a - d
        turn = 'T'
        if a <= 0:
            print("No")
            break

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
if -(-a//d)+1 > -(-c//b):
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
A, B, C, D = [int(i) for i in input().split()]
round = 0
# health, strength
def helper(a, b, c, d):
    global round
    round += 1
    if a<=0:
        return False
    else:
        c -= b
        return helper(c, d, a, b)
helper(A, B, C, D)
if round%2==0:print('Yes')
else:print('No')

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
i = 0
while True:
    if i % 2 == 0:
        c -= b
    else:
        a -= d
    if a <= 0:
        print ('No')
        break
    if c <= 0:
        print ('Yes')
        break
    i += 1

Submission status: Accepted

Solution code:
import sys

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

while True:
    C -= B
    if C <= 0:
        print('Yes')
        sys.exit()

    A -= D
    if A <= 0:
        print('No')
        sys.exit()

Submission status: Accepted

Solution code:
import sys
import math
a,b,c,d=map(int,input().split())
t = math.ceil(a / d)
ao = math.ceil(c / b)
if (t < ao):
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
h1, a1, h2, a2 = map(int, input().split())

ans = None
while True:
  h2 -= a1
  if h2 <= 0:
    ans = "Yes"
    break
  h1 -= a2
  if h1 <= 0:
    ans = "No"
    break

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
tk = 0
ao = 0
if c % b != 0:
  tk = c//b + 1
else:
  tk = c//b
if a % d != 0:
  ao = a//d + 1
else:
  ao = a//d
if tk <= ao:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
def io():
    return map(int,input().split())
def op():
    return list(map(int,input().split()))
a,b,c,d=io()
while 1:
    c=c-b
    if c<=0:
        print('Yes')
        break
    a-=d
    if  a<=0:
        print('No')
        break

Submission status: Accepted

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

for i in range(1000):
    c = c - b
    if c <= 0:
        print('Yes')
        break
    a = a - d
    if a <= 0:
        print('No')
        break

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
for i in range(100):
    c -= b
    if c <=0:
        print('Yes')
        exit()
    else:
        a -= d
    if a <=0:
        print('No')
        exit()

Submission status: Accepted

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

while True:
    c = c - b
    if c <= 0:
        print("Yes")
        break
    a = a - d
    if a <= 0:
        print("No")
        break

Submission status: Accepted

Solution code:
from math import *
from copy import *
from string import *				# alpha = ascii_lowercase
from random import *
from sys import stdin
from sys import maxsize
from operator import *				# d = sorted(d.items(), key=itemgetter(1))
from itertools import *
from collections import Counter		# d = dict(Counter(l))
import math

def bin1(l,r,k,t,b,val,ans):
	if(l>r):
		return ans
	else:
		mid=(l+r)//2
		v=k**mid
		if(v==val):
			return v
		elif(v>val):
			ans=mid
			return bin1(mid+1,r,k,t,b,val,ans)
		else:
			return bin1(l,mid-1,k,t,b,val,ans)
		
def bin2(l,r,k,t,b,val,ans):
	if(l>r):
		return ans
	else:
		mid=(l+r)//2
		v=t*(k**mid)+b*(mid)
		if(v==val):
			return v
		elif(v>val):
			ans=mid
			return bin2(l,mid-1,k,t,b,val,ans)
		else:
			return bin2(mid+1,r,k,t,b,val,ans)

def SieveOfEratosthenes(n): 
      
    # Create a boolean array "prime[0..n]" and initialize 
    #  all entries it as true. A value in prime[i] will 
    # finally be false if i is Not a prime, else true. 
    prime = [True for i in range(n+1)] 
    p = 2
    while (p * p <= n): 
          
        # If prime[p] is not changed, then it is a prime 
        if (prime[p] == True): 
              
            # Update all multiples of p 
            for i in range(p * p, n+1, p): 
                prime[i] = False
        p += 1
    l=[]
    for i in range(2,n+1):
    	if(prime[i]):
    		l.append(i)
    return l
def bin(l,r,ll,val):
	if(l>r):
		return -1
	else:
		mid=(l+r)//2
		if(val>=ll[mid][0] and val<=ll[mid][1]):
			return mid
		elif(val<ll[mid][0]):
			return bin(l,mid-1,ll,val)
		else:
			return bin(mid+1,r,ll,val)
def deci(n):
	s=""
	while(n!=0):
		if(n%2==0):
			n=n//2
			s="0"+s
		else:
			n=n//2
			s="1"+s
	return s
def diff(s1,s2):
	if(len(s1)<len(s2)):
		v=len(s1)
		while(v!=len(s2)):
			s1="0"+s1
			v=v+1
	else:
		v=len(s2)
		while(v!=len(s1)):
			s2="0"+s2
			v=v+1
	c=0
	for i in range(len(s1)):
		if(s1[i:i+1]!=s2[i:i+1]):
			c=c+1
	return c
from sys import stdin, stdout 
def fac(a,b):
	v=a
	while(a!=b):
		v*=a-1
		a=a-1
	return v
def bino(l,r,n):
	if(l>r):
		return -1
	else:
		mid=(l+r)//2
		val1=math.log((n/mid)+1,2)
		val2=int(val1)
		if(val1==val2):
			return val1
		elif(val1<1.0):
			return bino(l,mid-1,n)
		else:
			return bino(mid+1,r,n)

def binary(l,r,ll,val,ans):
	if(l>r):
		return ans
	else:
		mid=(l+r)//2
		if(val%ll[mid]==0):
			ans=ll[mid]
			return binary(l,mid-1,ll,val,ans)
		else:
			return binary(l,mid-1,ll,val,ans)
def odd(n,ans,s):
	if(n%2!=0 or n in s):
		return ans
	else:
		s.add(n)
		return odd(n//2,ans+1,s)

if __name__ == '__main__':
	a,b,c,d=map(int,input().split(" "))
	c1=0
	while(a>0 and c>0):
		if(c1==0):
			c-=b
			c1=1
		else:
			a-=d
			c1=0
	if(a<1):
		print("No")
	else:
		print("Yes")

Submission status: Accepted

Solution code:
a,b,c,d= map(int,input().split())
flga = 1
while(flga==1):
    c = c-b
    if(c<=0):
        print("Yes")
        flag = 1
        break
    a = a-d
    if(a<=0):
        print("No")
        flag = 1
        break

Submission status: Accepted

Solution code:

arg = list(map(int, input().split()))
A = arg[0]
B = arg[1]
C = arg[2]
D = arg[3]

while True:
  C = C - B
  if C <= 0:
    break
  A = A - D
  if A <= 0:
    break
if A <= 0:
  print('No')
else:
  print('Yes')

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
t_attack = -(-1*C // B)
a_attack = -(-1*A // D)

if t_attack <= a_attack:
    print("Yes")
else:
    print('No')

Submission status: Accepted

Solution code:
import math

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

num_A = math.ceil(C/B)
num_B = math.ceil(A/D)

if num_A <= num_B:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

while(1):
    C -= B
    A -= D
    if(C <= 0):
        print('Yes')
        break
    if(A <= 0):
        print('No')
        break

Submission status: Accepted

Solution code:
A,B,C,D=map(int,input().split())
while True:
  C-=B
  if C<=0:
    print("Yes")
    break
  A-=D
  if A<=0:
    print("No")
    break

Submission status: Accepted

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


while True:
    C -= B
    if C <= 0:
        print("Yes")
        exit()
    A -= D
    if A <= 0:
        print("No")
        exit()

Submission status: Accepted

Solution code:
num = input().split(' ')
lifeTakahashi = int(num[0])
attackTakahashi = int(num[1])
lifeAoki = int(num[2])
attackAoki = int(num[3])

while lifeTakahashi > 0:
  lifeAoki = lifeAoki - attackTakahashi
  if(lifeAoki > 0):
    lifeTakahashi = lifeTakahashi - attackAoki
    continue
  else:
    print('Yes')
    break

if(lifeTakahashi <= 0):
  print('No')

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
while True:
    c -= b 
    if c <= 0:
        break
    a -= d
    if a<= 0:
        break
print('Yes' if a > c else 'No')

Submission status: Accepted

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

while True:
    c -= b
    if c <= 0:
        print("Yes")
        break
    a -= d
    if a <= 0:
        print("No")
        break

Submission status: Accepted

Solution code:
import numpy as np


a, b, c, d = (int(x) for x in input().split())

aoki = -(-c // b)
taka = -(-a // d)

if aoki > taka:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
params = input().split(' ')
takahashi_monster = {
    'life': int(params[0]),
    'attack': int(params[1]),
    'dead': False
}
aoki_monster = {
    'life': int(params[2]),
    'attack': int(params[3]),
    'dead': False
}

while takahashi_monster['dead'] == False and aoki_monster['dead'] == False:
    aoki_monster['life'] = aoki_monster['life'] - takahashi_monster['attack']
    if aoki_monster['life'] <= 0:
        aoki_monster['dead'] = True
        print('Yes')
        break
    takahashi_monster['life'] = takahashi_monster['life'] - aoki_monster['attack']
    if takahashi_monster['life'] <= 0:
        takahashi_monster['dead'] = True
        print('No')
        break

Submission status: Accepted

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

while 1:

  c=c-b

  if c<=0:
    print("Yes")
    break
  a=a-d
  if a<=0:
    print("No")
    break

Submission status: Accepted

Solution code:
A,B,C,D=map(int,input().split())
flag=True
while A >0 and C>0:
    C = C-B
    if C<=0:
        print('Yes')
        flag = False
        break
    A = A-D
if flag:
    print('No')

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
while a>0 and c>0:
    c-=b
    if c>0:
        a-=d
   
print('Yes' if a>0 else 'No')

Submission status: Accepted

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

if (a-1)//d  < (c-1)//b:
	print("No")
else:
	print("Yes")

Submission status: Accepted

Solution code:
t, ta, a, aa = list(map(int, input().split()))
while(True):
  a -= ta
  if a <= 0:
    print("Yes")
    break
  t -= aa
  if t <= 0:
    print("No")
    break

Submission status: Accepted

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

while C > 0 and A > 0:
    if C > 0:
        C -= B
        if C <= 0:
            print("Yes")
            exit()
    A -=D

print("No")

Submission status: Accepted

Solution code:
a,b,c,d=[int(x) for x in input().split()]
while(0<a and 0<c):
  c-=b
  if c<=0:
    print("Yes")
    break
  a-=d
  if a<=0:
    print("No")
    break

Submission status: Accepted

Solution code:
arr = input().split(' ')
A = int(arr[0])
B = int(arr[1])
C = int(arr[2])
D = int(arr[3])

while True:
    C = C - B
    A = A - D
    
    if C < 1:
        print('Yes')
        break
    
    elif A < 1:
        print('No')
        break

Submission status: Accepted

Solution code:
a,b,c,d = map(int, input().split())
turn = 0
while a>0 and c>0:
    if not turn:
        c=c-b
        turn = 1
    else:
        a=a-d
        turn = 0

if not turn:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
import sys
stdin = sys.stdin
     
pi=3.1415
import sys
stdin = sys.stdin
     
pi=3.1415
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))

A,B,C,D=nm()

T=0
while(A>0 and C>0):
    if(T==0):
        C-=B
        T=1
    else:
        A-=D
        T=0

print('Yes' if T==1 else 'No')

Submission status: Accepted

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

while True:
    C = C - B
    if C > 0:
        pass
    else:
        print('Yes')
        break
    A = A - D
    if A > 0:
        pass
    else:
        print('No')
        break

Submission status: Accepted

Solution code:
a,b,c,d=[int(x) for x in input().split()]
if (c-1)//b > (a-1)//d:
  print("No")
else:
  print("Yes")

Submission status: Accepted

Solution code:


def main():
    args = input().rstrip().split(' ')
    A, B, C, D = int(args[0]),int(args[1]),int(args[2]), \
                 int(args[3])
    chance = A / D
    if(chance.is_integer() == False):
        chance = int(chance) + 1
    
    if(C <= B*chance):
        print('Yes')
    else:
        print('No')
    
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a=input()
a=a.split()
b=0
while b==0:
    
    a[2]=int(a[2])-int(a[1])
    if int(a[2])<=0:
        print("Yes")
        break
    a[0]=int(a[0])-int(a[3])
    if int(a[0])<=0:
        print("No")
        break

Submission status: Accepted

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

while (A > 0) & (C > 0):
    C = C - B
    if(C > 0):
        pass
    else:
        print('Yes')
        break
    A = A - D
    if(A > 0):
        pass
    else:
        print('No')
        break

Submission status: Accepted

Solution code:
A,B,C,D=(int(x) for x in input().split())
T=(C + B - 1) // B
AO=(A + D - 1)// D
if T<=AO:print("Yes")
else:print("No")

Submission status: Accepted

Solution code:
from sys import stdin
a,b,c,d = [int(x) for x in stdin.readline().rstrip().split()]
if a % d == 0:
    aa = a / d
else:
    aa = a//d +1
if c % b == 0:
    bb = c / b
else:
    bb = c//b +1
if aa >= bb:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

t,a=l[0],l[2]
tc,ac=0,0

while t>0:
    t=t-l[3]
    tc+=1
while a>0:
    a=a-l[1]
    ac+=1


if tc>=ac:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
A,B,C,D=map(int,input().split())
while 0==0:
    if B>=C:
        print("Yes")
        break
    elif D>=A:
        print("No")
        break
    else:
        C -= B
        A -=D

Submission status: Accepted

Solution code:
#! env/bin/local python3
# -*- coding:utf-8 -*-

# -- submit ----

# --- fetch input ---
inputs: list = []
while True:
    try:
        inputs.append(input().strip('\n'))
    except EOFError:
        break

# --- write code below ---

a, b, c, d = [int(i) for i in inputs[0].split(' ')]

takahashi = {
    'attack': b,
    'hp': a
}
aoki = {
    'attack': d,
    'hp': c
}


def battle(direction=True):

    if direction:
        aoki['hp'] -= takahashi['attack']
    else:
        takahashi['hp'] -= aoki['attack']

    if aoki['hp'] <= 0:
        print('Yes')
        return None
    if takahashi['hp'] <= 0:
        print('No')
        return None

    if direction:
        battle(direction=False)
    else:
        battle(direction=True)


battle(direction=True)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**6)
A, B, C, D = map(int, input().split())
 
while (True):
    C -=B
    if C<= 0:
        print ("Yes")
        break
    A -=D
    if A<= 0:
        print ("No")
        break

Submission status: Accepted

Solution code:
class Monster():
    def __init__(self, health, attack):
        self.hlt = health
        self.atk = attack

    def attack(self, opponent):
        opponent.hlt -= self.atk


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

takahashi = Monster(a, b)
aoki = Monster(c, d)
players = [takahashi, aoki]
while True:
    attacker, attackee = players
    attacker.attack(attackee)
    if attackee.hlt <= 0:
        break
    players.reverse()

print('Yes' if takahashi.hlt > 0 else 'No')

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
if A%D == 0:
  if C-B*(A//D) > 0:
    print("No")
  else:
    print("Yes")
else:
  if C-B*(A//D+1) > 0:
    print("No")
  else:
    print("Yes")