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

turn=0
while True:
    if turn%2 == 0:
        num[2] = num[2]-num[1]
        if num[2] <= 0:
            print('Yes')
            break
    else:
        num[0] = num[0]-num[3]
        if num[0] <= 0:
            print('No')
            break
    turn += 1

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

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

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

if A_count < B_count:
    print("No")
else:
    print("Yes")

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

if A % D == 0:
  A_Attack = A // D
else:
  A_Attack = A // D + 1
  
if C % B == 0:
  T_Attack = C // B
else:
  T_Attack = C // B + 1


if A_Attack >= T_Attack:
  print("Yes")
else:
  print("No")

Solution (Python):
a=input().split()
A=int(a[0])
B=int(a[1])
C=int(a[2])
D=int(a[3])
T=int((C-1)/B)
A=int((A-1)/D)

if T<=A :
  print ('Yes')
else :
  print('No')

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

def turn(A,B):
    if A%B ==0:
        return A//B
    else:
        return A//B + 1
if turn(A,D) >= turn(C,B):
    print("Yes")
else:
    print("No")

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


while True:

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

    A = A - D

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

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

for _ in range(10000):
  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())

import math

T=math.ceil(C/B+1)
A=math.ceil(A/D+1)

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

Solution (Python):
import math, sys
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict, deque
from copy import deepcopy
from functools import lru_cache
from heapq import heapify, heappop, heappush
from itertools import accumulate, combinations, permutations
input = sys.stdin.readline
mod = 10**9 + 7
ns = lambda: input().strip()
ni = lambda: int(input().strip())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))

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


if __name__ == '__main__':
    main()

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

for i in range(10000):
    if C <= 0:
        print('Yes')
        exit()
    else:
        C -= B

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

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

while True:
    if flg:
        c -= b
        flg = False
    else:
        a -= d
        flg = True

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

Solution (Python):
import sys
input = lambda: sys.stdin.readline().rstrip() 

def resolve():
    A, B, C, D = map(int, input().split())
    if C//B+(C%B>0) <= A//D+(A%D>0):
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    resolve()

Solution (Python):
A=list(map(int,input().split()))
_=True
while _ == True:
  A[2]-=A[1]
  if A[2]<=0:
    print("Yes")
    _=False
  else:
    A[0]-=A[3]
    if A[0]<=0:
      print("No")
      _=False

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

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

times_1 = math.ceil(C / B)
times_2 = math.ceil(A / D)

if times_1 <= times_2:
    print('Yes')
elif times_1 > times_2:
    print('No')

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

for i in range(120):
	if b*i>=c:
		print('Yes')
		break
	elif d*i>=a:
		print('No')
		break

Solution (Python):
a,b,c,d=map(int,input().split())
tak=-(-a//d)
aoki=-(-c//b)
if tak<aoki:
    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')
        break
    a-=d
    if a<=0:
        print('No')
        break

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

a, b, c, d = [int(x) for x in stdin.readline().rstrip().split()]

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

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

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

x = math.ceil(a/d)
y = math.ceil(c/b)

if x == y:
    print('Yes')
elif x > y:
    print('Yes')
else:
    print('No')

Solution (Python):

import sys
from collections import Counter
from itertools import permutations, combinations

from math import gcd
from math import ceil, floor
import bisect
sys.setrecursionlimit(10 ** 6)
inf = float("inf")

def input():
    return sys.stdin.readline()[:-1]

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

if __name__ == '__main__':
    main()

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

_d = (a+d-1)//d
_b = (c+b-1)//b


if _d < _b:
    ans = 'No'
else:
    ans = 'Yes'

print(ans)

Solution (Python):
th,ts,ah,ae=map(int,input().split())
while(th>0 and ah>0):
  ah=ah-ts
  if(ah<=0):
    break
  else:
    th=th-ae
if(th>0):
  print("Yes")
else:
  print("No")

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

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

while A > 0:
    C = C - B
    if not(C > 0):
        print('Yes')
        break
    A = A - D

if not(A > 0):
    print('No')

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

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

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

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

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


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

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

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

if flag:
    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 sys
from math import sqrt
from collections import Counter, defaultdict, deque

input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)


def I():
    return int(input())


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


def LI():
    return list(MI())


def LIN(n: int):
    return [I() for _ in range(n)]


inf = float("inf")
mod = 10 ** 9 + 7


def main():
    a, b, c, d = MI()

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


if __name__ == "__main__":
    main()

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

who = 1
while(a > 0 and c > 0):
  if(who == 0):
    a -= d
  else:
    c -= b
  who = 1 - who

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

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())
num_t = -(-c//b)
num_a = -(-a//d)
if num_t <= num_a:
  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):
A,B,C,D=map(int,input().split())
count=0
for i in range(1000):
    if i%2==0:
        C-=B
    else:
        A-=D
    if A<=0:
        print("No")
        exit()
    if C<=0:
        print("Yes")
        exit()

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):
taka_ta, taka_ko, aoki_ta, aoki_ko = list(map(int, input().split()))

