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

T_life = A
T_power = B
A_life = C
A_power = D

while True:
  A_life -= T_power
  if A_life <= 0:
    print("Yes")
    break
  T_life -= A_power
  if T_life <= 0:
    print("No")
    break

Solution (Python):

def main():
    A, B, C, D = map(int, input().split())
    
    takahashi_hp = A
    aoki_hp = C
    
    while True:
        aoki_hp = aoki_hp - B
        if takahashi_hp <= 0:
            out = 'No'
            break

        takahashi_hp = takahashi_hp - D   
        if aoki_hp <= 0:
            out = 'Yes'
            break
    print(out)
main()

Solution (Python):
t_hp,t_ap,a_hp,a_ap=map(int,input().split())
if t_hp%a_ap==0:
    tp=t_hp//a_ap
else:
    tp=t_hp//a_ap+1
if a_hp%t_ap==0:
    ap=a_hp//t_ap
else:
    ap=a_hp//t_ap+1

if ap<=tp:
    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())
check = True
turn = 1
while check:
  if turn%2 != 0:
    c = c-b
    if c<=0:
      check = False
      print("Yes")
  else:
    a = a-d
    if a<=0:
      check = False
      print("No")
  turn = turn+1

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

T_count = A//D
if A%D == 0:
    T_count -= 1
A_count = C//B
if C%B ==0:
    A_count -= 1
if A_count > T_count:
    print("No")
else:
    print("Yes")

Solution (Python):
import bisect
import copy
import heapq
import sys
import itertools
import math
import queue
input = sys.stdin.readline
sys.setrecursionlimit(1000000)
mod = 10 ** 9 + 7

def read_values(): return map(int, input().split())
def read_index(): return map(lambda x: int(x) - 1, input().split())
def read_list(): return list(read_values())
def read_lists(N): return [read_list() for n in range(N)]
def init_dp1(init, N): return [init for _ in range(N)]
def init_dp2(init, N, M): return [[init for _ in range(M)] for _ in range(N)]


class V:
    def __init__(self, f, v=None):
        self.f = f
        self.v = v
 
    def __str__(self):
        return str(self.v)
 
    def ud(self, n):
        if n is None:
            return

        if self.v is None:
            self.v = n
            return
        self.v = self.f(self.v, n) 


def main():
    A, B, C, D = read_values()

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


if __name__ == "__main__":
    main()

Solution (Python):
I = input().split()
A = int(I[0])
B = int(I[1])
C = int(I[2])
D = int(I[3])
An = A
Cn = C
while An > 0 or Cn > 0 :
    
    
    Cn = Cn - B 
    
    if Cn <= 0 :
        ans = 'Yes'
        break
    else:
        An = An - D 
        
        if An <= 0 :
            ans = 'No'
            break

print (ans)

