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


import sys
sys.setrecursionlimit(300000)

YES = "Yes"  
NO = "No"  

def solve(A: int, B: int, C: int, D: int):
    while True:
        C -= B
        if C <= 0:
            ret = YES
            break
        A -= D
        if A <= 0:
            ret = NO
            break
    print(ret)
    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
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0

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

for i in range(200):
    if even(i):
        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())
print('YNeos'[-a//d>-c//b::2])

Solution (Python):
import math
P =  list(map(int,input().split()))
A = P[0]
B = P[1]
C = P[2]
D = P[3]

p = math.ceil(C/B)
q = math.ceil(A/D)
    

if p <= q:
    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())

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

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

Solution (Python):
a, b, c,d = map(int, input().split())
aa=a
cc=c
for i in range(a//d+1):
    cc = cc - b

    if cc<1:
      print("Yes")
      break;
    aa = aa - d

    if aa <1:
      print("No")
      break;

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

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

if(atA>=atC):
    print('Yes')
else:
    print('No')

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

    t_hp -= a_at
    if t_hp <= 0:
        print("No")
        exit()

Solution (Python):
t_x, t_y, a_x, a_y = map(int, input().split())

i = 0
while True:
    if i % 2 == 0:
        a_x -= t_y
    else:
        t_x -= a_y
    if t_x <= 0:
        print("No")
        break
    elif a_x <= 0:
        print("Yes")
        break
    i += 1

Solution (Python):
A,B,C,D=map(int,input().split())
E=A//D
F=C//B
if  E > F:
	print("Yes")
elif E == F and A%D != 0:
	print("Yes")
elif E == F and C%B == 0 and A%D == 0:
	print("Yes")
elif E+1 == F and C%B == 0 and A%D != 0:
	print("Yes")    
else:
	print("No")

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

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

Solution (Python):
from math import ceil
a,b,c,d=[int(x) for x in input().split()]
if ceil(a/d)==ceil(c/b):
    print('Yes')
elif ceil(a/d)>ceil(c/b):
    print('Yes')
elif ceil(a/d)<ceil(c/b):
    print('No')
else:print('No')

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 <= 0:
      print('No')
  else:
    print('Yes')

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

n_1=A//D
n_2=A/D
if n_1<n_2:
    takahashi=n_1+1
else:
    takahashi=n_1

n_3=C//B
n_4=C/B
if n_3<n_4:
   aoki=n_3+1
else:
    aoki=n_3

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

Solution (Python):
t, k, c, d = (int(x) for x in input().split())
while (t >= 0 or c >= 0):
  c = c - k
  if c <= 0:
    print("Yes")
    break
  t = t - d
  if t <= 0:
    print("No")
    break

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












import math

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

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

while 1:
 S[2] = S[2] - S[1]
 if(S[2] <= 0):
   print('Yes')
   break
 S[0] = S[0] - S[3]
 if(S[0] <= 0):
   print('No')
   break

Solution (Python):
import math

numbers = ["0"]*4
numbers = input().split(" ")
healthOfT = int(numbers[0])
strengthOfT = int(numbers[1])
healthOfA = int(numbers[2])
strengthOfA = int(numbers[3])
times_T_win = math.ceil(healthOfA/strengthOfT)
times_A_win = math.ceil(healthOfT/strengthOfA)
if times_T_win <= times_A_win:
	print("Yes")
else:
	print("No")

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

Solution (Python):
A, B, C, D = map(int, input().split())
while A>1 :
  C=C-B
  A=A-D
else:
  if C>0 and A<=0:
    print("No")
  elif C<0 or C-B<=0:
    print("Yes")
  else:
    print("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())
x = C // B
if C % B == 0:
    x = x-1
y = A // D
if A % D == 0:
    y = y-1
if x > y:
  print("No")
else:
  print("Yes")

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

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

Solution (Python):
x = input()
taka_hp = int(x.split()[0])
taka_attack = int(x.split()[1])
ao_hp = int(x.split()[2])
ao_attack = int(x.split()[3])

while (taka_hp > 0 and ao_hp > 0):
    ao_hp = ao_hp - taka_attack
    taka_hp = taka_hp - ao_attack
else:
    if ao_hp <= 0:
      print("Yes")
    elif taka_hp <= 0:
      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):
K = input().split(" ")
k = [int(n) for n in K]
t =k[0]//k[3]
a = k[2]//k[1]
t1 = k[0]%k[3]
a1 = k[2]%k[1]
if t1 != 0:
    t = t+1
if a1 != 0:
    a = a+1
if t>=a:
    print('Yes')
else:
    print('No')

Solution (Python):


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


flag = 1

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

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

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

Solution (Python):
th,ts,oh,os=map(int,input().split())
while th>=1 and oh>=1:
  oh=oh-ts
  if oh>=1:
    th=th-os
if th>=1:
  print('Yes')
else:
  print('No')

Solution (Python):
th, tMon, ah, aMon  = map(int, input().split())
turn = 1


while(1):
  if(turn):
    ah-=tMon
    if(ah<=0):
      print("Yes")
      break
  else:
    th-=aMon
    if(th<=0):
      print("No")
      break
  turn^=1

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

jumyo_t = A//D
jumyo_a = C//B
if A%D != 0:
    jumyo_t += 1
if C%B != 0:
    jumyo_a += 1

if jumyo_a > jumyo_t:
    print("No")
else:
    print("Yes")

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

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

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

def attack_count(life, power):
    count = life // power
    if life % power == 0:
        return count
    else:
        return count + 1

t_lifespan = attack_count(a, d)
a_lifespan = attack_count(c, b)

if t_lifespan == a_lifespan:
    print("Yes")
elif t_lifespan > a_lifespan:
    print("Yes")
else:
    print("No")

Solution (Python):
class monster:
    stamina = 0
    attack= 0
    def __init__(self,stamina,attack):
        self.stamina = stamina
        self.attack = attack


abcd = input().split()
abcd=[int(x) for x in abcd]
a = abcd[0]
b = abcd[1]
c = abcd[2]
d = abcd[3]



taka = monster(a,b)
aoki = monster(c,d)

while(1):
    
    aoki.stamina = aoki.stamina-taka.attack
    if aoki.stamina<=0:
        print('Yes')
        break
    taka.stamina = taka.stamina-aoki.attack
    if taka.stamina<=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

X = list(map(int,input().split()))
Ahp = X[0]
Aat = X[1]
Bhp = X[2]
Bat = X[3]
Atm = math.ceil(Bhp/Aat)
Btm = math.ceil(Ahp/Bat)

if Atm<=Btm:
  print("Yes")
else:
  print("No")

Solution (Python):
th, tMon, ah, aMon  = map(int, input().split())
turn = 1


while(1):
  if(turn):
    ah-=tMon
    if(ah<=0):
      print("Yes")
      break
  else:
    th-=aMon
    if(th<=0):
      print("No")
      break
  turn^=1

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

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

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

if t_n <= a_n:
    print('Yes')
else:
    print('No')

Solution (Python):
e,r,t,y = [int(x) for x in input().split()]

while (e>= 0 or t >= 0):
    t = t - r
    if t<= 0:
        print('Yes')
        break
    e = e - y
    if e<= 0:
        print('No')
        break

Solution (Python):
import sys
readline = sys.stdin.readline

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

ans = 'Yes'
for i in range(10000):
    if i%2 == 0:
        C -= B
        if C <= 0:
            break
    else:
        A -= D
        if A <= 0:
            ans = 'No'
            break
print(ans)

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

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

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

if t_cnt > a_cnt:
    print("No")
else:
    print("Yes")

Solution (Python):
ms=[int(x) for x in input().split(' ')]
t=[ms[0],ms[1]]
a=[ms[2],ms[3]]
while True:
    a[0]-=t[1]
    if a[0]<1:
        print("Yes")
        break
    t[0]-=a[1]
    if t[0]<1:
        print('No')
        break

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

Solution (Python):
from sys import stdin, setrecursionlimit, stdout

from collections import deque
from math import sqrt, floor, ceil, log, log2, log10, pi, gcd, sin, cos, asin
def ii(): return int(stdin.readline())
def fi(): return float(stdin.readline())
def mi(): return map(int, stdin.readline().split())
def fmi(): return map(float, stdin.readline().split())
def li(): return list(mi())
def lsi():
    x=list(stdin.readline())
    x.pop()
    return x
def si(): return stdin.readline().rstrip()

res=['Yes', 'No']

a, b, c, d=mi()
f=0
if ceil(c/b)>ceil(a/d):
    f=1
print(res[f])

Solution (Python):
arg = input()
a = int((arg.split())[0])
b = int((arg.split())[1])
c = int((arg.split())[2])
d = int((arg.split())[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())
count = 0
while(a>0 and c>0):
    count+=1
    if(count%2!=0):
        c-=b
    else:
        a-=d

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

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

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

l = c // b
if c % b !=0:
  l += 1
  
m = a // d
if a % d !=0:
  m += 1
  
if l == m:
  print("Yes")
elif l < m:
  print("Yes")
else:
  print("No")

Solution (Python):
def main():
  
  
  
  a,b,c,d = list(map(int,input().split()))
  
  
  
  
  ans = 0
  count = 0
  lis = []
  
  while 1:
    c = c - b
    if c <= 0:
      print("Yes")
      exit()
    a = a - d
    if a <= 0:
      print("No")
      exit()
      
if __name__ == '__main__':
  main()

Solution (Python):
t_hp ,t_atack ,a_hp ,a_atack = map(int, input().split())

t_death_sum = -(-t_hp // a_atack)
a_death_sum = -(-a_hp // t_atack)


if (t_death_sum < a_death_sum):
  print("No")
else :
  print("Yes")

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

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

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

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

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 = map(int, input().split())

turn_flag = True
for i in range(0, 100):
    if turn_flag:
        C -= B
        if C <= 0:
            break
        turn_flag = False
    
    else:
        A -= D
        if A <= 0:
            break
        turn_flag = True

    

if turn_flag:
    print('Yes')
else:
    print('No')

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

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

Solution (Python):
import sys
from collections import defaultdict, Counter, deque
from itertools import accumulate, permutations, combinations
from operator import itemgetter
from bisect import bisect_left, bisect_right, bisect
from heapq import heappop, heappush
from fractions import gcd
from math import ceil, floor, sqrt, cos, sin, pi
from copy import deepcopy




def main():
    a,b,c,d = map(int, input().split())
    myturn = True
    while True:
        if a <= 0 or c <= 0:
            break
        if myturn:
            c -= b
        else:
            a -= d
        myturn = not myturn
    if c <= 0:
        print("Yes")
    else:
        print("No")

if __name__ == '__main__':
    main()

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

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

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

if (A+D-1)//D >= (C+B-1)//B:
    print("Yes")
else:
    print("No")

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

class Main:
    t1, a1, t2, a2= map(int,input().split());
    w = "t1"
    while t1 >= 0 or t2 >= 0:
        if t2 <= 0:
            w = "t1"
            break;
        t2 = t2 - a1;
        if t1 <= 0:
            w = "t2"
            break;
        t1 =  t1 - a2;

    if w == "t1":
        print("Yes");
    else:
        print("No")

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

Solution (Python):
import math
a=[int(i) for i in input().split()]
print("Yes"if math.ceil(a[2]/a[1])<=math.ceil(a[0]/a[3]) else"No")

Solution (Python):
a,b,c,d=map(int,input().split())
taka=int((c+b-1)/b)
aoki=int((a+d-1)/d)

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

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

while True:
    if t%2==0: 
        C-=B 
    elif t%2==1: 
        A-=D 
    
    if A<=0 or C<=0: 
        break

    t+=1 

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

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

x0 = C // B
x1 = C % B

y0 = A // D
y1 = A % D

if x1 == 0:
  y0 += 1
if y1 == 0:
  x0 += 1

if x0 - y0 <= 0:
  print('Yes')
else:
  print('No')

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

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

Solution (Python):
'''A=高橋のHP
B=高橋の攻撃力
C=青木のHP
D=青木の攻撃力 '''


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

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

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

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):
tH,tA,aH,aA=map(int,input().split())
print("Yes") if (aH-1)//tA+1<=(tH-1)//aA+1 else print("No")

Solution (Python):
a_hp,a_at,b_hp,b_at = map(int,input().split())
An = b_hp//a_at
Blit = b_hp%a_at
Bn = a_hp//b_at
Alit = a_hp%b_at
if Blit != 0:
    An += 1
if Alit != 0:
    Bn += 1
print('Yes' if An<=Bn else 'No')

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

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

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

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

Solution (Python):
A_B_C_D=input()
m=A_B_C_D.split()
A=m[0]
A=int(A)
B=m[1]
B=int(B)
C=m[2]
C=int(C)
D=m[3]
D=int(D)
while True:
    C-=B
    A-=D
    if  C<=0:
        print('Yes')
        break
    if  A<=0:
        print('No')
        break

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

while True:
    a_hp -= t_atk
    t_hp -= a_atk
    if a_hp <= 0:
        print('Yes')
        break
    elif t_hp <= 0:
        print('No')
        break

Solution (Python):
A, B, C, D = map(int, input().split())
N = C//B
M = A//D
n = C % B
m = A % D
 
if N < M:
  print('Yes')
elif N == M:
  if n == 0:
    print('Yes')
  elif m == 0:
    print('No')
  else:
    print('Yes')
elif N == M + 1:
  if n == 0:
    print('Yes')
  else:
    print('No')
elif N > M + 1:
  print('No')

Solution (Python):

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

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

while 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):
n = list(map(int, input().split()))
while n[0]>0 and n[2]>0:
    n[2] = n[2] - n[1]
    if n[2] <= 0:
        break
    n[0] = n[0] - n[3]

if n[0]>n[2]:
    print("Yes")
else:
    print("No")

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):
taka_HP, taka_Power, aoki_HP, aoki_Power = map(int, input().split())

while True:
    aoki_HP -= taka_Power
    if aoki_HP <= 0:
        print('Yes')
        break

    taka_HP -= aoki_Power        
    if taka_HP <= 0:
        print('No')
        break

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

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

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

if cntT >= cntA:
    print('Yes')
else:
    print('No')

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

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

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

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 = input().split()
A = int(A)  
B = int(B)
C = int(C)
D = int(D)
takahasiA = C // B
if C % B != 0:
    takahasiA += 1
aokiA = A // D 
if A % D != 0:
    aokiA += 1


ans = "Yes" if takahasiA <= aokiA else "No"
print(ans)

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

Solution (Python):
N=[int(x) for x in input().split()]
if not N[2]%N[1]==0:
   c=N[2]//N[1]+1
else:
    c=N[2]//N[1]
if not N[0]%N[3]==0:
   d=N[0]//N[3]+1
else:
    d=N[0]//N[3]
if d>=c:
    print("Yes")
else:
    print("No")

Solution (Python):
def abc():
    AH,AS,BH,BS=map(int,input().split(' '))

    while(AH>0 and BH>0 ):
        BH=BH-AS
        AH=AH-BS
    if(BH<=0 and AH+BS>0):
        print("Yes")
    else:
        print("No")
abc()

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())
a=0
c=0
while C-B>0:
    C-=B
    a+=1
while A-D>0:
    A-=D
    c+=1
print("Yes") if c>=a 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):
if __name__ == "__main__":
    a,b,c,d=map(int,input().strip().split())
    jishu1=0
    jishu2=0
    while True:
        a=a-d
        jishu1+=1
        if a<=0:
            break
    while True:
        c=c-b
        jishu2+=1
        if c<=0:
            break
    if jishu1<jishu2:
        print("No")
    else:
        print("Yes")

