Problem:
 Score : 200 points    Problem Statement Takahashi and Aoki will have a battle using their monsters.  The health and strength of Takahashi's monster are A and B , respectively, and those of Aoki's monster are C and D , respectively.  The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...
Here, an attack decreases the opponent's health by the value equal to the attacker's strength.
The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.  If Takahashi will win, print Yes ; if he will lose, print No .      Constraints  1 \leq A,B,C,D \leq 100  All values in input are integers.         Input Input is given from Standard Input in the following format:  A  B  C  D       Output If Takahashi will win, print Yes ; if he will lose, print No .        Sample Input 1 10 9 10 10      Sample Output 1 No  First, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1 .  Next, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0 .  Takahashi's monster is the first to have 0 or less health, so Takahashi loses.       Sample Input 2 46 4 40 5      Sample Output 2 Yes

Solution (Python):
import sys
import math
from collections import Counter
import itertools



def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())

def LI(): return list(map(int, sys.stdin.readline().split()))

def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SR(): return sys.stdin.readline().rstrip()

ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
ascii_uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
ascii_uppercase2 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ'


p2D = lambda x: print(*x, sep="\n")
p2E = lambda x: print(''.join(x))
p2S = lambda x: print(*x, sep=" ")



A,B,C,D=MI()

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

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

while ((A > 0) & (C > 0)):
  C -= B
  if C <= 0:
    print("Yes")
    quit()
  A -= D
  
  
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())

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 not(A <= 0 or C <=0):
    C -= B
    if C <=0:
        print('Yes')
        break
    A -= D
    if A <= 0:
        print('No')
        break

Solution (Python):

l = [int(x) for x in input().split()]
while True:
    l[2] = l[2] - l[1]
    if l[2] <= 0:
        print("Yes")
        break
    l[0] = l[0] - l[3]
    if l[0] <= 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):
import sys

A, B, C, D = map(int,input().split())
for i in range (100):
    C = C - B
    if C<=0:
        print('Yes')
        sys.exit()
    A = A - D
    if A<=0:
        print('No')
        sys.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):
a = list(map(int, input().split()))

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

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

Solution (Python):


import sys
import pprint

sys.setrecursionlimit(10 ** 6)

class Logger:
	def __init__(self, debug):
		self.debug = debug
	def print(self, *args):
		if self.debug:
			pprint.pprint(args)


def main():
	log = Logger(1)
	a, b, c, d = map(int, sys.stdin.readline().split())
	turn = 1
	while (a > 0 and c > 0):
		if turn:
			c -= b
		else:
			a -= d
		turn = not turn
	if a <= 0:
		print("No")
	else:
		print("Yes")
	


main()

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

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

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

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

if a > 0:
    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
    else:
        A -= D
    flag = not flag

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

Solution (Python):


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

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

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


taka = 0
ao = 0

while c >= 1:
    c -= b
    ao += 1
    
while a >= 1:
    a -= d
    taka += 1
    
if taka >= ao:
    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):
import math
a, b, c, d = map(int, input().split())
t = math.ceil(a / d)
a = math.ceil(c / b)

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

Solution (Python):
if __name__ == '__main__':
    s = input().rstrip().split(' ')
    A,B,C,D = int(s[0]), int(s[1]), int(s[2]), int(s[3])
    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())
print(["No", "Yes"][(C + B - 1) // B <= (A + D - 1) // D])

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


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

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

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):
a, b, c, d = list(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
r = ''
while True:
	if i % 2 == 0:
		c -= b
		if c <= 0:
			r = 'Yes'
			break
	else:
		a -= d
		if a <= 0:
			r = 'No'
			break
	i += 1
print(r)

Solution (Python):
def solve():
    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__':
    solve()

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

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

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

Solution (Python):

import sys

YES = "Yes"  
NO = "No"  


def solve(A: int, B: int, C: int, D: int):
    while A > 0 and C > 0:
        C -= B
        A -= D
    
    if C <= 0:
        print(YES)
    else:
        print(NO)

    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  
    B = int(next(tokens))  
    C = int(next(tokens))  
    D = int(next(tokens))  
    solve(A, B, C, D)

if __name__ == '__main__':
    main()

Solution (Python):
import math

th, ta, mh, ma = map(int, input().split(" "))

while True:
    mh -= ta
    if mh <= 0:
        print("Yes")
        exit()

    th -= ma
    if th <= 0:
        print("No")
        exit()

Solution (Python):
import sys
from io import StringIO
import unittest


def resolve():
    tak_hp, tak_ak, ao_hp, ao_ak = map(int, input().split())

    for i in range(9999999999999):
        ao_hp -= tak_ak
        if ao_hp <= 0:
            print("Yes")
            return
        tak_hp -= ao_ak
        if tak_hp <= 0:
            print("No")
            return



class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)
    def test_入力例_1(self):
        input = """10 9 10 10"""
        output = """No"""
        self.assertIO(input, output)
    def test_入力例_2(self):
        input = """46 4 40 5"""
        output = """Yes"""
        self.assertIO(input, output)

if __name__ == "__main__":
    
    resolve()

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

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




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

Solution (Python):
import math
import queue

def readInt():
	return int(input())

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

def readChars():
	return input().split()

x = readInts()
a = x[0]
b = x[1]
c = x[2]
d = x[3]

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

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())
for i in range(1,101):
    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())

