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 = [int(i) for i in input().split()]
nT = (C + B - 1) // B 
nA = (A + D - 1)// D
if nT <= nA:
  print("Yes")
else:
  print("No")

Solution (Python):
printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
ins = lambda : input().strip()
DBG = True 
BIG = 10**18
R = 10**9 + 7

def ddprint(x):
  if DBG:
    print(x)

a,b,c,d = inm()
for i in range(101):
    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 = 1
while A > 0 and C > 0:
    if i % 2 == 1:
        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())
check=True
while True:
    if check:
        c-=b
        if c<=0:
            print("Yes")
            break
    else:
        a-=d
        if a<=0:
            print("No")
            break
    check=not check

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

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

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

Solution (Python):


def solve():

    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__":
    solve()

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

if __name__ == '__main__':
    main()

Solution (Python):


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


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

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

takahashi = (c+b-1)//b
aoki = (a+d-1)//d

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

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(2 * 10**6)


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


def main():
    A, B, C, D = inpl()
    takahashi = (C + B - 1) // B
    aoki = (A + D - 1) // D

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


if __name__ == '__main__':
    main()

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

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

Solution (Python):

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

if A-(math.ceil(C/B) -1)*D >0:
    print("Yes")
else:
    print("No")

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

Solution (Python):
def read_int():
    return int(input())

def read_int_map():
    return map(int,input().split(' '))

def read_int_list():
    return list(map(int,input().split(' ')))
import math

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

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

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

Solution (Python):
import sys
import numpy as np
a, b, c, d = map(int, sys.stdin.readline().strip().split())

attack_t = np.ceil(c / b)
attack_a = np.ceil(a / d)

if attack_t <= attack_a:
    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")
    exit()
  a=a-d
  if a<=0:
    print("No")
    exit()

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

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

ans='No'
while A>0 and C>0:
    C-=B
    if C<=0:
        ans='Yes'
        break
    A-=D

print(ans)

Solution (Python):
import sys
input = sys.stdin.readline
def main():
    A, B, C, D = map(int, input().split())
    ans = "Yes"
    while A > 0 or C > 0:
        C -= B
        if C <= 0:
            break
        A -= D
        if A <= 0:
            ans = "No"
            break
    print(ans)
if __name__ == "__main__":
    main()

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

t = 0

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

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

hp_t=a
hp_a=c

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


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):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)


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


main()

Solution (Python):
import math
from collections import defaultdict
ml=lambda:map(int,input().split())
ll=lambda:list(map(int,input().split()))
ii=lambda:int(input())
ip=lambda:(input())

"""========main code==============="""

a,b,c,d=ml()
i=0
while(a>0 and c>0):
    if(i%2==0):
        c-=b
    else:
        a-=d
    i+=1    
if(a<=0):
    print("No")
elif c<=0:
    print("Yes")

Solution (Python):
import math

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

t_cnt = math.ceil(C / B)
a_cnt = math.ceil(A / D)

print('Yes' if t_cnt <= a_cnt else 'No')

Solution (Python):
if __name__ == '__main__':
    from sys import stdin
    input = stdin.readline

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

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

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

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

if taka_kougeki <= ao_kougeki:
    print("Yes")
else:
    print("No")

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