Solution (Python):
ht, st, ha, sa = list(map(int, input().split(' ')))
bool_player = True  
while (ht > 0 and ha > 0):
    if bool_player:
        ha -= st
        bool_player = False
    else:
        ht -= sa
        bool_player = True

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

Solution (Python):
a,b,c,d = input().split()
a,b,c,d = int(a),int(b),int(c),int(d)
while a:
  c = c-b
  if c<=0:
    break
  a = a-d
  if a<=0:
    break
if a>=0 and c<=0:
  print("Yes")
if a<=0 and c>=0:
  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())

X = C - B
Y = A - D

while True:
  if X <= 0:
    print('Yes')
    break
  elif X > 0 and Y <= 0:
    print('No')
    break
  else:
    X = X - B
    Y = Y - D

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

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

Solution (Python):
A,B,C,D = map(int, input().split())
a = C//B
b = A//D
if C%B != 0:
    a = a + 1
if A%D != 0:
    b = b + 1

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

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

while (i[0] > 0 or i[2] > 0):
	i[2] = i[2] - i[1]
	if (i[2] <= 0):
		print('Yes')
		break
	i[0] = i[0] - i[3]
	if (i[0] <= 0):
		print('No')
		break

Solution (Python):
TaHP,TaAP,AoHP,AoAP = map(int, input().split())

