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

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

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

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


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

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

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

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

Solution (Python):

import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

def main():
    A,B,C,D=map(int,input().split())
    while True:
        C-=B
        if C<=0:
            YesNo(1)
            exit()
        A-=D
        if A<=0:
            YesNo(0)
            exit()

if __name__ == '__main__':
    main()

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

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

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

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

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

Solution (Python):
import sys, bisect, math, itertools, string, queue, copy


from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
from fractions import gcd

sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

def main():
    a,b,c,d = inpm()
    while True:
        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())

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

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

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

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

nt = math.ceil(c/b)
na = math.ceil(a/d)
if nt>na:
    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 sys

stdin = sys.stdin

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

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

Solution (Python):
def main():
    a, b, c, d = (int(i) for i 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("No")
    else:
        print("Yes")


if __name__ == '__main__':
    main()

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

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

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

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

if __name__ == '__main__':
    main()

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

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


if __name__ == '__main__':
    main()

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

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

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

    if turn:
        c-=b
        turn = not turn
    else:
        a -= d
        turn = not turn

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

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

Solution (Python):


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

if __name__ == "__main__":
    main()

Solution (Python):
import sys

def solve():
    input = sys.stdin.readline
    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

    return 0

if __name__ == "__main__":
    solve()

Solution (Python):
a,b,c,d = map(int,input().split())
for i in range(10**5):
    if i%2 == 0:
        c -= b
        if c <= 0:
            print("Yes")
            break
    elif i%2 == 1:
        a -= d
        if a <= 0:
            print("No")
            break

Solution (Python):











import sys
sys.setrecursionlimit(10**6)
input=sys.stdin.readline
from math import floor,sqrt,factorial,hypot,log 
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from fractions import gcd
from random import randint
def ceil(a,b): return (a+b-1)//b
inf=float('inf')
mod = 10**9+7
def pprint(*A): 
    for a in A:     print(*a,sep='\n')
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [I() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    A,B,C,D=MI()
    while(1):
        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 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 a > 0 and c > 0:
  c -= b
  if c <= 0:
    print('Yes')
    exit()
  a -= d
  if a <= 0:
    print('No')
    exit()

Solution (Python):
a, b, c, d = map(int, input().split())
while 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())
takahashi = (c+b-1)//b
aoki = (a+d-1) // d
print("Yes" if takahashi <= aoki else "No")

Solution (Python):
a,b,c,d = map(int, input().split())
for i in range(1000):
    
    c -= b
    if c <= 0:
        print("Yes")
        exit()
    
    a -= d
    if a <= 0:
        print("No")
        exit()

Solution (Python):
import bisect
import cmath
import heapq
import itertools
import math
import operator
import os
import random
import re
import string
import sys
from collections import Counter, defaultdict, deque
from copy import deepcopy
from decimal import Decimal
from functools import lru_cache, reduce
from math import gcd
from operator import add, itemgetter, mul, xor

import numpy as np

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

sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7



a, b, c, d = list(map(int, sys.stdin.buffer.readline().split()))

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

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

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)
INF = float("inf")
MOD = 10 ** 9 + 7


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


def main():
    A, B, C, D = map(int, input().split())
    while A > 0 or C > 0:
        C -= B
        if C <= 0:
            print("Yes")
            break

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


if __name__ == "__main__":
    main()

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

Solution (Python):
a,b,c,d = list(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):
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, 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 SI(): return sys.stdin.readline()[:-1]

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

main()

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

Solution (Python):

import sys
import math
import os
import itertools
import string
import heapq
import _collections
from collections import Counter
from collections import defaultdict
from functools import lru_cache
import bisect
import re
import queue
from decimal import *


class Scanner():
    @staticmethod
    def int():
        return int(sys.stdin.readline().rstrip())

    @staticmethod
    def string():
        return sys.stdin.readline().rstrip()

    @staticmethod
    def map_int():
        return [int(x) for x in Scanner.string().split()]

    @staticmethod
    def string_list(n):
        return [Scanner.string() for i in range(n)]

    @staticmethod
    def int_list_list(n):
        return [Scanner.map_int() for i in range(n)]

    @staticmethod
    def int_cols_list(n):
        return [Scanner.int() for i in range(n)]


class Math():
    @staticmethod
    def gcd(a, b):
        if b == 0:
            return a
        return Math.gcd(b, a % b)

    @staticmethod
    def lcm(a, b):
        return (a * b) // Math.gcd(a, b)

    @staticmethod
    def divisor(n):
        res = []
        i = 1
        for i in range(1, int(n ** 0.5) + 1):
            if n % i == 0:
                res.append(i)
                if i != n // i:
                    res.append(n // i)
        return res

    @staticmethod
    def round_up(a, b):
        return -(-a // b)

    @staticmethod
    def is_prime(n):
        if n < 2:
            return False
        if n == 2:
            return True
        if n % 2 == 0:
            return False
        d = int(n ** 0.5) + 1
        for i in range(3, d + 1, 2):
            if n % i == 0:
                return False
        return True


def pop_count(x):
    x = x - ((x >> 1) & 0x5555555555555555)
    x = (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333)
    x = (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0f
    x = x + (x >> 8)
    x = x + (x >> 16)
    x = x + (x >> 32)
    return x & 0x0000007f


MOD = int(1e09) + 7
INF = int(1e15)


def solve():
    A, B, C, D = Scanner.map_int()
    while True:
        C -= B
        if C <= 0:
            print('Yes')
            return
        A -= D
        if A <= 0:
            print('No')
            return


def main():
    
    solve()


if __name__ == "__main__":
    main()

Solution (Python):
A,B,C,D = [int(i) for i in input().split()]
t = 0
while 0 < A and 0 < C:
    if t % 2 == 0:
        C -= B
    else:
        A -= D
    t += 1
if A <= 0:
    print("No")
else:
    print("Yes")

Solution (Python):
import math,itertools,fractions,heapq,collections,bisect,sys,queue,copy

sys.setrecursionlimit(10**7)
inf=10**20
mod=10**9+7
dd=[(-1,0),(0,1),(1,0),(0,-1)]
ddn=[(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

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


print(main())

Solution (Python):

from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations, accumulate
import sys
import math
import bisect
def LI(): return [int(x) for x in sys.stdin.buffer.readline().split()]
def I(): return int(sys.stdin.buffer.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
def IR(n):
    return [I() for i in range(n)]
def LIR(n):
    return [LI() for i in range(n)]
def SR(n):
    return [S() for i in range(n)]
def LSR(n):
    return [LS() for i in range(n)]

sys.setrecursionlimit(1000000)
mod = 1000000007

def solve():
    a,b,c,d = LI()
    while 1:
        c -= b
        if c <= 0:
            break
        a -= d
        if a <= 0:
            break
    if c <= 0:
        print("Yes")
    else:
        print("No")
    return


if __name__ == "__main__":
    solve()

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

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

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

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

Solution (Python):
def main():
    A, B, C, D = list(map(int, input().split()))
    while True:
        C -= B
        if C <= 0:
            return True
        A -= D
        if A <= 0:
            return False


print('Yes' if main() else 'No')

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

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