takahashi=-(-C//B)
aoki=-(-A//D)

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

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

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

def main():
    mod=10**9+7
    a,b,c,d=MI()
    
    t=(c+b-1)//b
    a=(a+d-1)//d
    
    if t<=a:
        print("Yes")
    else:
        print("No")

main()

Solution (Python):
from math import pi, ceil, floor
import numpy as np
from collections import defaultdict, deque, Counter
from operator import itemgetter
from bisect import bisect_left, bisect_right, insort_left, insort_right
import sys
input = sys.stdin.readline





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

if __name__ == '__main__':
    main()

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

i = 0
while A > 0 and C > 0:
    if i % 2 == 0:
        C -= B
    else:
        A -= D
    i += 1
if A > 0:
    print("Yes")
else:
    print("No")

Solution (Python):
a,b,c,d = map(int,input().split())
print ("Yes") if -(-a//d) >= -(-c//b) 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):
def main():
    from builtins import int, map, list, print
    import sys
    sys.setrecursionlimit(10 ** 6)

    input = sys.stdin.readline
    input_list = (lambda: input().rstrip().split())
    input_number = (lambda: int(input()))
    input_number_list = (lambda: list(map(int, input_list())))

    A,B,C,D = input_number_list()
    isNg = True
    while True:
        C-=B
        if C<=0:
            isNg = False
            break
        A-=D
        if A<=0:
            break
    print('YNeos'[isNg::2])


if __name__ == '__main__':
    main()

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

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

Solution (Python):
from math import ceil

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

cnt = ceil(C/B)

if A - D*(cnt-1) > 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")
    exit()
  a-=d
  if a<=0:
    print("No")
    exit()

Solution (Python):
A, B, C, D = list(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())
ta, ao = 0, 0
if c % b == 0:
    ta = c // b
else:
    ta = c // b + 1
if a % d == 0:
    ao = a // d
else:
    ao = a // d + 1
if ta > ao:
    print("No")
else:
    print("Yes")

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

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

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

while a>0 and c>0:
  c = c-b
  a = a-d

if c>0 and a<=0:
  print("No")

else:
  print("Yes")

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

while a > 0 and c > 0:
    if turn == 0:
        c -= b
        turn = 1
    else:
        a -= d
        turn = 0

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

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

Solution (Python):
a,b,c,d=map(int,input().split())
print('YNeos'[0--a//d<0--c//b::2])

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,raw_input().split())
if a%d==0:
	p=a/d
else:
	p=a/d + 1

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

if q<=p:
	print "Yes"

else:
	print "No"

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

takahashi = c//b
aoki = a//d
if c%b != 0:
    takahashi += 1
if a%d != 0:
    aoki += 1

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

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

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

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

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

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

stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() 

def main():
    ta,aa,tb,ab = na()
    cnta = (tb-1)//aa + 1
    cntb = (ta - 1)//ab +1
    if cnta <= cntb:
        print("Yes")
    else:
        print("No")
    return

if __name__ == '__main__':
  main()

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

Solution (Python):
taka_hp, taka_att, aoki_hp, aoki_att = map(int, input().split())

while 1:
    aoki_hp -= taka_att
    if aoki_hp <= 0:
        print("Yes")
        break
    
    taka_hp -= aoki_att
    if taka_hp <= 0:
        print("No")
        break

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

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

for i in range(10**9):
    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):
import math
import fractions
import collections
import itertools
A,B,C,D=map(int,input().split())
tairyoku=[A,C]
cnt=0
while min(tairyoku)>0:
    if cnt%2==0:
        tairyoku[1]=tairyoku[1]-B
    if cnt%2==1:
        tairyoku[0] = tairyoku[0] - D
    cnt=cnt+1
if tairyoku[0]<=0:
    print("No")
else:
    print("Yes")

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

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

flag = 0
T = 1

while flag == 0:
    if T == 1:
        C = C - B
        T = 0
        if C <= 0:
            flag = 1
    else:
        A = A - D
        T = 1
        if A <= 0:
            flag = 2

if T == 1:
    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())

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

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

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

print(battle(A,B,C,D))

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

num_t = c // b
if c % b != 0:
    num_t += 1

num_a = a // d
if a % d != 0:
    num_a += 1


if num_t <= num_a:
    print('Yes')
else:
    print('No')

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

Solution (Python):
from sys import stdin
import sys

A, B, C, D = [int(x) for x in stdin.readline().rstrip().split()]



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

Solution (Python):
import math

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

t = A / D
a = C / B

if math.ceil(t) >= math.ceil(a):
    print("Yes")
else:
    print("No")

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


while(1):

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

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

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

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

e = 0
while True:
    if e % 2 == 0:
      c -= b
      e += 1
    elif e % 2 == 1:
      a -= d
      e += 1

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

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

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

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

Solution (Python):
def n0():return int(input())
def n1():return [int(x) for x in input().split()]
def n2(n):return [int(input()) for _ in range(n)]
def n3(n):return [[int(x) for x in input().split()] for _ in range(n)]

a,b,c,d=n1()

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())
temp = math.ceil(a/d)
temp1 = math.ceil(c/b)
print('Yes' if temp >= temp1 else 'No')

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

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

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

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

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

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

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

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





if __name__ == "__main__":
    resolve()

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

Solution (Python):

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

while a > 0 and c > 0:
    c -= b
    if c <= 0:
        flg = True
        break
    a -= d
    if a <= 0:
        flg = False
        break
    
if not flg:
    print('No')

else:
    print('Yes')

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

Solution (Python):
import sys
int1 = lambda x: int(x) - 1
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)

