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):
T_HP, T_AT, A_HP, A_AT = map(int, input().split())
while True:
  A_HP -= T_AT
  if A_HP <= 0:
    print("Yes")
    break
  T_HP -= A_AT
  if T_HP <= 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):
import numpy as np


def main():
    a, b, c, d = map(int, input().split())
    cb = np.ceil(c / b)
    da = np.ceil(a / d)
    if cb <= da:
        print('Yes')
    else:
        print('No')


if __name__ == "__main__":
    main()

Solution (Python):
A, B, C, D = [int(n) for n in input().split()]
for _ in range(100):
    C = C - B
    if C <= 0:
        break
    A = A - D
    if A <= 0:
        break
print('Yes' if C <= 0 else 'No')

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):
A,B,C,D=map(int,input().split( ))

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

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())
n = 1
while A > 0 and C > 0:
  if n % 2 == 1:
    C = C - B
    ans = "Yes"
    n = n + 1
  else:
    A = A - D
    ans = "No"
    n = n + 1
    
print(ans)

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

Solution (Python):
a, b, c, d = map(int, input().split())
import math
p = math.ceil(a/d)
q = math.ceil(c/b)
if p < q:
  print("No")
else:
  print("Yes")

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

c1 = (C+B-1) // B  
c2 = (A+D-1) // D



if c1 == c2:
    ans = 'Yes'
elif c1 < c2:
    ans = 'Yes'
else:
    ans = 'No'

print(ans)

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

ans = None
while True:
    C -= B
    if C <= 0:
        ans = 'Yes'
        break
    A -= D
    if A <= 0:
        ans = 'No'
        break

print(ans)

Solution (Python):
a,b,c,d = list(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):
def solve(a, b, c, d):
    f = True
    while a > 0 and c > 0:
        if f:
            c -= b
            f = False
        else:
            a -= d
            f = True
    if a > 0:
        return 'Yes'
    else:
        return 'No'


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

Solution (Python):
import itertools
import math

a, b, c, d = map(int, input().split())
count = 0
if(a // d > c // b):
    count = c//b
else:
    count = a//d

c -= b*count
a -= d*count
if c==0:
    print("Yes")
    quit()
if a==0:
    print("No")
    quit()

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

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

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

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

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

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 or c > 0:
    if c - b <= 0:
        print('Yes')
        break
    else:
        c = c - b
    if a - d <= 0:
        print('No')
        break
    else:
        a = a - d

Solution (Python):





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

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())
counta = math.ceil(A/D)
countb = math.ceil(C/B)

if counta>=countb:
    print("Yes")
else :
    print("No")

Solution (Python):
import math

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

qlock_takahashi = math.ceil(C/B)
qlock_aoki = math.ceil(A/D)

if(qlock_takahashi <= qlock_aoki) :
  print("Yes")
else :
  print("No")

Solution (Python):
a,b,c,d = [int(i) for i in input().split()]
while True:
  c -= b
  if c<=0:
    print('Yes')
    break
  a -= d
  if a<=0:
    print('No')
    break

Solution (Python):
import sys

input_methods=['clipboard','file','key']
using_method=0
input_method=input_methods[using_method]

IN=lambda : map(int, input().split())
LIN=lambda : list(IN())
mod=1000000007



def main():
	
	t_hp, t_at, a_hp, a_at = IN()
	
	i=0
	while t_hp > 0 and a_hp>0:
		if i % 2 == 0:
			a_hp-=t_at
		else:
			t_hp -= a_at
		i+=1
	ret = 'Yes' if t_hp > 0 else 'No'
	print(ret)
	
	

isTest=False

def pa(v):
	if isTest:
		print(v)
		
def input_clipboard():
	import clipboard
	input_text=clipboard.get()
	input_l=input_text.splitlines()
	for l in input_l:
		yield l

if __name__ == "__main__":
	if sys.platform =='ios':
		if input_method==input_methods[0]:
			ic=input_clipboard()
			input = lambda : ic.__next__()
		elif input_method==input_methods[1]:
			sys.stdin=open('inputFile.txt')
		else:
			pass
		isTest=True
	else:
		pass
		
			
	ret = main()
	if ret is not None:
		print(ret)

Solution (Python):






import math

def battle_v1(A: int, B: int, C: int, D: int) -> str:
    while True:
        C -= B
        if C <= 0:
            return 'Yes'

        A -= D
        if A <= 0:
            return 'No'

def battle_v2(A: int, B: int, C: int, D: int) -> str:
    n = math.ceil(C / B)
    m = math.ceil(A / D)

    if n > m:
        return 'No'
    else:
        return 'Yes'

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

