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())
q = (c-1)//b+1
p = (a-1)//d+1
if p<q:
  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 A <= 0 and C > 0:
    ans = 'No'
else:
    ans = 'Yes'
print(ans)

Solution (Python):
import math

t_H, t_A, e_H, e_A = map(int, input().split())

print(['No', 'Yes'][math.ceil(t_H/e_A) >= math.ceil(e_H/ t_A)])

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

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

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

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

Solution (Python):

import math
A, B, C, D =  [int(i) for i 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())

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

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

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

Solution (Python):
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

a,b,c,d = mi()

tt = a//d + int(bool(a%d))
at = c//b + int(bool(c%b))


if tt < at:
    print('No')
else:
    print('Yes')

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

Solution (Python):
a, b, c, d = map(int, input().split())
while a>0 and d>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())
n1 = -(-c//b)
n2 = -(-a//d)
if n1 <= n2:
    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())

flag=True
while a>0 and c>0:
   if flag:
      c-=b
      flag = not flag
      continue
   if not flag:
      a-=d
      flag = not flag
      continue
if a<=0:
   print('No')
else:
   print('Yes')

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

t = 0

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

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

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

Solution (Python):

def resolve():
    import sys
    input = sys.stdin.readline
    a,b,c,d = list(map(int, input().split()))
    while True:
        c = c -b
        if c<=0:
            print("Yes")
            break
        a = a - d
        if a<=0:
            print("No")
            break



if __name__ == "__main__":
    resolve()

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

if(flag==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")
        exit()
    A -= D
    if A <= 0:
        print("No")
        exit()

Solution (Python):
th,ta,ah,aa = map(int,input().split())
while th>=1 and ah>=1:
    ah-=ta
    if ah<=0:
        print("Yes")
        exit()
    th-=aa
    if th<=0:
        print("No")  
        exit()

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

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

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

Solution (Python):
















A,B,C,D = map(int,input().split())
T = 0
while A>0 and C>0:
    if T%2 == 0:
        C = C-B
        T += 1
    else:
        A = A-D
        T += 1

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

Solution (Python):
import math
def resolve():
    a, b, c, d = map(int, input().split())
    td = math.ceil(c/b)
    ad = math.ceil(a/d)

    if td > ad:
        print('No')
    else:
        print('Yes')
        
resolve()

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 = [int(i) for i in input().split()]

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

Solution (Python):

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

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



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

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

Solution (Python):
a,b,c,d = map(int,input().split())
c1 , c2 = 0 , 0
while(a>0):
    a -= d
    c1 += 1
while(c>0):
    c  -= b
    c2 += 1

if c1>=c2:
    print('Yes')
else:
    print('No')

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

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

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

Solution (Python):
import numpy as np
from collections import defaultdict
from math import gcd
import time
import sys
from collections import Counter
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
start = time.time()
A, B, C, D = map(int, input().split(' '))

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

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

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

Solution (Python):
abcd = input('')
a = int(abcd.split(' ')[0])
b = int(abcd.split(' ')[1])
c = int(abcd.split(' ')[2])
d = int(abcd.split(' ')[3])
while True:
    c-=b
    if c <=0:
        break
    a-=d
    if a <=0:
        break

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

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

for i in range(1000):
    a = a-d
    c = c-b
    if c <= 0:
        print("Yes")
        break
    if a <= 0:
        print("No")
        break

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

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

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

turn = 1
while a > 0 and c > 0:
   
   if turn % 2 == 1:
      c -= b

   
   else:
      a -= d

   turn += 1

if a > 0 and c <= 0:
   print('Yes')
elif a <= 0 and c > 0:
   print('No')

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

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

Solution (Python):
e=list(map(int, input().split()))
a=e[0]
b=e[1]
c=e[2]
d=e[3]
if a%d==0:
    aoki=a//d
else:
    aoki=a//d+1

if c%b==0:
    taka=c//b
else:
    taka=c//b+1
    
if taka>aoki:
    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")
        exit()
    A = A - D
    if A <= 0:
        print("No")
        exit()

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

t = ABCD[0]
a = ABCD[2]
tAttackFlag = True
while (t > 0 and a > 0):
    if (tAttackFlag):
        a -= ABCD[1]
    else:
        t -= ABCD[3]
    tAttackFlag = not bool(tAttackFlag)

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

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

from math import ceil

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

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

Solution (Python):
from math import ceil

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

tak = ceil(C / B)
ao = ceil(A / D)

if tak <= ao:
  print("Yes")
else:
  print("No")

Solution (Python):
def mapint_inp():
    return map(int, input().split())

def intinp():
    return int(input())

A, B, C, D = mapint_inp()

t_win = True
turn = 1
while A > 0 and C > 0:
    if turn%2==1:
        C -= B
    else:
        A -= D
    turn += 1
    if A <= 0:
        t_win = False
        break
    if C <= 0:
        break

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

Solution (Python):
import sys
def main():
    a, b, c, d= map(int, input().split())
    flag = 1
    while True:
        if flag:
            c -= b
        else:
            a -= d

        flag ^= 1
        if a <= 0 or c <= 0:
            if a <= 0:
                print('No')
                sys.exit()
            else:
                print('Yes')
                sys.exit()

if __name__ == '__main__':
    main()

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

Solution (Python):
a,b,c,d=map(int,input().split())
while True:
    c-=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:
        print('Yes')
        break

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

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

for i in range(1, 300):
    if i%2 == 1:
        c -= b
        if c <= 0:
            print("Yes")
            break
    else:
        a -= d
        if a <= 0:
            print("No")
            break

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

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

current_turn = True
while (A > 0 and C > 0):
    if (current_turn):
        C -= B
    else:
        A -= D
    if (A > 0 and C > 0):
        current_turn = not current_turn
    else:
        break

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

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

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


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

Solution (Python):
def i1str():
    return input()


def istrs(n=None):
    if n is None:
        return input().split()
    a = []
    for _ in range(n):
        a.append(istrs())
    return a


def i1num():
    return int(input())


def inums(n=None):
    if n is None:
        return list(map(int, input().split()))
    a = []
    for _ in range(n):
        a.append(inums())
    return a


def ostrs(l, sp=" "):
    print(sp.join(l))


def onums(l, sp=" "):
    print(sp.join(map(str, l)))


def solve(a, b, c, d):
    is_a_turn = True
    while True:
        if a <= 0:
            return "No"
        if c <= 0:
            return "Yes"
        if is_a_turn:
            c -= b
        else:
            a -= d
        is_a_turn = not is_a_turn


if __name__ == "__main__":
    a, b, c, d = inums()
    print(solve(a, b, c, d))

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

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

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


resolve()

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

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

Solution (Python):
a,b,c,d = [int(c) for c in input().split()]
C1 = c // b + (c % b !=0)
C2 = a // d + (a % d !=0)
if C1 <= C2:
    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:
        print('Yes')
        exit()
    A = A - D
    if A <= 0:
        print('No')
        exit()

Solution (Python):
def solve():
    t_hp, t_at, a_hp, a_at = map(int,input().split())
    turn = 0
    while t_hp > 0 and a_hp > 0:
        if turn % 2 == 0:
            a_hp -= t_at
        else:
            t_hp -= a_at
        turn += 1
    
    if t_hp > 0:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    solve()

Solution (Python):
def main():
    A, B, C, D = list(map(int, input().split(' ')))
    
    isFinish = False
    while not isFinish:
        
        c = C - B
        if c <= 0:
            print('Yes')
            isFinish = True
            break

        C = c
        
        a = A - D
        
        if a <= 0:
            print('No')
            isFinish = True
            break
        A = a
        
        
    
    
    

main()

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

Solution (Python):




def main():
    a, b, c, d = map(int, input().split())
    tt = (c - 1) // b
    at = (a - 1) // d
    r = "Yes" if tt <= at else "No"
    print(r)


if __name__ == '__main__':
    main()

Solution (Python):
import math

ABCDList = input().split()
A = int(ABCDList[0])
B = int(ABCDList[1])
C = int(ABCDList[2])
D = int(ABCDList[3])

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

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

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

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

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

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

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

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

if n<=m:
    print('Yes')
else:
    print('No')

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

Solution (Python):
tt, tk, at, ak = map(int,input().split())

flag = 0

while(tt > 0 and at > 0):
  at -= tk
  if(at <= 0):break
  tt -= ak
  if(tt <= 0):
    flag =1

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

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

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

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

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

Solution (Python):
import sys
import os
import math
import string

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: x * y / math.gcd(x, y)

MOD = 10 ** 9 + 7
MAX = float('inf')


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

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

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


if __name__ == '__main__':
    main()

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):
t_hp, t_at, a_hp, a_at = map(int, input().split())

count = 0
while t_hp*a_hp>0:
  if count % 2 == 0:
    a_hp -= t_at
  else:
    t_hp -= a_at
  count += 1

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

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

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

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


if ad_t >= cb_t:
    print('Yes')
else:
    print('No')

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

A_player = [A, B]
B_player = [C, D]


turn = 0
while((A_player[0] > 0) and (B_player[0] > 0)):

	if(turn == 0):
		B_player[0] -= A_player[1]
	else:
		A_player[0] -= B_player[1]
	
	turn = (turn+1) % 2

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

Solution (Python):
a,b,c,d=map(int, input().split())
val=0
i=0
while True:
    if i%2==0:
        c=c-b
    else:
        a=a-d
    if a<=0 or c<=0:
        if c<=0:
            val=1
        break
    i=i+1
if val==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())
a =  (A + D - 1) // D
b = (C + B - 1) // B
if a >= b :
    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('Yes')
