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

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

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

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

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

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

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

Solution (Python):
import math

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

num1 = math.ceil(c / b)
num2 = math.ceil(a / d)

if num1 <= num2:
    print('Yes')
else:
    print('No')

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

Solution (Python):
A,B,C,D = map(int,input().split())
 
Takahashi = A
Aoki = C
 
while Takahashi >= 0 or Aoki >=0:
  Aoki -= B
  if Aoki <= 0:
    print('Yes')
    break
  Takahashi -= D
  if Takahashi <= 0:
    print('No')
    break

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

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

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

i = 0
while True:
  if i % 2 == 0:
    C -= B
    if C <= 0:
      print("Yes")
      break
  else:
    A -= D
    if A <= 0:
      print("No")
      break
  i += 1

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

turn = 1
while True:

    
    if turn % 2 != 0:
        C = C - B
        pass
    
    else:
        A = A - D
        pass

    if A <= 0 or C <= 0:
        break
    turn += 1

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

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

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

Solution (Python):
from sys import stdin, setrecursionlimit


def main():
    input = stdin.buffer.readline
    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


if __name__ == "__main__":
    setrecursionlimit(10000)
    main()

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

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

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

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

Solution (Python):
A, B, C, D = [ int(i) for i in input().strip().split(' ')]
while True:
    C -= B
    if C <= 0:
        print('Yes')
        break
    A -= D
    if A <= 0:
        print('No')
        break

Solution (Python):
th, ta, ah, aa = [int(x) for x in input().split(' ')]

index = 0
while (th > 0 and ah > 0):
    if index % 2 == 0:
        ah -= ta
    else:
        th -= aa

    index += 1

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

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

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

Taka = A
Aoki = C

while Taka > 0 and Aoki > 0:
  Aoki -= B
  Taka -= D

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

Solution (Python):
il = [int(k) for k in input().split()]
A = il[0]
B = il[1]
C = il[2]
D = il[3]

import math

t = math.ceil(C/B)
a = math.ceil(A/D)

if t <= a:
    print("Yes")
else:
    print("No")

Solution (Python):
t_hp_str,t_atack_str,a_hp_str,a_atack_str= input().split()
t_hp = int(t_hp_str)
t_atack = int(t_atack_str)
a_hp=int(a_hp_str)
a_atack = int(a_atack_str)

