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

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

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

Solution (Python):

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

if C%B ==0:
    if A-(C//B-1)*D > 0:
        print('Yes')
    else:
        print('No')
elif C%B != 0:
    if A-(C//B)*D > 0:
        print('Yes')
    else:
        print('No')

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

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

Taka=A/D
Aoki=C/B

if math.ceil(Taka)>=math.ceil(Aoki):
  print("Yes")
else:
  print("No")

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

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

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

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

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

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

Solution (Python):

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

i = 0
while A > 0 and C > 0:
  i += 1
  if i % 2 == 1:
    
    C -= B
  else:
    
    A -= D

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

Solution (Python):
t_p, t_a, a_p, a_a = map(int, input().split())

while True:
  a_p -= t_a
  if a_p <= 0 :
    print('Yes')
    exit()
  
  t_p -= a_a
  if t_p <= 0 :
    print('No')
    exit()

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

    while A>0 and C>0:
        temp += 1
        if temp%2 == 1:
            C = C - B
        else:
            A -= D
        

    if temp%2 == 1:
        return 'Yes'
    else:
        return 'No'

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

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

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

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

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

Solution (Python):
import sys

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

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

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

t_win_turn = c // b
if c % b > 0:
  t_win_turn += 1

a_win_turn = a // d
if a % d > 0:
  a_win_turn += 1

if t_win_turn <= a_win_turn:
  print('Yes')
else:
  print('No')

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

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

Solution (Python):
t_health, t_strength, a_health, a_strength = (int(i) for i in input().split())

while t_health > 0 and a_health > 0:
  a_health -= t_strength
  if a_health <= 0:
    print('Yes')
    break
  t_health -= a_strength
  if t_health <= 0:
    print('No')
    break

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


result = "No"
turn = "t"
while 1:
  if turn == "t":
    C -= B
    turn = "a"
    if C <= 0:
      result = "Yes"
      break
  elif turn == "a":
    A -= D
    turn = "t"
    if A <= 0:
      result = "No"
      break
print(result)

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

Solution (Python):
import math

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

takahashi_attacks = math.ceil(c / b)
aoki_attacks = math.ceil(a / d)

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

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

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

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

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

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

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

for i in range(max(a, b, c, d)):
  if b >= c:
    print('Yes')
    exit()
  else:
    c -= b
    if a <= d:
      print('No')
      exit()
    else:
      a -= d
      continue

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

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

Solution (Python):
MON = list(map(int,input().split()))
 
while 1:
  
  MON[2] = MON[2] - MON[1]
  if(MON[2] <= 0):
    print("Yes")
    break
 
  MON[0] = MON[0] - MON[3]
  if (MON[0] <= 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())
while A > 0 and C > 0:
  C -= B
  if C <= 0:
    break
  A -= D
  if A <= 0:
    break
if C <= 0:
  print('Yes')
if A <= 0:
  print('No')

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

if ac<=cc:
    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())
e = a // d 
f = c // b
if(a % d):
  e += 1
if(c % b):
  f += 1

if(e >= f):
  print("Yes")
else:
  print("No")

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

while True:
    if C <= 0:
        print("Yes")
        break
    if A <= 0:
        print("No")
        break
    if ctr % 2 == 0:
        C -= B
    else:
        A -= D
    ctr += 1

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


if __name__ == '__main__':
    main()

Solution (Python):

from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


def solve():
    A, B, C, D = map(int, input().split())
    while 1:
        C -= B
        if C <= 0:
            print("Yes")
            return

        A -= D
        if A <= 0:
            print("No")
            return


def main():
    solve()


if __name__ == '__main__':
    main()

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

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

while A>0 and C>0:
    C = C - B
    if C <= 0:
        print("Yes")
        break
    A = A - D
    if A <= 0:
        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
  a-=d
  if a<=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):
taka_h, taka_a, aoki_h, aoki_a = map(int, input().split())

while True:
    aoki_h -=taka_a
    taka_h -= aoki_a
    if(aoki_h <=0):
        print("Yes")
        break
    elif(taka_h <= 0):
        print("No")
        break

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

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

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())
t_turn = C // B + (C % B != 0)
a_turn = A // D + (A % D != 0)
print('Yes' if t_turn <= a_turn else 'No')

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