Solution (Python):








def battle(A: int, B: int, C: int, D: int) -> str:
    while True:
        C -= B
        if C <= 0:
            return 'Yes'

        A -= D
        if A <= 0:
            return 'No'

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

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

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

Solution (Python):
a, b, c, d = [int(x) for x in 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 or c >= 0:
	c -= b
	a -= d
	if c <= 0:
		print('Yes')
		exit()
	if a <= 0:
		print('No')
		exit()

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()))
i = 0
while a > 0 and c > 0:
    if i%2: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 -= b
    if c <= 0:
        print("Yes")
        exit()
    a -= d
    if a <= 0:
        print("No")
        exit()

Solution (Python):
import sys

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

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

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

import math

T = math.ceil(A / D)
M = math.ceil(C / B)

if T >= M:
    print('Yes')
else:
    print('No')

Solution (Python):



def main():
    t_HP, t_AT, a_HP, a_AT = map(int, input().split())

    while True:
        a_HP -= t_AT
        if a_HP <= 0:
            print('Yes')
            return
        t_HP -= a_AT
        if t_HP <= 0:
            print('No')
            return


if __name__ == "__main__":
    main()

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

Solution (Python):
import math

a,b,c,d = map(int, input().split())
turn1 = math.ceil(c/b)
turn2 = math.ceil(a/d)
if turn1 <= turn2:
    print('Yes')
else:
    print('No')

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

taka_life = A
taka_att = B
ao_life = C
ao_att = D

while((taka_life > 0) & (ao_life > 0)):
    ao_life -= taka_att
    taka_life -= ao_att
    
    
if(ao_life <= 0):
    print("Yes")
else:
    print("No")

Solution (Python):
import math

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

A = int(A)  
B = int(B)  
C = int(C)  
D = int(D)  

E = math.ceil(C/B)  
F = math.ceil(A/D)  

if E <= F:
    print('Yes')
else:
    print('No')

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

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

Solution (Python):
import math
a,b,c,d=map(int,input().split())
e=math.ceil(c/b)
f=math.ceil(a/d)
if e>f:
  print('No')
elif e==f:
  print('Yes')
else:
  print('Yes')

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

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

Solution (Python):
a,b,c,d= map(int,input().split())
x=0
y=0
x = int(-(-a//d))
y = int(-(-c//b))

if x < y :
    print('No')
else:
    print('Yes')

Solution (Python):

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

while a > 0 or c >0:
    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())
    k1 = (b + c - 1) // b
    k2 = (d + a - 1) // d
    if k1 > k2:
        print('No')
    else:
        print('Yes')
    return

if __name__ == "__main__":
    main()

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

Solution (Python):
monstor_param = input().split()

takahashi_hp = int(monstor_param[0])
takahashi_ap = int(monstor_param[1])
aoki_hp = int(monstor_param[2])
aoki_ap = int(monstor_param[3])

result = "No"

while takahashi_hp >= 0 or aoki_hp >= 0:
    aoki_hp = aoki_hp - takahashi_ap
    if aoki_hp <= 0:
        result = "Yes"
        break
    else:
        takahashi_hp = takahashi_hp - aoki_ap
        if takahashi_hp <= 0:
            break

print(result)

Solution (Python):
a, b, c, d = (int(a) for a in 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  = 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):
import sys
A, B, C, D = map(int, input().split())

while A > 0:
  C -= B
  if(C <= 0):
    print('Yes')
    sys.exit()
  else:
    A -= D

print('No')

Solution (Python):




import sys
from io import StringIO
import unittest

def yn(b):
    print("Yes" if b==1 else "No")
    return

def resolve():
    readline=sys.stdin.readline

    a,b,c,d=map(int, readline().rstrip().split())
    tHP=a
    tATC=b
    aHP=c
    aATC=d
    while 1:
        aHP-=tATC
        if aHP<=0:
            print("Yes")
            return
        tHP-=aATC
        if tHP<=0:
            print("No")
            return
    return

if 'doTest' not in globals():
    resolve()
    sys.exit()

Solution (Python):
a,b,c,d = map(int,input().split())
while c > 0:
    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())
x=(a//d)+1 if a%d!=0 else a//d
y=(c//b)+1 if c%b!=0 else c//b
print("Yes" if x>=y else "No")

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):
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())
print('Yes' if (c-1)//b+1<=(a-1)//d+1 else 'No')

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

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

Solution (Python):
import math

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

if math.ceil(C / B) > math.ceil(A / D):
    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())

turn = True

while A > 0 and C > 0:
  if turn:
    C -= B
  else:
    A -= D
  
  turn = not turn

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

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

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

print(ans)

Solution (Python):
A,B,C,D=map(int,input().split())
while A and C > 0:
    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())
n=1
while c-n*b>0 and a-n*d>0:
  n+=1
print('Yes' if c-n*b<=0 else 'No')

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

Solution (Python):
import math
tl, ta, al, aa = map(int, input().split(" "))
print("Yes" if math.ceil(al/ta) - 1 < math.ceil(tl / aa) else "No")

Solution (Python):
import sys
sys.setrecursionlimit(10**7)
input = lambda: sys.stdin.readline().strip()

def main():
    A,B,C,D = map(int,input().split())
    takahashi_num = int(C/B) if C%B==0 else int(C/B)+1
    aoki_num = int(A/D) if A%D==0 else int(A/D)+1
    print("Yes" if takahashi_num<=aoki_num else "No")

main()

Solution (Python):
A, B, C, D = [int(_) for _ in input().split()]
if (C + B - 1)//B <= (A + D - 1)//D:
    print('Yes')
else:
    print('No')

Solution (Python):
A, B, C, D = [int(_) for _ in input().split()]
if C//B + int(bool(C%B)) <= A//D + int(bool(A%D)):
    print('Yes')
else:
    print('No')

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

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

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
mod2 = 998244353
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)