Solution (Python):
import math
a,b,c,d = map(int, input().split())
cb = math.ceil(c / b)
ad = math.ceil(a / d)
print('Yes' if (cb <= ad)  else '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('Yes')
else:
    print('No')

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

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

ao = a // d + 1
taka = c // b + 1

if c % b == 0:
  taka -= 1
if a % d == 0:
  ao -= 1
  
if taka<=ao:
    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=map(int,input().split())
while 0<a or 0<c:
  c-=b
  if c<=0:
    break
  a-=d
  
if a<=0:
  print("No")
else:
  print("Yes")

Solution (Python):
T_hp, T_a, A_hp, A_a = map(int,input().split())
while True:
  A_hp-=T_a
  if A_hp<=0:
    print("Yes")
    break
  T_hp-=A_a
  if T_hp<=0:
    print("No")
    break

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

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

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

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

Solution (Python):
INT_MAX=10**11+7
MOD=10**9+7
def INPUT():return list(int(i) for i in input().split())
def LIST_1D_ARRAY(n):return [0 for _ in range(n)]
def LIST_2D_ARRAY(m,n):return [[0 for _ in range(n)]for _ in range(m)]

h1,s1,h2,s2=INPUT()
while(h1>0 and h2>0):
    h2-=s1
    if h2<=0:
        print("Yes")
        break
    h1-=s2
    if h1<=0:
        print("No")
        break

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

aoki_attacks = A // D if A % D == 0 else A // D + 1
takahashi_attacks = C // B if C % B == 0 else C // B + 1

print('Yes') if takahashi_attacks <= aoki_attacks else print('No')

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

q1, mod1 = divmod(A, D)
q2, mod2 = divmod(C, B)

if mod1 > 0:
    q1 += 1
else:
    pass
if mod2 > 0:
    q2 += 1
else:
    pass

if q1 >= q2:
    print("Yes")
else:
    print("No")

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

Solution (Python):
inp_num=input().split()
taka_hp=int(inp_num[0])
taka_atr=int(inp_num[1])
ao_hp=int(inp_num[2])
ao_atr=int(inp_num[3])

while taka_hp >=0 or ao_hp >=0:
    
    ao_hp= ao_hp - taka_atr
    if ao_hp <=0:
        print("Yes")
        break
    
    taka_hp= taka_hp - ao_atr
    if taka_hp <=0:
        print("No")
        break

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

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 9)
input = sys.stdin.readline
from itertools import permutations,  combinations, accumulate
from functools import *
from collections import deque, defaultdict, Counter
from heapq import heapify, heappop, heappush, heappushpop

INF = float('inf')
NIL = - 1

""" Input
S = input().rstrip()
N = int(input())
A = list(map(int, input().split()))
A = np.array(input().split(), dtype=np.float64)
D = [int(input()) for _ in range(N)]
AB = [[int(x) for x in input().split()] for _ in range(N)]
PX = [[int(x) for x in input().split()] for _ in range(Q)]
"""

t, B, a, D = map(int, input().split())

while True:
    a -= B
    if a <= 0:
        print('Yes')
        exit()
    t -= D
    if t <= 0:
        print('No')
        exit()

Solution (Python):
ABCD = list(map(int, input().split()))
A = ABCD[0]
B = ABCD[1]
C = ABCD[2]
D = ABCD[3]
if C%B != 0:
    if D*(C//B) >= A:
        print('No')
    else:
        print('Yes')
else:
    if D*(B//C - 1) >= A:
        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):
thp,ta, ahp, aa =map(int,input().split())
ans = []
while thp >= 0 or ahp >= 0:
	ahp -= ta
	thp -= aa
	if ahp <= 0:
		ans.append("Yes")
	elif thp <= 0:
		ans.append("No")
print(ans[0])

Solution (Python):
A, B, C, D = list(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):
ABCD = input().split()

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

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

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

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

Solution (Python):
from sys import stdin
from math import ceil

def main():
    health_strengh = [int(x) for x in stdin.readline().split()]

    if ceil(health_strengh[2] / health_strengh[1]) > ceil(health_strengh[0] / health_strengh[3]):
        print("No")
    elif ceil(health_strengh[2] / health_strengh[1]) <= ceil(health_strengh[0] / health_strengh[3]):
        print("Yes")
    
main()

Solution (Python):
def solve():
    a, b, c, d = map(int, input().split())
    
    while a > 0 or c > 0:
        c -= b
        if c <= 0:
            return 'Yes'
        a -= d
        if a <= 0:
            return 'No'

print(solve())

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

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

X = A // D
Y = C // B

if A % D > 0:
  X += 1

if C % B > 0:
  Y += 1

if Y > X:
  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:
        a -= d
if a > c :
    print("Yes")
else:
    print("No")

Solution (Python):

taka_hp, taka_at, ao_hp, ao_at = map(int, input().split())
while taka_hp > 0 and ao_hp > 0:
    ao_hp -= taka_at
    
    if ao_hp <= 0:
        print("Yes")
        break
    taka_hp -= ao_at
    
    if taka_hp <= 0:
        print("No")
        break

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

import sys
A, B ,C , D = map(float, input().split())


def atack(a,b,c,d):
    c = c-b
    if c < 1:
        print('Yes')
        sys.exit()
    a = a- d
    if a <1:
        print('No')
        sys.exit()
    return a, b, c, d

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

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):
inputLine = input()