Flag_Ta = True
Flag_end = True
while Flag_end:
	if(TaHP <= 0 or AoHP <= 0):
  		break
	if	Flag_Ta:
		AoHP = AoHP - TaAP
		Flag_Ta = False
	else:
		TaHP = TaHP - AoAP
		Flag_Ta = True
if TaHP > 0:
	print("Yes")
else:
	print("No")

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

while True:
  if y<=0:
    print("Yes") 
  elif x<=0:
    print("No") 
  else:
      x=x-D
      y=y-B
      continue
  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):
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 = 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())
for i in range(100):
    C-=B
    A-=D
    if C<=0 and A<=0:
        print("Yes")
        break
    elif C>0 and A<=0:
        print("No")
        break
    else:
        continue

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

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

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

Solution (Python):
def fight(a,b):
    if b%a==0:
        return b//a
    else:
        return (b//a)+1
A,B,C,D=map(int,input().split())
if fight(B,C)>fight(D,A):
    print("No")
else:
    print("Yes")

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





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

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

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

Solution (Python):

ABCD=input()
ABCD=ABCD.split()
A=int(ABCD[0])
B=int(ABCD[1])
C=int(ABCD[2])
D=int(ABCD[3])
while(1):
    C=C-B
    if(C<=0):
        print('Yes')
        break
    A=A-D
    if(A<=0):
        print('No')
        break

Solution (Python):
a=list(map(int,input().split()))
takahashi=0
takahashicount=0
aoki=0
aokicount=0

for i in range(a[2]):
    aoki+=a[1]
    if (a[2]-aoki)>0:
        aokicount+=1
    elif (a[2]-aoki)==0:
        break
    else:
        break
        
for i in range(a[0]):
    takahashi+=a[3]
    if (a[0]-takahashi)>0:
        takahashicount+=1
    elif (a[0]-takahashi)==0:
        break
    else:
        break
if takahashicount==aokicount:
    print("Yes")
elif takahashicount>aokicount:
    print("Yes")
elif takahashicount<aokicount:
    print("No")

Solution (Python):
from math import floor,ceil,sqrt,factorial,log
from collections import Counter, deque
from functools import reduce
import numpy as np
def S(): return input()
def I(): return int(input())
def MS(): return map(str,input().split())
def MI(): return map(int,input().split())
def FLI(): return [int(i) for i in input().split()]
def LS(): return list(MS())
def LI(): return list(MI())
def LLS(): return [list(map(str, l.split() )) for l in input()]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def LLSN(n: int): return [LS() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]

A,B,C,D = MI()

t = A
a = C

for i in range(100):
    a -= B
    if a <= 0:
        print("Yes")
        exit()
    
    t -= D
    if t <= 0:
        print("No")
        exit()