while True:
    aoki_ta -= taka_ko
    if aoki_ta <= 0:
        print('Yes')
        break
    
    taka_ta -= aoki_ko
    if taka_ta <=0 :
        print('No')
        break

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

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

Solution (Python):
def main():
    A, B, C, D = map(int, input().split())
    t = C // B
    if C % B != 0 :
        t = t + 1
    a = A // D
    if A % D != 0 :
        a = a + 1
    if t <= a :
        print("Yes")
    else :
        print("No")


if __name__ == '__main__':
    main()

Solution (Python):
a,b,c,d = (int(x) for x in input().split())
while a>0:
  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(" ")))
if c%b==0:
  taro=c//b
else:
  taro=c//b+1
if a%d==0:
  sasaki=a//d
else:
  sasaki=a//d+1

if taro<=sasaki:
  print("Yes")
else:
  print("No")

Solution (Python):
import math

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

y = math.ceil(A/D)
n = math.ceil(C/B)

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

Solution (Python):
from math import ceil

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

    t_turns = ceil(A / D)
    a_turns = ceil(C / B)

    if t_turns >= a_turns:
        print("Yes")
    else:
        print("No")

if __name__ == '__main__':
    main()

Solution (Python):
import math
def monsterbattle(th, ts, ahh, ahs):
  tscore = math.ceil(ahh/ts)
  ascore = math.ceil(th/ahs)
  if(tscore<=ascore):
    return "Yes"
  else:
    return "No"

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

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

Solution (Python):
A, B, C, D = [int(i) for i in 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())
for i in range(200):
    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("No")
else:
    print("Yes")

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

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

Solution (Python):
import numpy as np
num_list = [int(i) for i in input().split()]

t_a = np.ceil(num_list[2] / num_list[1])
a_t = np.ceil(num_list[0] / num_list[3])

if t_a <= a_t:
    print('Yes')
else:
    print('No')

Solution (Python):
import sys

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

while (A>0 or C>0):
    C-=B

    if C <= 0:
        ans='Yes'
        break;

    A-=D

    if A <= 0:
        ans='No'
        break;

print(ans)

Solution (Python):
abcd=list(map(int,input().split()))
count=1
while(abcd[0]>0 and abcd[2]>0):
    if((count%2)==1):
        abcd[2]-=abcd[1]
    else:
        abcd[0]-=abcd[3]
    count+=1
if(abcd[0]>0 and abcd[2]<=0):
        print('Yes')
if(abcd[0]<=0 and abcd[2]>0):
    print('No')

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

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

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


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

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

    c1 = c // b + 1
    if c % b == 0:
        c1 -= 1

    c2 = a // d + 1
    if a % d == 0:
        c2 -= 1

    ans = 'Yes' if c1 <= c2 else 'No'
    print(ans)


if __name__ == '__main__':
    main()

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

print(res)

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

Solution (Python):
def main():
    A, B, C, D = [int(i) for i in input().split()]
    while(True):
        C = C - B
        if C<=0:
            print("Yes")
            break
        A = A - D
        if A<=0:
            print("No")
            break

if __name__ == "__main__":
    main()

Solution (Python):

def main():
    import sys
    A,B,C,D=map(int,input().split())
    for i in range(100):
        A=A-D
        C=C-B
        if C<=0:
            print("Yes")
            sys.exit()
        elif A<=0:
            print("No")
            sys.exit()
        

    