A, B, C, D = map(int, read().split())
taka = (A + D-1) // D
ao = (C+B-1) // B

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

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

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

if ao < ta:
    print('No')
else:
    print('Yes')

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

takahasi = a
aoki = c
flag = True
while True:
    if takahasi <= 0:
        print("No")
        break
    elif aoki <= 0:
        print("Yes")
        break
    elif flag:
        aoki -= b
        flag = False
    else:
        takahasi -= d
        flag = True

Solution (Python):



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


if __name__ == '__main__':
    main()

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

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

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

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

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

ta = ceil(a / d)
ao = ceil(c / b)

print("Yes" if ta >= ao else "No")

Solution (Python):
A,B,C,D = [int(_n) for _n in input().split()]
taka = C // B + (0 if C % B == 0 else 1)
aoki = A // D + (0 if A % D == 0 else 1)


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

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

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

if t <= o:
    print('Yes')
else:
    print('No')

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

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

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

Solution (Python):

''':'
docker run --rm -it -v $(cd $(dirname $0) && pwd):/vo:ro pypy:3-2.4.0 \
   /bin/bash -c "pypy3 /vo/$(basename $0) < /vo/input.txt"
exit $?
'''
import sys


def _ia(): return map(int, sys.stdin.readline().strip().split())


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


if __name__ == "__main__":
    print(main())

Solution (Python):
import sys
import math
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


def resolve():
    a, b, c, d = map(int, input().split())
    takahashi = math.ceil(c / b)
    aoki = math.ceil(a / d)

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

if __name__ == '__main__':
    resolve()

Solution (Python):
import collections
from collections import defaultdict
import math
import numpy as np
 
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())

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

Solution (Python):
from statistics import median


from fractions import gcd
from itertools import combinations 
from collections import deque
from collections import defaultdict
import bisect










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

def readInts():
  return list(map(int,input().split()))
def main():
    a,b,c,d = readInts()
    while True:
        c -= b
        
        if c <= 0:
            print('Yes')
            exit()
        a -= d
        
        if a <= 0:
            print('No')
            exit()
if __name__ == '__main__':
  main()

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

if __name__ == '__main__':
    main()