takahasi_times = -(-c // b)
aoki_times = -(-a // d)

if takahasi_times <= aoki_times:
    print('Yes')
else:
    print('No')

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

if c%b:
    aoki = c//b + 1
else:
    aoki = c//b

if a%d:
    ta = a//d + 1
else:
    ta = a//d

if aoki > ta:
    print("No")
else:
    print("Yes")

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

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

taka=(c+b-1)//b
ao=(a+d-1)//d

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

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

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

print('YNeos'[A<C::2])

Solution (Python):
A,B,C,D=[int(i) for i in input().split()]
aokiAttack=A//D+(A%D>0)
takahashiAttack=C//B+(C%B>0)

print("Yes" if takahashiAttack<=aokiAttack else "No")

Solution (Python):
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

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

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

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

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

        a -= d
        if a <= 0:
            print('No')
            exit()


if __name__ == '__main__':
    main()

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

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

a_hp = (a // d) + 1 if a%d!=0 else a//d
c_hp = (c // b) + 1 if c%b!=0 else c//b

if a_hp >= c_hp:
    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())

takahashi = (C+B-1)//B
aoki      = (A+D-1)//D
if takahashi <= aoki:
    print('Yes')
else:
    print('No')

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

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

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

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

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

Solution (Python):

import sys


def answer(A,B,C,D):
    flag = True
    while True:
        if(flag):
            C -= B
            if(C <= 0):
                return "Yes"
            else:
                flag = False
        else:
            A -= D
            if(A <= 0):
                return "No"
            else:
                flag = True


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

if __name__ == '__main__':
   main()

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

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

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

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

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

Solution (Python):

def main():
    a,b,c,d = map(int,input().split())
    takahashi_hp = a
    takahashi_at = b
    aoki_hp = c
    aoki_at = d

    takahashi_win = False

    while takahashi_hp >= 0 and aoki_hp >= 0:
        aoki_hp -= takahashi_at
        if aoki_hp <= 0:
            takahashi_win = True
            break
        takahashi_hp -= aoki_at
        if takahashi_hp <= 0:
            takahashi_win = False
            break

    print("Yes" if takahashi_win else "No")

if __name__ == '__main__':
    main()

Solution (Python):
import sys
stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)

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

a,b,c,d = LI()
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')
else:
  print('No')

Solution (Python):



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

count_t = -(-c // b)
count_a = -(-a // d)

if count_t <= count_a:
  print("Yes")
else:
  print("No")

Solution (Python):
a, b, c, d = map(int, input().split())
x = (a + d - 1) // d
y = (b + c - 1) // b
if x >= y:
    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):

import sys

YES = "Yes" 
NO = "No" 

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

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

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

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

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

Solution (Python):
a = list(map(int,input().split()))
th = a[0]
ta = a[1]
ah = a[2]
aa = a[3]
res = ''
while th>0 or ah>0:
    ah -= ta
    if ah<=0:
        res = 'Yes'
        break
    else:
        th -= aa
    if th<=0:
        res = 'No'
        break
print(res)

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

def RD(): return sys.stdin.read()
def II(): return int(input())
def MI(): return map(int,input().split())
def LI(): return list(map(int,input().split()))
def TI(): return tuple(map(int,input().split()))


def main():
    A,B,C,D = MI()

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




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

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

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

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

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

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

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

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

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

Solution (Python):
from math import ceil
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines

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

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

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


if __name__ == "__main__":
    main()

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


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

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

if n1<=n2:
    print("Yes")
else:
    print("No")

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

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

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

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

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

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

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

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

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

print(ans)

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

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

if (C % B == 0):
    t = C / B
else:
    t = (C // B) + 1

if (A % D == 0):
    t2 = A / D
else:
    t2 = (A // D) + 1

if (t > t2):
    print('No')
else:
    print('Yes')

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

turn_t = math.ceil(C / B);
turn_a = math.ceil(A / D);

print("No" if turn_t > turn_a else "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):
A, B, C, D = [int(x) for x in input().split()]

Taka_HP = A
ao_HP = C

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

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

        
    

if __name__ == "__main__":
    main()

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):
a, b, c, d = map(int, input().split())
for i in range(100):
    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=int((A-1)/D)+1
F=int((C-1)/B)+1
if F<=E:
 print("Yes")
else:
 print("No")

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

cnt_a = c // b if c % b == 0 else c // b + 1
cnt_c = a // d if a % d == 0 else a // d + 1
if cnt_a <= cnt_c:
    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())
ans = "No" if -(-c//b) > -(-a//d) else "Yes"
print(ans)

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

if k1 <= k2: print("Yes")
else: print("No")

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
    a,b,c,d=map(int,input().split())
    x=-(-c//b)
    y=-(-a//d)
    if x<=y:
        print("Yes")
    else:
        print("No")

if __name__=='__main__':
    main()

Solution (Python):
from functools import reduce
from fractions import gcd
import math
import bisect
import itertools
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
INF = float("inf")


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

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


if __name__ == '__main__':
    main()

Solution (Python):
def solve(a, b, c, d):
    while a > 0 and c > 0:
        c -= b
        if c <= 0:
            return True
        a -= d
        if a <= 0:
            return False
    pass


if __name__ == "__main__":
    a, b, c, d = map(int, input().split())
    print("Yes" if solve(a, b, c, d) else "No")

Solution (Python):
a,b,c,d=map(int,input().split())
for i in range(1,101):
    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,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())
if (-c//b)*(-1)<=(-a//d)*(-1):
    print('Yes')
else:
    print('No')

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

Solution (Python):
import queue
import copy
import math
from collections import deque
import bisect


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

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

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

while True:
    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())
m = 0
for i in range(200):
    c -= b
    if c <= 0:
        m = 1
        break
    a -= d
    if a <= 0:
        m = 2
        break
print("Yes" if m == 1 else "No")

Solution (Python):
import math
A,B,C,D=list(map(int,input().split()))
t1 = math.ceil(C/B)
t2 = math.ceil(A/D)
if t1<=t2:
    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:
        flg=1
        break
    A-=D
    if A<=0:
        flg=0
        break
print("Yes" if flg else "No")

Solution (Python):
a,b,c,d= map(int,input().split())
true = True
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())
num_t = c // b + int((c%b) > 0)
num_a = a // d + int((a%d) > 0)
if num_t <= num_a:
  print("Yes")
else:
  print("No")

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

if __name__ == '__main__':
  main()

Solution (Python):




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



def int1(x):
    return int(x) - 1



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



def input_to_int_tuple():
    return tuple(map(int, input().split()))



def input_to_int_tuple_minus1():
    return tuple(map(int1, input().split()))


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

    ret = "No"

    import math

    takahashi = math.ceil(c / b)
    aoki = math.ceil(a / d)

    if takahashi <= aoki:
        ret = "Yes"

    return ret


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

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

Solution (Python):

A, B, C, D = [int(x) for x in 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 True:
    if C <= 0:
        print('Yes')
        break
    elif A <= 0:
        print('No')
        break
    else:
        A -= D
        C -= B

Solution (Python):
a,b,c,d=map(int,input().split())
ta=c//b
if c%b>0:
  ta+=1
tc=a//d
if a%d>0:
  tc+=1
  
if tc-ta>=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(" "))

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

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

if __name__ == '__main__':
    main()

Solution (Python):




import sys
input = sys.stdin.readline



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

    while True:
        C -= B
        if C <= 0:
            res = 'Yes'
            break

        A -= D
        if A <= 0:
            res = 'No'
            break

    print(res)



main()

Solution (Python):
AH,AA,BH,BA=map(int,input().split())
while True:
  BH -= AA
  if BH <= 0:
    print("Yes")
    break
  else:
    AH -= BA
    if AH <= 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())
while True:
    C = C - B
    if C <= 0:
        print("Yes")
        break
    A = A - D
    if A <= 0:
        print("No")
        break

Solution (Python):
import sys, re
import math
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul	
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd	
from heapq import heappush, heappop

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7


a,b,c,d = LIST()

while 0 == 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 -= 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())
takahasi=a//d
if(a%d!=0):
    takahasi+=1
aoki=c//b
if(c%b!=0):
    aoki+=1
if(takahasi>=aoki):
    print("Yes")
else:
    print("No")

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

Solution (Python):
def b164(a, b, c, d):

    t = c // b
    o = a // d
    if c%b != 0:
        t += 1
    if a%d != 0:
        o += 1

    return "No" if t > o else "Yes"

def main():
    a, b, c, d = map(int, input().split())
    print(b164(a, b, c, d))

if __name__ == '__main__':
    main()

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

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

Solution (Python):
import sys

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

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

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

if f >= e:
    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")
        break
    A=A-D
    if A<=0:
        print("No")
        break

Solution (Python):


import math

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

     t_hit = math.ceil(c / b)
     a_hit = math.ceil(a / d)

     if t_hit <= a_hit:
          print('Yes')
     else:
          print('No')

if __name__ == "__main__":
    main()