if __name__ == '__main__':
    main()

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

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

if bool:
    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 True:
    C=C-B
    if C>0:
        pass
    else:
        print("Yes")
        break

    A=A-D
    if A>0:
        pass
    else:
        print("No")
        break

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

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

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

Solution (Python):



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


def main():
    a = A // D if A % D == 0 else A // D + 1
    b = C // B if C % B == 0 else C // B + 1
    ans = "No" if a < b else "Yes"
    print(ans)
    

if __name__ == "__main__":
    main()

Solution (Python):
def checkWin(T_hp, A_hp):
    if (T_hp <= 0):
        print('No')
    if (A_hp <= 0):
        print('Yes')

T_hp, T_at, A_hp, A_at = list(map(int, input().split()))

while (T_hp > 0 and A_hp > 0):
    A_hp = A_hp - T_at
    T_hp = T_hp - A_at

    if (A_hp <= 0):
        print('Yes')
        break

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

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

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

Solution (Python):
from math import ceil
HealthA, AtkA, HealthB, AtkB = map(int, input().split())
num_takahashi = ceil(HealthB/AtkA)
num_aoki = ceil(HealthA/AtkB)
if num_takahashi<= num_aoki:
    print("Yes")
else:
    print("No")

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

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

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

Solution (Python):


def main():

    n = [int(x) for x in input().split(' ')]
    a = n[0]
    b = n[1]
    c = n[2]
    d = n[3]
    
    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())

while A > 0 and C > 0:
    C -= B
    A -= D

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

Solution (Python):
import math

line=list(map(int,input().split(' ')))

print('Yes') if math.ceil(line[2]/line[1])<=math.ceil(line[0]/line[3]) else print('No')

Solution (Python):
a,b,c,d=map(int,input().split())
q,mod=divmod(c,b)
r,mod2=divmod(a,d)
q= q+1 if mod else q
r= r+1 if mod2 else r
print("Yes" if q<=r 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())
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())
Q, R = divmod(C, B)
q, r = divmod(A, D)
if R > 0:
    Q = Q + 1
if r > 0:
    q = q + 1
if Q <= q:
    print('Yes')
elif Q > q:
    print('No')

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

from math import ceil

taka = ceil(a/d)
aoki = ceil(c/b)

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

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


def main():
    l = [int(e) for e in si().split()]
    Tcnt, Acnt = 0, 0
    while l[0] > 0:
        l[0] -= l[3]
        Tcnt += 1
    while l[2] > 0:
        l[2] -= l[1]
        Acnt += 1
    if Tcnt >= Acnt:
        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 =  [int(i) for i in input().split()]

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

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

s='Yes'

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

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

t_count=0
a_count=0

if A%D!=0:
    t_count+=1
if C%B!=0:
    a_count+=1

t_count+=int(A/D)
a_count+=int(C/B)

if t_count>=a_count:
    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):
i = list(map(int, input().split()))


h1=i[0]
a1=i[1]
h2=i[2]
a2=i[3]

while True:
  h2 = h2 - a1
  if h2 <= 0:
    print("Yes")
    exit()
  h1 = h1 - a2
  if h1 <= 0:
    print("No")
    exit()

Solution (Python):
import math

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

taikyu_t = math.ceil(A / D)
taikyu_a = math.ceil(C / B)

if taikyu_a <= taikyu_t:
    
    print('Yes')
else:
    
    print('No')

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

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

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

print('Yes' if turn == 1 else 'No')

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

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

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

t_h = int(a[0])
t_a = int(a[1])
a_h = int(a[2])
a_a = int(a[3])

i = 0

while True:
  
  if(i%2==0):
    a_h = a_h - t_a
    if(a_h <= 0):
      print("Yes")
      break
  
  elif(i%2!=0):
    t_h = t_h - a_a
    if(t_h <= 0):
      print("No")
      break
  i = i + 1

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

if C%B == 0:
    tak = C//B
else:
    tak = C//B + 1
if A%D == 0:
    aok = A//D
else:
    aok = A//D + 1

if tak <= aok:
    print('Yes')
else:
    print('No')

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

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

Solution (Python):