def main():
    a,b,c,d = LI()
    while True:
        c -= b
        if c < 1:
            return "Yes"
        a -= d
        if a < 1:
            return "No"

    return -1


print(main())

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

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

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=input().split()
a,b,c,d=int(A),int(B),int(C),int(D)
while True:
    if a>0 and c>0:
        c=c-b
    else:
        print("No")
        break
    if a>0 and c>0:
        a=a-d
    else:
        print("Yes")
        break

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

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

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

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

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



while A > 0 and C > 0:
  C = C - B
  if C <= 0:
    break
  A = A - D

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

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

TyokudaiWin = True

for i in range(100):
    c -= b
    if c <= 0:
        break
    a -= d
    if a <= 0:
        TyokudaiWin = False
        break

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

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

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

while (a>0)&(c>0):
    c-=b
    a-=d

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

Solution (Python):
inp_ls = input().split(" ")
a,b,c,d = [int(e) for e in inp_ls[:4]]

turn = 0
while True:
	if a <= 0:
		print("No")
		break
	if c <= 0:
		print("Yes")
		break
	if turn % 2 == 0:
		c -= b
	else:
		a -= d
	turn += 1

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

while A > 0 or C > 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())
ta = math.ceil(c / b)
ao = math.ceil(a / d)

if ao < ta:
    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):

import sys

YES = "Yes"  
NO = "No"  

def count(hp, attack):
    return hp // attack + (0 if hp % attack == 0 else 1)

def solve(A: int, B: int, C: int, D: int):
    print( "Yes" if count(C, B) <= count(A, D) else "No")
    return



def main():
    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))  
    solve(A, B, C, D)

if __name__ == '__main__':
    main()

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

int1 = lambda x: int(x) - 1
def II(): return int(input())

def MI(): return map(int, input().split())
def MI1(): return map(int1, input().split())

def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

INF = float('inf')

def solve():
    a, b, c, d = MI()

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


if __name__ == '__main__':
    solve()

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

Solution (Python):



import sys
sys.setrecursionlimit(10**7)
from pprint import pprint as pp
from pprint import pformat as pf

import math

import bisect

class Monster:
    def __init__(self, hp, atk):
        self.hp = hp
        self.atk = atk

    def __repr__(self):
        return "hp {} atk {}".format(self.hp, self.atk)

    def atack(self, opponent):
        opponent.hp -= self.atk
        if opponent.hp <= 0:
            return True
        else:
            return False

def battle(x, y):
    while True:
        
        
        
        
        if x.atack(y):
            return True
        
        
        
        
        if y.atack(x):
            return False

if __name__ == '__main__':
    a, b, c, d = list(map(int, input().split()))
    takahashi = Monster(a, b)
    aoki = Monster(c, d)
    if battle(takahashi, aoki):
        print("Yes")
    else:
        print("No")

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

turn = 0
state = [[a, b], [c, d]]

while state[0][0] > 0 and state[1][0] > 0:
    opp = 1 - turn
    state[opp][0] = state[opp][0] - state[turn][1]
    turn = opp

if state[0][0] <= 0:
    print("No")
else:
    print("Yes")

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

i = 0

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