tempStr = inputLine.split(' ')

tHealth = int(tempStr[0])
tAttack = int(tempStr[1])
aHealth = int(tempStr[2])
aAttack = int(tempStr[3])

roundStep = 0
while True :

	if tHealth <= 0 :
		print('No')
		break

	elif aHealth <= 0 :
		print('Yes')
		break


	if roundStep % 2 == 0 :
		aHealth -= tAttack

	else :
		tHealth -= aAttack

	roundStep = roundStep + 1

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

Ta = A//D if A % D == 0 else A//D +1
Ao= C//B if C % B == 0 else C//B + 1

if Ta >= Ao:
    print("Yes")
else:
    print("No")

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

while 1:
  c=c-b
  a=a-d
  if c<=0:
    print("Yes")
    break
  elif 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):
def resolve():
    '''
    code here
    '''
    A, B, C, D = [int(item) for item in input().split()]

    turn = 0
    while A > 0 and C > 0:
        turn += 1
        

        if turn % 2 == 1:
            C -= B
        else:
            A -= D
        
        
    
    
    if A <= 0:
        print('No')
    else:
        print('Yes')

if __name__ == "__main__":
    resolve()

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

flg = 0
for i in range(1000) :
    C -= B
    if C <= 0 :
        flg = 1
        break
    A -= D
    if A <= 0 :
        flg = -1
        break

if flg == 1 :
    print("Yes")
elif flg == -1 :
    print("No")

Solution (Python):
a,b,c,d=map(int,input().split())
flag="F"
while flag=="F":
  c=c-b
  if c<=0:
    flag="Y"
  else:
    a=a-d
    if a<=0:
      flag="N"
if flag=="Y":
  print("Yes")
else:
  print("No")

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

Solution (Python):
q = input().split()
q = [int(i) for i in q]

t = [q[0], q[1]]
a = [q[2], q[3]]

while True:
    a[0] = a[0] - t[1]
    if (a[0] <= 0):
        print("Yes")
        break

    t[0] = t[0] - a[1]
    if (t[0] <= 0):
        print("No")
        break

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

def atack(T,A):
    T[0] = T[0] - A[1]
    return T,A

takahasi = [A,B,'t']
aoki = [C,D,'a']
result = 0
while True:
    aoki,takahasi = atack(aoki,takahasi)
    if aoki[0] <= 0:
        result = 1
        break

    takahasi,aoki = atack(takahasi,aoki)
    if takahasi[0] <= 0:
        result = -1
        break

if result == 1:
    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):
a,b,c,d=map(int,input().split())
e=a//d+1 if a%d>0 else a//d
print('Yes' if c<=b*e else 'No')

Solution (Python):
from math import ceil
def B():
    [a, b, c, d] = list(map(int, input().split()))
    if ceil(c*1.0/b) > ceil(a*1.0/d):
        print("No")
    else:
        print("Yes")

B()

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

while A*C > 0:
    C -= B
    if C > 0:
        A -= D

if A < 1:
    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("Yes")
else:
    print("No")

Solution (Python):
import math

a, b, c, d = (int(x) for x in input().split())
if (math.ceil(c/b)) <= (math.ceil(a/d)):
    print('Yes')
else:
    print('No')

Solution (Python):





from sys import stdin

import time
import numpy as np