import sys
import math
import bisect
from fractions import gcd
from itertools import count, permutations
from functools import lru_cache
from collections import deque, defaultdict
from pprint import pprint

INF = float('inf')

ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
lmtx = lambda h: [list(map(int, lmis())) for _ in range(h)]
sys.setrecursionlimit(1000000000)


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



a, b, c, d = mis()

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

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

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

t = math.ceil(c / b)
ao = math.ceil(a / d)

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

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

Solution (Python):

from sys import stdin
from operator import itemgetter
from collections import deque, Counter
import math
import pprint
from functools import reduce


MOD = 1000000007

def keta(kazu):
    kazu_str = str(kazu)
    kazu_list = [int(kazu_str[i]) for i in range(0, len(kazu_str))]
    return kazu_list

def gcd(*numbers):
    return reduce(math.gcd, numbers)

def combination(m,n):
    if n > m:
        return 'すまん'
    return math.factorial(m) // (math.factorial(m-n) * math.factorial(n))

T_H, T_A, A_H, A_A = [int(x) for x in stdin.readline().rstrip().split()]

while 1:
    T_H -= A_A
    A_H -= T_A
    if A_H <= 0:
        print("Yes")
        break
    elif T_H <= 0:
        print("No")
        break

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


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

  if C <= 0:
    print("Yes")
    sys.exit()
    
  count += 1

Solution (Python):
import sys

l = sys.stdin.readline()
a, b, c, d = [ int(v) for v in l.split() ] 

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

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

Solution (Python):
def battle(a,b,c,d):
    while True:
        c -= b
        if c<=0:
            break
        a -= d
        if a<=0:
            break
   
    if a<=0:
        print('No')
    else:
        print('Yes')

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

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



t_life= math.ceil(a/d)
a_life= math.ceil(c/b)

if t_life < a_life:
    print("No")
else:
    print("Yes")

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



def solve(*args: str) -> str:
    a, b, c, d = map(int, args[0].split())

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


if __name__ == "__main__":
    print(solve(*(open(0).read().splitlines())))

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

Solution (Python):
td, ta, ad, aa = map(int, input().split())

which = -1
while td > 0 and ad > 0:
    if which == -1:
        ad -= ta
    else:
        td -= aa
    which *= -1

if ad <= 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):
A, B, C, D = map(int, input().split())
turn = "t"
while(A > 0 and C > 0):
    if turn == "t":
        C -= B
        turn = "a"
    else:
        A -= D
        turn = "t"
if A <= 0:
    print("No")
elif C <= 0:
    print("Yes")

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

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

t_flag = True

while True:
    if A <= 0:
        t_flag = False
        break

    C -= B

    if C <= 0:
        t_flag = True
        break

    A -= D

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

Solution (Python):
import math

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

cnt1 = math.ceil(C / B)
cnt2 = math.ceil(A / D)

if cnt1 <= cnt2:
    print('Yes')
else:
    print('No')

Solution (Python):
def main():
    import sys

    input = sys.stdin.readline
    a, b, c, d = map(int, input().split())
    f = -1
    for i in range(1000):
        if c - b <= 0:
            f = "T"
            break
        else:
            c = (c - b)
        if a - d <= 0:
            f = "A"
            break
        else:
            a = (a - d)
    if f == "T":
        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):
import sys
a, b, c, d =list(map(int, input().split()))

while True:
    if c-b <= 0:
        print("Yes")
        sys.exit()

    elif a-d <= 0:
        print("No")
        sys.exit()

    else:
        c= c-b
        a= a-d

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

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

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

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

if n_a >= n_c:
    print("Yes")
else:
    print("No")

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

import math

A_attack = math.ceil(C / B)
B_attack = math.ceil(A / D)

if A_attack <= B_attack:
    print("Yes")
else:
    print("No")

Solution (Python):
import math

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

if math.ceil(c/b) > math.ceil(a/d):
	print('No')
else:
	print('Yes')

Solution (Python):
tmp = input().split()
Lt = int(tmp[0])
At = int(tmp[1])
La = int(tmp[2])
Aa = int(tmp[3])

while True:
    La = La - At
    if La <= 0:
        print('Yes')
        break
    Lt = Lt - Aa
    if Lt <= 0:
        print('No')
        break

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