for num in range(300):
  if num%2 == 0:
    a_hp = a_hp - t_atack
    if a_hp <= 0:
      print("Yes")
      break
  else:
    t_hp = t_hp - a_atack
    if t_hp <= 0:
      print("No")
      break

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
    a,b,c,d=map(int,input().split())
    x=-(-c//b)
    y=-(-a//d)
    if x<=y:
        print("Yes")
    else:
        print("No")

if __name__=='__main__':
    main()

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

cnt = 0
while ((A > 0) and (C > 0)):
    if cnt % 2 == 0:
        C -= B
    else:
        A -= D
    cnt += 1

if A <= 0:
    print('No')
else:
    print('Yes')

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

for i in range(101):
    C=C-B
    A=A-D
    if C<=0:
        print('Yes')
        break
    elif A<=0:
        print('No')
        break
    else:
        continue

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

ans = "Yes"
turn = 1
while(1):
    if turn == 1:
        C -= B
        if C <= 0:
            break
    else:
        A -= D
        if A <= 0:
            ans = "No"
            break
    turn *= -1

print(ans)

Solution (Python):
import sys
input=lambda: sys.stdin.readline().rstrip()
a,b,c,d=map(int,input().split())
t=0
while True:
  if t==0:
    c-=b
    if c<=0:
      print("Yes")
      break
    t=1
  else:
    a-=d
    if a<=0:
      print("No")
      break
    t=0

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

tairyoku_a = a 
tairyoku_b = c 

count = 0

while tairyoku_a > 0 and tairyoku_b > 0:
    if count%2 ==0: 
        tairyoku_b = tairyoku_b - b
    else: 
        tairyoku_a = tairyoku_a - d
    count += 1
    

if tairyoku_a > 0:
    print("Yes")
else:
    print("No")

Solution (Python):
from math import ceil
A, B, C, D = map(int, input().split())
t_s = ceil(C/B)
a_s = ceil(A/D)

if ( t_s - a_s < 1 ):
  print("Yes")

else:
  print("No")

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

t_hp = a
a_hp = c

while True:
    a_hp -= b
    if a_hp <= 0:
        print('Yes')
        exit(0)
    t_hp -= d
    if t_hp <= 0:
        print("No")
        exit(0)

Solution (Python):
def solve(string):
    a, b, c, d = map(int, string.split())
    return "No" if (a - 1) // d + 1 < (c - 1) // b + 1 else "Yes"


if __name__ == '__main__':
    import sys
    print(solve(sys.stdin.read().strip()))

Solution (Python):
A, B, C, D = map(int, input().split())
result = ""

while True:
    C -= B
    if C <= 0:
        result = "Yes"
        break

    A -= D
    if A <= 0:
        result = "No"
        break

print(result)

Solution (Python):
from math import ceil

a, b, c, d = map(int, input().split())
n_a = ceil(c/b)
n_c = ceil(a/d)

if n_a <= n_c:
    print('Yes')
else:
    print("No")

Solution (Python):



import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

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

Solution (Python):
A, B, C, D = [int(x) for x in input().split()]
run = True
while run:
    C -= B
    if C <= 0:
        run = False
        result = "Yes"
        continue
    A -= D
    if A <= 0:
        run = False
        result = "No"
        continue
print(result)

Solution (Python):
def main():
    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
    return


if __name__ == "__main__":
    main()

Solution (Python):
Taka_T,Taka_A,Aoki_T,Aoki_A= map(int, input().split())

while True:
    Aoki_T = Aoki_T - Taka_A
    Taka_T = Taka_T - Aoki_A
    if Aoki_T <= 0:
        print("Yes")
        break
    elif Taka_T <= 0:
        print("No")
        break

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

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

Solution (Python):
def main():
    A,B,C,D=map(int,input().split())
    t=True
    while A>0 and C>0:
        if t: C-=B
        else: A-=D
        t=not t
    if A<=0: print('No')
    elif C<=0: print('Yes')

if __name__=='__main__':
    main()

Solution (Python):
import math
A, B, C, D = list(map(int, input().split()))



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

Solution (Python):
A, B, C, D = map(int,input().split())
n = 0
m = 0

while C > 0:
    n += 1
    C -= B

while A > 0:
    m += 1
    A -= D

if n > m:
    print('No')
else:
    print('Yes')

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

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

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

Solution (Python):


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


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

Solution (Python):
A,B,C,D=map(int,input().split())
t =0
while True:
  t+=1
  if t%2==1:
    C -=B
    if C <=0:
      print('Yes')
      break
  else:
    A -=D
    if A <=0:
      print('No')
      break

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

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

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

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

Solution (Python):
r = list(map(int, input().split()))
a, b = r[0], r[1]
c, d = r[2], r[3]
while(1):
    c-=b
    if c<=0:
        print("Yes")
        break
    a-=d
    if a<= 0:
        print("No")
        break

Solution (Python):



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

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

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

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

atack_t = -(-c // b)
atack_a = -(-a // d)
print('No' if atack_t > atack_a else 'Yes')

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

for i in range(100):
    c -= b

    if (c <= 0):
        print('Yes')
        quit()

    a -= d

    if (a <= 0):
        print('No')
        quit()

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

from math import ceil
if ceil(A/D) >= ceil(C/B):
    print("Yes")
    exit()

print("No")

Solution (Python):
a,b,c,d = map(int, input().split())
while a > 0:
    c -=b
    if c <= 0:
        print("Yes")
        exit()
    a -= d
print("No")

Solution (Python):
import sys
import math

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

while True:
    C = C - B
    if 0 >= C:
        print('Yes')
        break

    A = A - D
    if 0 >= A:
        print('No')
        break

Solution (Python):
import sys
from collections import deque
import copy
def main():
    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()


if __name__ == '__main__':
    main()

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

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

Solution (Python):
import sys
import heapq
sys.setrecursionlimit(10**6)
input = lambda: sys.stdin.readline().rstrip()

from math import ceil
A,B,C,D = map(int,input().split())

taka_atk_num = ceil(C/B)
aoki_atk_num = ceil(A/D)

if aoki_atk_num < taka_atk_num:
    print("No")
else:
    print("Yes")

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

Solution (Python):
a,b,c,d = map(int,input().split())
print('YNeos'[(c-1)//b>(a-1)//d::2])

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

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

Solution (Python):
A, B, C, D = map(int, input().split())
print('Yes' if (A+D-1)//D >= (C+B-1)//B else 'No')

Solution (Python):



def main():
    takahashi_physical,takahashi_offensive,aoki_physical,aoki_offensive = map(int,input().split())
    
    offence_turn = 0
    while True:
        offence_turn = offence_turn % 2
        
        if offence_turn == 0:
            aoki_physical -= takahashi_offensive
        else:
            takahashi_physical -= aoki_offensive
        
        if takahashi_physical <= 0:
            break
        if aoki_physical <= 0:
            break
        offence_turn += 1
        
    if offence_turn == 0:
        print("Yes")
    else:
        print("No")
    

if __name__ == "__main__":
    main()

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

Solution (Python):
import math

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

a=math.ceil(C/B)
b=math.ceil(A/D)

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

Solution (Python):

A, B, C, D = map(int, input().split())
thp = (A+D-1)//D
ahp = (C+B-1)//B
if thp >= ahp:
    print('Yes')
else:
    print('No')

Solution (Python):
import math

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

tkhs = math.ceil(c/b)
aok = math.ceil(a/d)

if tkhs <= aok:
    print('Yes')
else:
    print('No')

Solution (Python):
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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


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

Solution (Python):
import math

def main():
    A,B,C,D = list(map(int, input().split()))
    
    print("Yes" if math.ceil(C / B) <= math.ceil(A / D) else "No")
    pass

if __name__ == '__main__':
    main()

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

Solution (Python):
import math

A, B, C, D = map(int, input().split())
if math.ceil(C / B) <= math.ceil(A / D):
    print("Yes")
else:
    print("No")

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

Solution (Python):
A,B,C,D = map(int,(input().split()))
i=0
while(A>0 and C>0):
  if(i%2==0):
    C-=B
  else:
    A-=D
  i+=1
if(A>0):
  print("Yes")
else:
  print("No")

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

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

Solution (Python):
A, B, C, D  =  (int(i) for i in input().split())


for i in range(100):
    
    C = C - B
    
    if C <= 0:
        print('Yes')
        break
    
    A = A - D
    
    if A <= 0:
        print('No')
        break

Solution (Python):
A,B,C,D = map(int, input().split())
for i in range(1, 200):
  
  if i%2 != 0:
    C=C-B
    if C <=0:
      print('Yes')
      exit(0)
  else:
    A=A-D
    if A <=0:
      print('No')
      exit(0)

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

Solution (Python):
import math
def main():
    a,b,c,d = map(int, input().split())
    k1 = math.ceil(a/d)
    k2 = math.ceil(c/b)
    if k1==k2: print("Yes")
    elif k1>k2: print("Yes")
    else: print("No")

main()

Solution (Python):
x = input().split()
a = int(x[0])
b = int(x[1])
c = int(x[2])
d = int(x[3])

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

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

Solution (Python):
import math

nums = [int(e) for e in input().split()]

A = math.ceil(nums[2]/nums[1])
T = math.ceil(nums[0]/nums[3])
if A <= T:
    print('Yes')
else:
    print('No')

Solution (Python):
nums = [int(e) for e in input().split()]

if nums[2]%nums[1] == 0:
    A = nums[2]//nums[1]
else:
    A = nums[2]//nums[1] + 1

if nums[0]%nums[3] == 0:
    T = nums[0]//nums[3]
else:
    T = nums[0]//nums[3] + 1
 
if A <= T:
    print('Yes')
else:
    print('No')

Solution (Python):
nums = [int(e) for e in input().split()]

T = nums[0]
t = nums[1]
A = nums[2]
a = nums[3]
while T > 0 and A > 0:
    A = A - t
    T = T - a

if A <= 0:
    print('Yes')
else:
    print('No')

Solution (Python):
A, B, C, D = map(int, input().split())
if -(-C // B) <= -(-A // D):
    print('Yes')
else:
    print('No')

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

Solution (Python):
a, b, c, d = list(map(int, input().split()))
while a > 0:
    c -= b
    if c <= 0:
        print('Yes')
        exit()
    a -= d
print('No')

Solution (Python):
import math

i = list(map(int, input().split()))
turnT = math.ceil(i[0] / i[3]);
turnA = math.ceil(i[2] / i[1]);
        
if turnT >= turnA:
    print('Yes')
else:
    print('No')

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

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

Solution (Python):
A, B, C, D = map(int, input().split())
count = 0
while A > 0 and C > 0:
    count += 1
    if count % 2 == 1:
        C -= B
    else:
        A -= D
if count % 2 == 1:
    print('Yes')
else:
    print('No')

Solution (Python):
import math
[A, B, C, D] = list(map(int, input().split()))
X = math.ceil(A / D)
Y = math.ceil(C / B)
if Y > X:
    print('No')
else:
    print('Yes')

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

Solution (Python):
[A, B, C, D] = list(map(int, input().split()))
while A > 0:
    C -= B
    if C <= 0:
        print('Yes')
        break
    A -= D
    if A <= 0:
        print('No')
        break

Solution (Python):
from dataclasses import dataclass


@dataclass
class Monster:
    health: int
    strength: int

    def attack(self, other: "Monster"):
        other.health -= self.strength

    def is_dead(self) -> bool:
        return self.health <= 0


def battle(first: Monster, second: Monster) -> bool:
    while True:
        first.attack(second)
        if second.is_dead():
            return True

        second.attack(first)
        if first.is_dead():
            return False


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

    t_monster = Monster(health=a, strength=b)
    a_monster = Monster(health=c, strength=d)

    if battle(t_monster, a_monster):
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

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

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

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

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


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

Solution (Python):
import itertools
import math
import fractions
import functools
a, b, c, d = map(int, input().split())







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

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

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

Solution (Python):
T_HP, T_S, A_HP, A_S = list(map(int, input().split()))

T_Turn = True
while T_HP > 0 and A_HP > 0:
    if T_Turn:
        A_HP -= T_S
    else:
        T_HP -= A_S
    T_Turn = not T_Turn
if T_HP > 0:
    print("Yes")
else:
    print("No")

Solution (Python):


A, B, C, D = ( int(x) for x in input().split() )

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

Solution (Python):
a, b, c, d = map(int, input().split())
T = True
while a > 0 and c > 0:
    if T:
        c -= b
    else:
        a -= d
    T = not T

print("Yes" if a > 0 else "No")

Solution (Python):
import math


def main(a, b, c, d):
    tkhs = math.ceil(a / d)
    aok = math.ceil(c / b)

    if tkhs >= aok:
        return 'Yes'
    else:
        return 'No'


if __name__ == '__main__':
    A, B, C, D = map(int, input().split(' '))
    print(main(A, B, C, D))

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

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

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

t_num = math.ceil(c / b)
a_num = math.ceil(a / d)

if t_num <= a_num:
    print('Yes')
else:
    print('No')

Solution (Python):
from __future__ import annotations

from dataclasses import dataclass


@dataclass
class Monster:
    HP: int
    AT: int

    def dead(self):
        return self.HP <= 0

    def attack(self, other_monster: Monster):
        other_monster.HP -= self.AT


def actual(A, B, C, D):
    takahasi = Monster(A, B)
    aoki = Monster(C, D)

    while True:
        takahasi.attack(aoki)

        if takahasi.dead():
            return 'No'

        aoki.attack(takahasi)

        if aoki.dead():
            return 'Yes'

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

print(actual(A, B, C, D))

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

Solution (Python):


import sys

INF = 1145141919
YES = "Yes"  
NO = "No"  


def solve(A: int, B: int, C: int, D: int):
    while A > 0 and C > 0:
        C -= B
        if C <= 0:
            return YES
        A -= D
        if A <= 0:
            return NO


def main():

    sys.setrecursionlimit(10 ** 6)

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  
    B = int(next(tokens))  
    C = int(next(tokens))  
    D = int(next(tokens))  
    print(solve(A, B, C, D))


if __name__ == '__main__':
    main()

Solution (Python):
A,B,C,D=map(int,input().split())
ans="No"

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

print(ans)

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

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

while a > 0 and c > 0:
    c -= b
    if c <= 0:
        ret = 1
    else:
        a -= d
        if a <= 0:
            ret = 2

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

Solution (Python):
A,B,C,D=map(int,input().split())
x=0
y=0
while A>0:
    A=A-D
    x+=1
while C>0:
    C=C-B
    y+=1
if x>=y:
    print("Yes")
else:
    print("No")

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

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

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

Solution (Python):

import numpy as np

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

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

if a > 0:
    print('Yes')
else:
    print('No')

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

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

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

Solution (Python):
A,B,C,D = map(int, input().split())
x = int((A + D - 1) / D)
y = int((C + B - 1) / B)
if x >= y:
  print("Yes")
else:
  print("No")

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

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

Solution (Python):
a,b,c,d=map(int,input().split())
for i in range(120):
  c=c-b
  if c<=0:
    print("Yes")
    exit()
  a=a-d
  if a<=0:
    print("No")
    exit()

Solution (Python):
def main():
    import sys
    input=sys.stdin.readline
    import math
    a,b,c,d=map(int,input().split())
    x=math.ceil(c/b)
    y=math.ceil(a/d)
    if y<x:
        print("No")
    else:
        print("Yes")
if __name__ == '__main__':
    main()

Solution (Python):
A, B, C, D = map(int, input().split())
cnt = 0
while True:
  if cnt == 0:
    C -= B
    cnt = 1
    if C <= 0:
      print('Yes')
      break
  elif cnt == 1:
    A -= D
    cnt = 0
    if A <= 0:
      print('No')
      break

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

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

print("No")

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

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

if(flag==0):
    print("No")
else:
    print("Yes")

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

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

Solution (Python):
import math
A,B,C,D=map(int,input().split(" "))
if math.ceil(A/D)<math.ceil(C/B):
  print("No")
else:
  print("Yes")

Solution (Python):
a,b,c,d=map(int,input().split())
check=True
while True:
    if check:
        c-=b
        if c<=0:
            print("Yes")
            break
    else:
        a-=d
        if a<=0:
            print("No")
            break
    check=not check

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

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

Solution (Python):
a,b,c,d=map(int,input().split())
i=0
while a*c>0:
    if i%2==0:
        c+=(-b)
    else:
        a+=(-d)
    i+=1
    
if a>0:
    print("Yes")
else:
    print("No")

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

Solution (Python):
th, ta, ah, aa = list(map(int, input().split()))

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

Solution (Python):
a,b,c,d=map(int,input().split())
print('YNeos'[~-a//d<~-c//b::2])

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

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