Solution (Python):
taka_f,taka_p,aoki_f,aoki_p = map(int,input().split())
taka_life_span = -(-taka_f//aoki_p)
aoki_life_span = -(-aoki_f//taka_p)
print("Yes" if taka_life_span >= aoki_life_span else "No")

Solution (Python):
t_hp, t_atk, a_hp, a_atk = map(int, input().split())
t_life_span = -(-t_hp//a_atk)
a_life_span = -(-a_hp//t_atk)

print("Yes" if t_life_span >= a_life_span else "No")

Solution (Python):
taka_f,taka_p,aoki_f,aoki_p = map(int,input().split())

while True:
    aoki_f -= taka_p
    if  aoki_f < 1:
        print("Yes")
        exit()
    taka_f -= aoki_p
    if taka_f < 1:
        print("No")
        exit()

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())
x = int((a+d-1) / d)
y = int((b+c-1) / b)
if x >= y:
  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())
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):
mon = list(map(int,input().split()))

while mon[0] > 0:
        mon[2] = mon[2] - mon[1]
        if (mon[2] <= 0):
                print ("Yes")
                break
        else:
                mon[0] = mon[0] - mon[3]
                if (mon[0] <= 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())
count = 0

while(a>0 and c>0):
  if count%2 == 1:
    a -= d
  else:
    c -= b
  count += 1
  
if a<=0:
  print('No')
else:
  print('Yes')

Solution (Python):
A, B, C, D = map(int, input().split())
for i in range(10**3):
    if i % 2 == 0:
        C -= B
        if C <= 0:
            print("Yes")
            exit()
    else:
        A -= D
        if A <= 0:
            print("No")
            exit()

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

for _ in range(10000):
  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(" ")]
attack_round_a = c // b if c % b == 0 else c // b + 1
attack_round_b = a // d if a % d == 0 else a // d + 1
print('Yes' if attack_round_a <= attack_round_b else 'No')

Solution (Python):
n = list(map(int,input().split()))

tairyoku1 = n[0]
tairyoku2 = n[2]

while True:
    tairyoku2 = tairyoku2 - n[1]
    if tairyoku2 <= 0:
        print("Yes")
        exit()
    tairyoku1 = tairyoku1 - n[3]
    if tairyoku1 <= 0:
        print("No")
        exit()

Solution (Python):
A,B,C,D = map(int,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())

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())
taka=[A,B]
ao=[C,D]
import sys
while True:
    ao[0]-=taka[1]
    if ao[0]<=0:
        print('Yes')
        sys.exit()
    taka[0]-=ao[1]
    if taka[0]<=0:
        print('No')
        sys.exit()

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())
while B or D <= 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 1:
    if a > 0:
        c = c - b
    else:
        break
    if c > 0:
        a = a - d
    else:
        break
        
if a > 0:
    print('Yes')
else:
    print('No')

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

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

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

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

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 True:
    c -= b
    if c <= 0:
        print("Yes")
        exit()
    a -= d 
    if a <= 0:
        print("No")
        exit()

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

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

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

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

while a >= 0 or c >= 0:
    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
  a-=d
if a<=0 and c>0:
  print("No")
elif c<=0 and a>0: 
  print("Yes")
elif a<=0 and c<=0:
  print("Yes")

Solution (Python):
import math
a,b,c,d = map(int,input().split())
x=c/b
y=a/d
x=math.ceil(x)
y=math.ceil(y)
if x<=y:
  print("Yes")
else:
  print("No")

Solution (Python):
A_HP, A_ATK, B_HP, B_ATK = map(int, input().split())

f = False
while A_HP > 0 and B_HP > 0:
  
  B_HP -= A_ATK

  if B_HP <= 0:
    f = True
    break

  
  A_HP -= B_ATK

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

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

if A % D == 0:
    aoki_turn = A // D
else:
    aoki_turn = A // D + 1

if C % B == 0:
    taka_turn = C // B
else:
    taka_turn = C // B + 1

if taka_turn <= aoki_turn:
    print('Yes')
else:
    print('No')

Solution (Python):
a, b, c, d = map(int, input().split())
e = -(-c//b)
f = -(-a//d)
if e <= f:
  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):
tkhp, tkat, aohp, aoat = list(map(int, input().split()))

while True:
    aohp = aohp - tkat
    if aohp <= 0:
        print('Yes')
        break

    tkhp = tkhp - aoat
    if tkhp <= 0:
        print('No')
        break

Solution (Python):
def main():
    abcd = list(map(int, input().split()))
    aok = (abcd[2]-1) // abcd[1]
    tac = (abcd[0]-1) // abcd[3]
    print('Yes' if tac >= aok else 'No')

if __name__ == '__main__':
    main()

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())
  a = math.ceil(C / B)
  b = math.ceil(A / D)

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


if __name__ == '__main__':
  main()