turn = "t"
while (t_hp > 0) and (a_hp > 0):
    if turn == "t":
        a_hp -= t_atk
        if a_hp > 0:
            turn = "a"
    else:
        t_hp -= a_atk
        if t_hp > 0:
            turn = "t"
if turn == "t":
    print("Yes")
else:
    print("No")

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 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())
count_a = 0
count_c = 0
while A>D:
  A -= D
  count_a += 1
while C>B:
  C -= B
  count_c += 1
count_a = (count_a+1)*2
count_c = (count_c*2)+1
if count_a>=count_c:
  print('Yes')
else:
  print('No')

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

t = 0
while True:
    if t % 2 == 0:
        c -= b
        if c <= 0:
            print('Yes')
            exit()
    else:
        a -= d
        if a <= 0:
            print('No')
            exit()
    t += 1

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

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

while A > 0 and C > 0:
    if Flag == 1:
        C -= B
        Flag = 2
    else:
        A -= D
        Flag = 1

if Flag == 2:
    print('Yes')
else:
    print('No')

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

for i in range(1000):
    if i % 2:
        a -= d
    else:
        c -= b
    if a <= 0:
        print("No")
        exit()
    elif c <= 0:
        print('Yes')
        exit()

Solution (Python):
import math

As,Aa,Bs,Ba = map(int,input().split())
Na = math.ceil(Bs/Aa)
Nb = math.ceil(As/Ba)
 
if Na <= Nb:
  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):
hp_t, at_t, hp_a, at_a = list(map(int, input().split()))

if(hp_t%at_a == 0 ):
    
    num_a = hp_t // at_a
else:
    num_a = hp_t // at_a + 1

if(hp_a%at_t == 0 ):
    
    num_t = hp_a // at_t
else:
    num_t = hp_a // at_t + 1

if(num_a >= num_t):
    print("Yes")
else:
    print("No")

Solution (Python):
hp_t, at_t, hp_a, at_a = list(map(int, input().split()))

if(hp_t%at_a == 0 ):
    
    num_a = hp_t // at_a
else:
    num_a = hp_t // at_a + 1

if(hp_a%at_t == 0 ):
    
    num_t = hp_a // at_t
else:
    num_t = hp_a // at_t + 1

if(num_a >= num_t):
    print("Yes")
else:
    print("No")

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

Solution (Python):
t1,t2,a1,a2=map(int,input().split())
if (a1+t2-1)//t2<=(t1+a2-1)//a2:
    ans="Yes"
else:
    ans="No"
print(ans)

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

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

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

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

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

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

while A >= 1:
    A = A - D
    cnt_1 += 1
    
while C >= 1:
    C = C - B
    cnt_2 += 1
    
if cnt_1 >= cnt_2:
    print('Yes')
else:
    print('No')

Solution (Python):
import sys

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

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

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

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

Solution (Python):
from sys import exit

A, B, C, D = [int(x) for x in 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())

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

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

a=l[0]
b=l[1]
c=l[2]
d=l[3]

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())
for i in range(100):
  c -= b
  if c <=0:
    ans = 'Yes'
    break
  a -= d
  if a <= 0:
    ans = 'No'
    break
print(ans)

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

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

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

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

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

def int1(x): return int(x) - 1
def II(): return int(input())
def MI(): return map(int, input().split())
def MI1(): return map(int1, input().split())
def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def MS(): return input().split()
def LS(): return list(input())
def LLS(rows_number): return [LS() for _ in range(rows_number)]
def printlist(lst, k=' '): print(k.join(list(map(str, lst))))
INF = float('inf')







def solve():
    h_taka, a_taka, h_ao, a_ao = MI()

    def attack(h, a):
        return h - a

    turn_taka = 1
    while h_taka > 0 and h_ao > 0:
        if turn_taka:
            h_ao = attack(h_ao, a_taka)
        else:
            h_taka = attack(h_taka, a_ao)

        turn_taka = 1 - turn_taka
        

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

if __name__ == '__main__':
    solve()

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

Solution (Python):
a,b,c,d=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 = (int(a) for a in input().split())
x = -(-A//D)
y = -(-C//B)
if y <= x :
    print("Yes")
else :
    print("No")

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

Solution (Python):
import math
a,b,c,d= map(int,input().split())
n=math.ceil(float(a)/d)
m=math.ceil(float(c)/b)
if m<=n:
  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())
p = 0


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

Solution (Python):



import math as m

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

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

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

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

for i in range(max(A, C)):
    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())