temp = stdin.readline().split()
A = int(temp[0])
B = int(temp[1])
C = int(temp[2])
D = int(temp[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())

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

Solution (Python):
heart_taka, power_taka, heart_aoki, power_aoki = map(int, input().split())

aliveTaka = True
aliveAoki = True
while (aliveTaka) and (aliveAoki):
    heart_aoki -= power_taka
    heart_taka -= power_aoki
    if heart_aoki <= 0:
        aliveAoki = False
    if heart_taka <= 0:
        aliveTaka = False

if aliveAoki == False:
    print("Yes")
else:
    print("No")

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

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

Solution (Python):
import sys, math
input = sys.stdin.readline

def main():
    A, B, C, D = map(int, input().split())
    t = math.ceil(C / B)
    a = math.ceil(A / D)

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

if __name__ == '__main__':
    main()

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

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

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

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

    c = c - b
    a = a - d

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



flag=True
while C>0 and A>0:
    C-=B
    if C<=0:
        print('Yes')
        exit()

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

Solution (Python):
data = input().rstrip().split(" ")
a_hp = int(data[0])
a_attack = int(data[1])
b_hp = int(data[2])
b_attack = int(data[3])
a_times = 0
b_times = 0
while a_hp > 0:
    b_times += 1
    a_hp -= b_attack
while b_hp > 0:
    a_times += 1
    b_hp -= a_attack
if a_times <= b_times:
    print("Yes")
else:
    print("No")

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

tk_count = -(-c // b)
ao_count = -(-a // d)

if tk_count <= ao_count:
    print('Yes')
else:
    print('No')

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

Solution (Python):
def win_lose(A,B,C,D):
   while True:
     C-=B
     if C<=0:
        return 'Yes'
     A-=D
     if A<=0:
        return 'No'

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

Solution (Python):



import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys

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

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

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

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

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

t = A // D
a = C // B

if A % D == 0:
  t = A // D
else:
  t = (A // D) +1

if C % B == 0:
  a = C // B
else:
  a = (C // B) + 1

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

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

aoki = int(c/b)
if c % b != 0:
    aoki += 1

taka = int(a/d)
if a % d != 0:
    taka += 1

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

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

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

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 A%D ==0:
    cnt_t = A//D
else:
    cnt_t = A//D+1
if C%B==0:
    cnt_a=C//B
else:
    cnt_a =C//B+1

if cnt_t <cnt_a:
    print("No")
else:
    print("Yes")

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

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

Solution (Python):
a,b,c,d=[int(i) for i in input().split()]
ans=0
while a>0 and c>0:
  if ans==0:
    c-=b
  else:
    a-=d
  ans^=1
if ans==1:
  print('Yes')
else:
  print('No')

Solution (Python):
A, B, C, D = map(int, input().split())
for i in range(101):
    if C-B*i <= 0:
        print("Yes")
        break
    elif A-D*i <= 0:
        print("No")
        break

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


while(1):
    ao_hp -= tk_atk

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

    tk_hp -=  ao_atk

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

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

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

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

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

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

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

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

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

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

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

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

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

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



if __name__ == '__main__':
  main()

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

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

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




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

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

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

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

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

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

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

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


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

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())
count_a = 0
count_b = 0
if c % b == 0:
    count_a = c//b
else:
    count_a = c//b + 1

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

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

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

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

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

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

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

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

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

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

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

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

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

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 C > 0 and A > 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())
takahashi=A
aoki=C
count=1
while (takahashi>0 and aoki>0):
    count=count+1
    if count % 2 == 0:
        aoki=aoki-B
    else:
        takahashi = takahashi - D

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

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

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

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

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

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

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

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

E = C - B
F = A - D

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

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

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

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

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

Solution (Python):
import numpy as np
import math
import scipy as sp
import queue
import collections

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

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

    res = 'No'

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

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

            if a <= 0:
                break

    return res

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

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

    cout = main(kwargs)
    print(cout)

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

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

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

Solution (Python):
import math

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

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

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

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

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

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

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

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

Solution (Python):


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

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

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

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