else:
    print('No')

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

for i in range(1000):
    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-1)//b
y=(a-1)//d

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

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

for i in range(100):
  c -= b
  if (c < 1):
    print('Yes')
    break
  a -= d
  if (a < 1):
    print('No')
    break

Solution (Python):
import sys
from random import choice,randint
inp=sys.stdin.readline
out=sys.stdout.write
flsh=sys.stdout.flush
 
sys.setrecursionlimit(10**9)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
 
def MI(): return map(int, inp().strip().split())
def LI(): return list(map(int, inp().strip().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines().strip()]
def LI_(): return [int(x)-1 for x in inp().strip().split()]
def LF(): return [float(x) for x in inp().strip().split()]
def LS(): return inp().strip().split()
def I(): return int(inp().strip())
def F(): return float(inp().strip())
def S(): return inp().strip()
def pf(s): return out(s+'\n')
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)

def main():
    a,b,c,d=MI()
    f=0
    while True:
        if f==0:
            c=c-b
            f=1
            if c<=0:
                print("Yes")
                break
        if f==1:
            a=a-d
            f=0
            if a<=0:
                print("No")
                break

if __name__ == "__main__":
    main()

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

A_rest=A
C_rest=C

while True:
    C_rest-=B
    if C_rest<=0:
        win='Yes'
        break
    A_rest-=D
    if A_rest<=0:
        win='No'
        break
