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())
e=a//d
f=c//b
x=a-e*d
y=c-f*b
if x==y==0:
  if f<=e:
    print('Yes')
  else:
    print('N0')
elif x==0 and y!=0:
  if f+1<=e:
    print('Yes')
  else:
    print('No')
elif y==0 and x!=0:
  if f<=e+1:
    print('Yes')
  else:
    print('NO')
else:
  if f<=e:
    print('Yes')
  else:
    print('No')

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

Solution (Python):
a, b, c, d = map(int, input().split())
if c% b == 0:
    aoMake = (c//b)*2-1
else:
    aoMake = ((c//b)+1)*2-1

if a%d == 0:
    takaMake = (a//d)*2
else:
    takaMake = ((a//d)+1)*2

if takaMake > aoMake:
    print("Yes")
else:
    print("No")

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

if math.ceil(a/d) >= math.ceil(c/b):
    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=(int(i) for i in input().split())
x=c//b
if c%b!=0:
  x+=1
y=a//d
if a%d!=0:
  y+=1
if x<=y:
  print('Yes')
else:
  print('No')

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

Solution (Python):
def fight(p1, p2):
    p2['hp'] -= p1['attack']
    return p2['hp']

items = list(map(lambda x: int(x), input().split()))
takahashi = {
    'hp': items[0],
    'attack': items[1]
}
aoki = {
    'hp': items[2],
    'attack': items[3]
}
i = 0
while True:
    if i % 2 == 0:
        hp = fight(takahashi, aoki)
    else:
        hp = fight(aoki, takahashi)
    
    if hp <= 0:
        print('Yes' if i % 2 == 0 else 'No')
        break
    i += 1

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

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

if a%d==0:
    last_ao=0
else:
    last_ao=1
    
if c%b==0:
    last_taka=0
else:
    last_taka=1
    
if (a//d +last_ao) >= (c//b + last_taka):
    print("Yes")
else:
    print("No")

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

num_attack_taka = -(-C // B)
num_attack_aoki = -(-A // D)

if num_attack_taka <= num_attack_aoki:
    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 = (int(i) for i 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 and c >= 0:
    if c - b > 0:
        c -= b
    else:
        print("Yes")
        exit()

    if a - d > 0:
        a -= d
    else:
        print("No")
        exit()

Solution (Python):
A, B, C, D =  map(int, input().split())
T_count = 0 
A_count = 0
for i in range(100):
    C -= B
    T_count += 1
    if C <= 0:
        break

for j in range(100):
    A -= D
    A_count += 1
    if A <= 0:
        break

if T_count <= A_count:
    print('Yes')
else:print('No')

Solution (Python):
A1, A2, B1, B2 = map(int, input().split())

while True:
    B1-=A2
    if B1<=0:
        print('Yes')
        break
    A1-=B2
    if A1<=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") 
        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(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
print('Yes' if c <= 0 else 'No')

Solution (Python):
import math

A, B, C, D = list(map(int, input().split()))
tak = math.ceil(A / D)
aok = math.ceil(C / B) 
print(('No', 'Yes')[tak - aok > -1])

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(c>0 and a>0):
  c -= b
  if (c<=0):
    flag = 1
  a -= d
  if (a<=0 and c>0):
    flag = 2
if (flag == 1):
  print('Yes')
else:
  print('No')

Solution (Python):
a,b,c,d = map(int,input().split())
while(a>0 and c>0):
    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())
cb = c-b
ad = a-d
while True:
    if cb<=0:
        print("Yes")
        exit()
    elif ad <=0:
        print("No")
        exit()
    else:
        cb -= b
        ad -= d

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

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

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

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

lifeT = A
lifeA = C

while True:
    lifeA -= B
    if lifeA<=0:
        print('Yes')
        break
    lifeT -= D
    if lifeT<=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
print("Yes" if C<=0 else "No")

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

while True:
    B[2] = int(B[2]) - int(B[1])
    B[0] = int(B[0]) - int(B[3])
    if int(B[2]) <= 0:
        print("Yes")
        break
    elif int(B[0]) <= 0:
        print("No")
        break

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

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

Solution (Python):
t,s1,a,s2 = map(int,input().split())
i = True
while(i):
    a = a - s1
    if (a <= 0):
        print("Yes")
        break
    t = t - s2
    if(t <= 0):
        print("No")
        break

Solution (Python):
import math
a, b, c, d = list(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())
bl = False
while True:
    if bl:
        a -= d
        bl = False
    else:
        c -= b
        bl = True
    if a <= 0:
        print("No")
        break
    elif c <= 0:
        print("Yes")
        break

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


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

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
print("Yes" if C<=0 else "No")

Solution (Python):
A, B, C, D = map(int, input().split())
i = 0
while C - B * i > 0:
  i += 1

j = 0
while A - D * j > 0:
  j += 1
  
if i <= j:
  print("Yes")
else:
  print("No")

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

i = 0

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

Solution (Python):
def attack(players_list, attacker_no, defender_no):
  players_list[defender_no][0] = players_list[defender_no][0] - players_list[attacker_no][1]
  return [players_list, players_list[defender_no][0]]

inputs = input().split(' ')

for i in range(0, 4):
  inputs[i] = int(inputs[i])

tk = [inputs[0], inputs[1]]
ao = [inputs[2], inputs[3]]

players_list = (tk, ao)

order = 0;
while True:
  result = attack(players_list, order % 2, ((order + 1 ) % 2))
  
  if (result[1] <= 0):
    if(order % 2 == 0):
      print("Yes")
    else:
      print("No")
      
    break;
  order+=1;

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()

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

  a = A
  c = C
  for i in range(200):
    if i%2 == 0:
      c -= B
      if c <= 0:
        print('Yes')
        return
    else:
      a -= D
      if a <= 0:
        print('No')
        return

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):
a, b, c, d = map(int, input().split())

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

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


if (c_count - a_count) >= 1:
    print('No')
else:
    print('Yes')

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

Solution (Python):
s = [input() for i in range(1)] 
li = list(map(int, s[0].split()))
for i in range(0,1000):
    if i % 2 == 0:
        li[2] = li[2] - li[1]
        if li[2] <= 0:
            print("Yes")
            break
    else:
        li[0] = li[0] - li[3]
        if li[0] <= 0:
            print("No")
            break

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

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

Solution (Python):
a,b,c,d = list(map(int,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())
while a >= 0 or c >= 0 :
    c -= b
    if a <= 0:
        print("No")
        break
    a -= d
    if c <= 0:
        print("Yes")
        break

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

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

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

while 1:
    
    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 True:
  c = c - b
  a = a - d
  
  if c <= 0:
    print('Yes')
    break
  elif 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)
for i in range(A):
    C = C - B
    if C <= 0:
        print("Yes")
        break
    A = A - D
    if A <= 0:
        print("No")
        break

Solution (Python):
a, b, c, d = [int(x) for x in 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())
s=""
while True:
  c=c-b
  if c<=0:
    s="Yes"
    break
  a=a-d
  if a<=0:
    s="No"
    break
print(s)

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

Solution (Python):
hp1,at1,hp2,at2=[int(x) for x in input().split()]

hp1=hp1-at2*(hp2//at1)
hp2=hp2%at1


if hp2<=0:
    print("Yes")
elif hp1>0:
    print("Yes")
else:
    print("No")

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

Solution (Python):

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

for i in range(100):
    A = A - D
    C = C - B

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

    elif A <= 0:
        print("No")
        break

    else:
        continue

Solution (Python):


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

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


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



if (i >= j):
  print("Yes")
else:
  print("No")

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

Solution (Python):
import math

A,B,C,D = [int(x) for x in input().split(' ')]
t = math.ceil(C / B)
s = math.ceil(A / D)

if t > s:
    print('No')
else:
    print('Yes')

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

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

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

x=a//d
if a%d!=0:
  x+=1
y=c//b
if c%b!=0:
  y+=1

if x<y:
  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())
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")
        exit()
    a -= d
    if a <= 0:
        print("No")
        exit()

Solution (Python):
from sys import stdin
A, B, C,D = [int(x) for x in stdin.readline().rstrip().split()]
while True:
  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())
taka = math.ceil(a/d)
ao = math.ceil(c/b)
if taka >= ao:
    print('Yes')
else:
    print('No')

Solution (Python):
A, B, C, D = map(int, input().split())
flag = 100
while flag ==100:
    C -= B
    if flag==100 and C<=0:
        flag = 0
    A -= D
    if flag==100 and A<=0:
        flag = 1
if flag==0: print('Yes')
else: print('No')

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

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

Solution (Python):
i = input().split()
a,b,c,d=int(i[0]),int(i[1]),int(i[2]),int(i[3])
if(a<=100 and b<=100 and c<=100 and d<=100 and a>0 and b>0 and c>0 and d>0):
    while(1):
        c-=b
        if(c<=0):
            print("Yes",end="")
            break
        a-=d
        if(a<=0):
            print("No",end="")
            break

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

while a>0 and b>0:
    c -= b
    if c <= 0:
        flag = 2
        break
    a -= d
    if a <=0:
        flag = 1
        break

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

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

while c >= 0 :

    c -= b
    if c <= 0 :

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

        print("No")
        break

Solution (Python):
s = input().split()
A, B, C, D = int(s[0]), int(s[1]), int(s[2]), int(s[3])
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())








X = (C + B - 1)//B
Y = (A + D - 1)//D 

print( 'Yes' if Y>=X else 'No')

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

def battle(A, B, C, D):
  C = C-B
  if C <= 0:
    return "Yes"
  A = A-D
  if A <= 0:
    return "No"
  return battle(A,B,C,D)
  
print(battle(A, B, C, 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):
n = input()
l = n.split()
a = int(l[0])
b = int(l[1])
c = int(l[2])
d = int(l[3])

if c%b == 0 and a%d == 0:
    aoki = c//b
    takahasi = a//d
elif c%b == 0 and a%d !=0:
    aoki = c//b
    takahasi = a//d + 1
elif c%b != 0 and a%d == 0:
    aoki = c//b + 1
    takahasi = a//d
else:
    aoki = c//b + 1
    takahasi = a//d + 1            





if aoki > takahasi:
    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())

while a > 0 and c > 0:
    c = c-b
    if c <= 0 :
       break
    a = a-d





print("Yes" if a > c else "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 = list(map(int,input().split()))

S = C
T = A

while S>0 and T>0:
    S=S-B
    T=T-D
    if S<=0 and T<=0 or S<=0 and T>=0:
        print("Yes")

    if T<=0 and S>0:
         print("No")

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

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')
        sys.exit()
    a-=d
    if a<=0:
        print('No')
        sys.exit()

Solution (Python):
x = input().split()
a = int(x[0])
b = int(x[1])
c = int(x[2])
d = int(x[3])
while a > 0 and c > 0:
  c = c - b
  a = a - d
if c <= 0:
  print('Yes')
else:
  print('No')

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


A = input_line[0]

B = input_line[1]

C = input_line[2]

D = input_line[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):
import sys
A,B,C,D=map(int,input().split())
T=[A,B]
K=[C,D]
N_1=(T[0]/K[1])
N_2=K[0]/T[1]
while N_2>0 or N_1>0:
    N_2-=1
    if not N_2>0:
        print('Yes')
        sys.exit()
    N_1-=1
    if not N_1>0:
        print('No')
        sys.exit()

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

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

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

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
print("Yes" if C<=0 else "No")

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

Solution (Python):
def main():

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

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

if __name__ == '__main__':
    main()

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

count_takashi = -(-c//b)
count_aoki = -(-a//d)

if count_takashi <= count_aoki:
    print('Yes')
else: 
    print('No')

Solution (Python):
A, B, C, D = [int(x) for x in input().split(' ')]

ans = 'Yes'

def takahashiattack():
    global A
    global B
    global C
    global D
    global ans
    C -= B
    if C <= 0:
        print(ans)
    else:
        tanakaattack()
    
def tanakaattack():
    global A
    global B
    global C
    global D
    global ans
    A -= D
    if A <= 0:
        ans = 'No'
        print(ans)
    else:
        takahashiattack()
    
takahashiattack()

Solution (Python):
import sys
A,B,C,D = map(int, input().split())
for i in range(110):
    C = C - B
    if C <= 0:
        print('Yes')
        sys.exit()
    A = A - D
    if A <= 0:
        print('No')
        sys.exit()

Solution (Python):
a,b,c,d = [ int(el) for el in input().split()]

hd = True
while hd:
  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 = [int(v) for v in input().strip().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(True):
    c=c-b

    if(c<=0):
        print("Yes")
        break

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

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

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

for i in range(1, 101):
    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())

for i in range(101):
    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,1000):
    if i%2 ==1:
        c =c-b
        if c <=0:
            print("Yes")
            exit()
    else:
        a = a-d
        if a <=0:
            print("No")
            exit()

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

while min(a,b) > 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 -= b
    a -= d
    if c <= 0:
        print("Yes")
        break
    if a <= 0:
        print("No")
        break

Solution (Python):
i = input()

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

while (a > 0) or (c > 0):
    c = c - b
    if (a < 1) or (c < 1):
        break
    a = a - d

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

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

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

Solution (Python):


def main():
    a, b, c, d = map(int, input().split())
    e = -(-c // b)
    f = -(-a // d)
    if e > f:
        print("No")
    else: 
        print("Yes")
        
if __name__ == '__main__':
    main()

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

a_hp = a
b_hp = c

result = ""
while True :
	b_hp -= b
	if b_hp <= 0 :
		result ="Yes"
		break
		
	a_hp -= d
	if a_hp <= 0 :
		result = "No"
		break
print(result)

Solution (Python):
abcd = [int(n) for n in input().split()]
while True:
    abcd[2] -= abcd[1]
    if abcd[2] <= 0:
        print("Yes")
        break
    abcd[0] -= abcd[3]
    if abcd[0] <= 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('Yes')
elif A<=0 and C<=0:
  print('Yes')
else:
  print('No')

Solution (Python):

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

for battle_num in range(1, 100):
    if battle_num % 2 != 0:
        lifeA = lifeA - B
    else:
        lifeT = lifeT - D

    if lifeA <= 0 or lifeT <= 0:
        break

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

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

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

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

i=0
while i>=0:
    if i%2==0:
        c=c-b
    
    elif i%2==1:
        a=a-d
    
    i=i+1
    
    if c<=0:
        i=0-1
    elif a<=0:
        i=0-1
    
    
if a<c:
    print("No")
else :
    print("Yes")

Solution (Python):
a = list(map(int, input().split()))
import math
b = math.ceil(a[2] / a[1])
c = math.ceil(a[0] / a[3])
if b > c:
  print("No")
else:
  print("Yes")

Solution (Python):
s=input().split(" ")
t_p=int(s[0])
t_a=int(s[1])
a_p=int(s[2])
a_a=int(s[3])
i=0
while i<=0:
    a_p-=t_a
    if a_p <= 0:
        print("Yes")
        break
    t_p-=a_a
    if t_p <= 0:
        print("No")
        break

Solution (Python):
import sys

def main():

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

if __name__ == "__main__":
    main()

Solution (Python):
import math

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

takahashi = math.ceil(A/D)
aoki = math.ceil(C/B)

if takahashi >= aoki:
    print('Yes')
else:
    print('No')

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

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

Solution (Python):
THP,TAT,AHP,AAT = map(int,input().split())
while THP > 0 and AHP > 0 :
    AHP -= TAT
    THP -= AAT
if THP <= 0 and AHP > 0 :
    print("No")
elif AHP <= 0 and THP > 0 :
    print("Yes")
else:
    print("Yes")

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

def battle(hp, pw):
	count = 0
	while hp > 0:
		hp -= pw
		count += 1
	return count-1

taka_count = battle(a,d)
ao_count = battle(c,b)

if taka_count >= ao_count:
	print('Yes')
else:
	print('No')

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

for i in range(max(C//B+1,A//D+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 c > 0 and a > 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 True:
  C-=B
  if C<=0:
    break
  A-=D
  if A<=0:
    break

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

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

Solution (Python):
import math
A,B,C,D = map(int,input().split())
X = math.ceil(C/B)
Y = math.ceil(A/D)
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=input().split(' ')
a=int(a)
b=int(b)
c=int(c)
d=int(d)
var=1
while(var==1):
  c=c-b
  a=a-d
  if (a<=0):
      break
if (c<=0):
  print("Yes")
else:
  print("No")

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

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