print("YNeos"[-(-c // b) > -(-a // d)::2])

Solution (Python):
a,b,c,d=[int(_) for _ in input().split()]
if c%b!=0:
    count_1=c//b+1
else:
    count_1=c//b
if a%d!=0:
    count_2=a//d+1
else:
    count_2=a//d

if count_1<=count_2:
    ans='Yes'
else:
    ans='No'
print(ans)

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

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

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

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

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

Solution (Python):
a, b, c, d = map(int, input().split())
if a % d != 0:
  tk = a // d + 1
else:
  tk = a // d

if c % b != 0:
  ao = c // b + 1
else:
  ao = c // b

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

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

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

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

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

if X >= Y:
    print("Yes")
else:
    print("No")

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

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

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

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

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

Solution (Python):
tt,ta,at,aa=map(int,input().split())
 
for i in range(100):
 at-=ta 
 if at>0:
    pass
 elif at<=0:
    print("Yes")
    exit()
 tt-=aa
 if tt>0:
    pass
 elif tt<=0:
    print("No")
    exit()

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

A=math.ceil(c/b)
B=math.ceil(a/d)

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

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

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

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

Solution (Python):
import sys

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

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

Solution (Python):


import copy
import random
import bisect 
import fractions 
import math
import sys
import collections
from decimal import Decimal 

mod = 10**9+7
sys.setrecursionlimit(mod) 

d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))

A,B,C,D = LI()

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

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

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

i = 0
while True:
    if i % 2 == 0:
        c-=b
    else:
        a-=d

    if c <= 0:
        print('Yes')
        break
    if a <= 0:
        print('No')
        break
    i += 1

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

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

Solution (Python):
ta_HP,ta_AT,ao_HP,ao_AT = map(int,input().split())

while True:
    ao_HP -= ta_AT
    if ao_HP <= 0:
        print('Yes')
        break
    ta_HP -= ao_AT
    if ta_HP <= 0:
        print('No')
        break

Solution (Python):
import sys 
import math
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
a,b,c,d = map(int,readline().split())
T = int(math.ceil(a / d))
A = int(math.ceil(c / b))
if A > T:
    print('No')
else:
    print('Yes')

Solution (Python):
def main():
    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:
        print('No')
    elif C <= 0:
        print('Yes')
main()

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

taka_att = math.ceil(c / b)
aoki_att = math.ceil(a / d)

if taka_att <= aoki_att:
    print('Yes')
else:
    print('No')

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

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

while True:
    c -= b
    a -= d

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

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

turn_taka = True
while True:
    if turn_taka:
        c -= b
    else:
        a -= d

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

    turn_taka = not turn_taka

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

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

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

x = (a+d-1)//d
y = (c+b-1)//b
if x>= y:
 print("Yes")
else:
 print("No")

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

x = (a+d-1)//d
y = (c+b-1)//b
if x>= y:
  print("Yes")
else:
  print("No")

Solution (Python):
t1,t2,a1,a2=map(int,input().split())
if (a1+t2-1)//t2<=(t1+a2-1)//a2:
    ans="Yes"
else:
    ans="No"
print(ans)

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

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

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

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

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

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

Solution (Python):
def main():

    A, B, C, D = input_ints()

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

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


def input_int():
    return int(input())


def input_ints():
    return map(int, input().split())


def input_int_list_in_line():
    return list(map(int, input().split()))


def input_int_tuple_list(n: int, q: int):
    return [tuple(map(int, input().split())) for _ in range(n)]


main()

Solution (Python):
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

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

print(main(a, b, c, d))

Solution (Python):
import math
A,B,C,D=map(int,input().split())
hit1=math.ceil(C/B)
hit2=math.ceil(A/D)
print('Yes' if hit1<=hit2 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):
A, B, C, D = map(int, input().split()) 
i = 0
while True:
    if i % 2 == 0:
        C -= B
        if C <= 0:
            print("Yes")
            break
    else:
        A -= D
        if A <= 0:
            print("No")
            break
    i += 1

Solution (Python):
h1,s1,h2,s2 = map(int, input().split())

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

Solution (Python):


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

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

Solution (Python):
import math

def solve(a,b,c,d):
  x = math.ceil(c / b)
  y = math.ceil(a / d)
  return "Yes" if x <= y else "No"

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