print(win)

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

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

junban = False

while A > 0 and C > 0:
    if junban == False:
        C -= B
        junban = True
    else:
        A -= D
        junban = False

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

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

a = math.ceil(A / D)
b = math.ceil(C / B)
if a >= b:
    print("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 = list(map(int,input().split()))

if A%D != 0:
    E = A//D+1
else:
    E = A//D

if C%B != 0:
    F = C//B +1
else:
    F = C//B
    
if E > F:
    print("Yes")
elif E < F:
    print("No")

else:
    print("Yes")

Solution (Python):


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

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

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

Solution (Python):
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    a,b,c,d=INTM()
    cb=int((c+b-0.1)/b)
    ad=int((a+d-0.1)/d)
    if cb>ad:
        print('No')
    else:
        print('Yes')
if __name__ == '__main__':
    do()

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

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


main()

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

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

if e >= f:
    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())

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

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

Solution (Python):
def main():
    from math import ceil
    a, b, c, d = map(int, input().split())
    n = ceil(c / b)
    m = ceil(a / d)

    if n - 1 < m:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Solution (Python):

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

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

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

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

if aoki > taka:
    print('No')
else:
    print('Yes')

Solution (Python):
A, B, C, D = [int(s) for s 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):
def LI(): return list(map(int,input().split()))
A,B,C,D = LI()
count = 0
while 1:
    count += 1
    C -= B
    if C<=0:
        break
    count += 1
    A -=D
    if A<=0:
        break
print('Yes' if count%2==1 else 'No')

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

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

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

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


if __name__ == '__main__':
    main()

Solution (Python):
import itertools

def solve():
  a, b, c, d = map(int, input().split())
  hoge = 0
  bit = 0
  while True:
    if hoge % 2 == 0:
      c -= b
    if hoge % 2 == 1:
      a -= d
    if a <= 0:
      bit = 0
      break
    if c <= 0:
      bit = 1
      break
    hoge += 1
  if bit == 0:
    print("No")
  else:
    print("Yes")
  return 0
 
if __name__ == "__main__":
  solve()

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


a = -(-A//D)
c = -(-C//B)
print("Yes" if c <= a  else "No")

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

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

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):
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:
    print('Yes')
    exit()
  A-=D
  if A<=0:
    print('No')
    exit()

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

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

Solution (Python):



import sys


def input():
    return sys.stdin.readline()


def resolve():
    t_hp, t_att, a_hp, a_att = map(int, input().split())

    while True:

        a_hp = a_hp - t_att

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

        t_hp = t_hp - a_att

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



if __name__ == "__main__":
    resolve()

Solution (Python):
import numpy as np
a,b,c,d = [int(i) for i in input().split()]

a_num = np.ceil(c/b)
b_num = np.ceil(a/d)

if a_num<=b_num:
    print("Yes")
else:
    print("No")

Solution (Python):
import math

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

takahashi_attack = math.ceil(c / b)
aoki_attack = math.ceil(a / d)

if takahashi_attack <= aoki_attack:
    print('Yes')
else:
    print('No')

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


def waru(a, b):
    if a % b == 0:
        return (a//b)
    else:
        return (a//b)+1


ao_win = waru(A, D)
taka_win = waru(C, B)
if ao_win >= taka_win:
    print('Yes')
else:
    print('No')

Solution (Python):
import sys

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

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

print("No")

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