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



Sample input:
10 9 10 10


Sample output:
No

Submission status: Accepted

Solution code:
"""
    Template written to be used by Python Programmers.
    Use at your own risk!!!!
    Owned by enraged(rating - 5 star at CodeChef and Specialist at Codeforces).
"""
import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush, nlargest, nsmallest, _heapify_max, _heapreplace_max
from math import ceil, floor, gcd, fabs, factorial, fmod, sqrt, inf, log
from collections import defaultdict as dd, deque, Counter as c
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_right as br, bisect
from fractions import Fraction
# sys.setrecursionlimit(2*pow(10, 6))
# sys.stdin = open("input.txt", "r")
# sys.stdout = open("output.txt", "w")
mod = pow(10, 9) + 7
mod2 = 998244353
def data(): return sys.stdin.readline().strip()
def out(var): sys.stdout.write(str(var))
def outln(var): sys.stdout.write(str(var)+"\n")
def l(): return list(sp())
def sl(): return list(ssp())
def sp(): return map(int, data().split())
def ssp(): return map(str, data().split())
def l1d(n, val=0): return [val for i in range(n)]
def l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]


a, b, z, d = sp()
par = 1
while a > 0 and z > 0:
    if par:
        z -= b
    else:
        a -= d
    par = 1-par
if not par:
    outln('Yes')
    exit()
outln('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
A, B, C, D = list(map(int, input().split()))
ao = np.ceil(A / D)
taka = np.ceil(C / B)
ret = 'Yes' if taka <= ao else 'No'
print(ret)

Submission status: Accepted

Solution code:
A,B,C,D = map(int, input().split())
cnt_t = 0
cnt_a = 0

while A>0:
	A = A-D
	cnt_t+=1
while C>0:
	C = C-B
	cnt_a+=1
if cnt_t>=cnt_a:
	print('Yes')
else:
	print('No')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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

Submission status: Accepted

Solution code:
# sys.stdin.readline()
#!/usr/bin/env python3


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

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
if c%b == 0:
    e = c//b
else:
    e = c//b+1
if a%d == 0:
    f = a//d
else:
    f = a//d+1
if e <= f:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a, b, c, d = list(map(int, input().split()))
#a = list(map(int, input().split()))
count = 0
while a > 0 and c > 0:
    if count % 2 == 0:
        c -= b
    else:
        a -= d
    count += 1

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

from pprint import pprint
from collections import deque, defaultdict
import sys

sys.setrecursionlimit(10 ** 6)
inf = float("inf")

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

Submission status: Accepted

Solution code:
a,b,c,d = list(map(int,input().split()))
for i in range(10000):
    if c-b <= 0:
        print('Yes')
        exit()
    if a-d <= 0:
        print('No')
        exit()
    c -= b
    a -= d

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/local/bin/python3

from sys import stdin
import sys


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

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

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

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.readline
a,b,c,d=map(int,input().split())
for i in range(10000):
    a-=d
    c-=b
    if a <= 0 and c <= 0:
        print("Yes")
        exit(0)
    elif a <= 0:
        print("No")
        exit(0)
    elif c<=0:
        print("Yes")
        exit(0)

Submission status: Accepted

Solution code:
import math
a, b, c, d = map(int, input().split())
if math.ceil(c/b) >= math.ceil(a/d) + 1:
    result = "No"
else:
    result = "Yes"
print(result)

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())  # x = 1, y = 2

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

# print(a, c)
if a < c:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    x=list(map(int,input().split(" ")))
    while x[0]>0 and x[2]>0:
        x[2]=x[2]-x[1]
        if x[2]<=0:
            print("Yes")
            break
        else:
            x[0]=x[0]-x[3]
            if x[0]<=0:
                print("No")
                break

Submission status: Accepted

Solution code:
a, b, c, d = (int(x) for x in input().split())
if c%b==0:
    taka = int(c/b)
else:
    taka = c//b+1
if a%d==0:
    ao = int(a/d)
else:
    ao = a//d+1
if taka<=ao:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c, d = [int(x) for x in input().split()]
while a > 0 and c > 0:
    a -= d
    c -= b
print('Yes' if c <= 0 else 'No')

Submission status: Accepted

Solution code:
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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys,math,copy,queue,itertools,bisect,collections
sys.setrecursionlimit(10**7)
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
_LI = lambda : [int(x)-1 for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
INF = 10**18
MOD = 10**9 + 7
DD = ((1,0),(0,1),(-1,0),(0,-1))

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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

Submission status: Accepted

Solution code:
a, b, c, d = map(int,input().split())
res = ""

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

print(res)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
if c%b==0:
  y=c//b
else:
  y=c//b+1
if a%d==0:
  n=a//d
else:
  n=a//d+1
if n>=y:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys

YES = "Yes"  # type: str
NO = "No"  # type: str


def solve(A: int, B: int, C: int, D: int):
    for i in range(110):
        C -= B
        if C <= 0:
            print(YES)
            return
        A -= D
        if A <= 0:
            print(NO)
            return
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    C = int(next(tokens))  # type: int
    D = int(next(tokens))  # type: int
    solve(A, B, C, D)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import math

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

tn = math.ceil(C/B)
an = math.ceil(A/D)

if tn <= an:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
import math

A, B, C, D = list(map(int, input().split()))
attacks_till_a_win = math.ceil(C / B)
if D * (attacks_till_a_win - 1) < A:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
(a, b, c, d)=[int(x) for x in input().split()]
t=0
while a>0 and c>0:
  if t % 2:
    a-=d
  else:
    c-=b
  t+=1
print('Yes' if a > 0 else 'No')

Submission status: Accepted

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

aoki_out = math.ceil(C/B)
taka_out = math.ceil(A/D)

if(aoki_out <= taka_out):
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
# B - Battle

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

tak = (a+d-1)//d
aok = (c+b-1)//b

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

Submission status: Accepted

Solution code:

MOD = 10 ** 9 + 7

def main():
    for _ in inputt(1):
        a, b, c, d = inputi()
        if ceil(c / b) <= ceil(a / d):
            print("Yes")
        else:
            print("No")


# region M


# region import
# 所有import部分

from math import *
from heapq import *
from itertools import *
from functools import reduce, lru_cache, partial
from collections import Counter, defaultdict
import re, copy, operator, cmath
import sys, io, os, builtins
sys.setrecursionlimit(1000)

# endregion

# region fastio

BUFSIZE = 8192
class FastIO(io.IOBase):
    newlines = 0
    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = io.BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None
    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()
    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()
    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)
class IOWrapper(io.IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")
def print(*args, **kwargs):
    if args:
        sys.stdout.write(args[0])
        split = kwargs.pop("split", " ")
        for arg in args[1:]:
            sys.stdout.write(split)
            sys.stdout.write(arg)
    sys.stdout.write(kwargs.pop("end", "\n"))
def debug(*args, **kwargs):
    print("debug", *args, **kwargs)
    sys.stdout.flush()
sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)
input = lambda: sys.stdin.readline().rstrip()
inputt = lambda t = 0: range(t) if t else range(int(input()))
inputs = lambda: input().split()
inputi = lambda: map(int, inputs())
inputl = lambda t = 0, k = inputi: map(list, (k() for _ in range(t))) if t else list(k())

# endregion

# region bisect

def len(a):
    if isinstance(a, range):
        return -((a.start - a.stop) // a.step)
    return builtins.len(a)
def bisect_left(a, x, key = None, lo = 0, hi = None):
    if lo < 0: lo = 0
    if hi == None: hi = len(a)
    if key == None: key = do_nothing
    while lo < hi:
        mid = (lo + hi) // 2
        if key(a[mid]) < x: lo = mid + 1
        else: hi = mid
    return lo
def bisect_right(a, x, key = None, lo = 0, hi = None):
    if lo < 0: lo = 0
    if hi == None: hi = len(a)
    if key == None: key = do_nothing
    while lo < hi:
        mid = (lo + hi) // 2
        if x < key(a[mid]): hi = mid
        else: lo = mid + 1
    return lo
def insort_left(a, x, key = None, lo = 0, hi = None):
    lo = bisect_left(a, x, key, lo, hi)
    a.insert(lo, x)
def insort_right(a, x, key = None, lo = 0, hi = None):
    lo = bisect_right(a, x, key, lo, hi)
    a.insert(lo, x)
do_nothing = lambda x: x
bisect = bisect_right
insort = insort_right
def index(a, x, default = None, key = None, lo = 0, hi = None):
    if lo < 0: lo = 0
    if hi == None: hi = len(a)
    if key == None: key = do_nothing
    i = bisect_left(a, x, key, lo, hi)
    if lo <= i < hi and key(a[i]) == x: return a[i]
    if default != None: return default
    raise ValueError
def find_lt(a, x, default = None, key = None, lo = 0, hi = None):
    if lo < 0: lo = 0
    if hi == None: hi = len(a)
    i = bisect_left(a, x, key, lo, hi)
    if lo < i <= hi: return a[i - 1]
    if default != None: return default
    raise ValueError
def find_le(a, x, default = None, key = None, lo = 0, hi = None):
    if lo < 0: lo = 0
    if hi == None: hi = len(a)
    i = bisect_right(a, x, key, lo, hi)
    if lo < i <= hi: return a[i - 1]
    if default != None: return default
    raise ValueError
def find_gt(a, x, default = None, key = None, lo = 0, hi = None):
    if lo < 0: lo = 0
    if hi == None: hi = len(a)
    i = bisect_right(a, x, key, lo, hi)
    if lo <= i < hi: return a[i]
    if default != None: return default
    raise ValueError
def find_ge(a, x, default = None, key = None, lo = 0, hi = None):
    if lo < 0: lo = 0
    if hi == None: hi = len(a)
    i = bisect_left(a, x, key, lo, hi)
    if lo <= i < hi: return a[i]
    if default != None: return default
    raise ValueError

# endregion

# region csgraph
# TODO

class Tree:
    def __init__(n):
        self._n = n
        self._conn = [[] for _ in range(n)]
        self._list = [0] * n
    def connect(a, b):
        pass

# endregion

# region ntheory
# TODO

class Sieve:
    def __init__(self):
        self._n = 6
        self._list = [2, 3, 5, 7, 11, 13]
    def extend(self, n):
        pass


sieve = Sieve()
def isprime(n):
    pass
def prime(n):
    pass
def factorint(n):
    factordict = defaultdict(int)
    for i in sieve:
        if n <= i * i:
            break
        while not n % i:
            factordict[i] += 1
            n //= i
    if n != 1:
        factordict[n] += 1
    return factordict

# endregion

# region main

if __name__ == "__main__":
    main()

# endregion


# endregion

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys

YES = "Yes"  # type: str
NO = "No"  # type: str


def solve(A: int, B: int, C: int, D: int):
    while(True):
        C -= B
        if C <= 0:
            print('Yes')
            break

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

    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    C = int(next(tokens))  # type: int
    D = int(next(tokens))  # type: int
    solve(A, B, C, D)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
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()

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
count=0
while (a>0) and (c>0):
    if count%2==0:
        c-=b
    else:
        a-=d
    count+=1

if  count%2==1:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
def main():
    a,b,c,d = map(int,input().split())
    A = 1
    while a>0 and c>0:
        if A==1:
            c = c-b
            A=0
        else:
            a = a-d
            A=1
    if A==1:
        print('No')
    else:
        print('Yes')


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a, b, c, d = list(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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
p = a//d
q = c//b
if a%d != 0:
    p += 1
if c%b != 0:
    q += 1
if p >= q:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
def main():
    a,b,c,d = map(int,input().split())
    flg = 0
    while a > 0 and c > 0:
        if flg:a -= d;flg = 0
        else:c -= b;flg = 1
    if flg:print('Yes')
    else:print('No')
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import math

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

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

Submission status: Accepted

Solution code:
T_hp, T_atk, A_hp, A_atk = tuple(map(int, input().split()))
while(True):
    A_hp -= T_atk
    if A_hp <= 0:
        print("Yes")
        break
    T_hp -= A_atk
    if T_hp <= 0:
        print("No")
        break

Submission status: Accepted

Solution code:
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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math

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

t_attack = math.ceil(c/b)
a_attack = math.ceil(a/d)

if t_attack <= a_attack:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
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

Submission status: Accepted

Solution code:
import math
a, b, c, d = [int(i) for i in input().split()]
if math.ceil(c / b) <= math.ceil(a / d):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from __future__ import print_function

import sys
sys.setrecursionlimit(500000)

import re
import array
import copy
import functools
import operator

import math
import string
import fractions
from fractions import Fraction

import collections
import itertools
import bisect

import random
import time

import heapq
from heapq import heappush
from heapq import heappop
from heapq import heappushpop
from heapq import heapify
from heapq import heapreplace
from queue import PriorityQueue as pq
from queue import Queue

from itertools import accumulate

from collections import deque
from collections import Counter

from operator import mul
from functools import reduce

input = sys.stdin.readline


def eprint(*args, **kwargs):
    print(*args, file=sys.stderr, **kwargs)
    return

# from fractions import gcd
# from math import gcd

# def lcm(n, m):
#     return int(n * m / gcd(n, m))


# def coprimize(p, q):
#     common = gcd(p, q)
#     return (p // common, q // common)


# def find_gcd(list_l):
#     x = reduce(gcd, list_l)
#     return x


def combinations_count(n, r):
    r = min(r, n - r)
    numer = reduce(mul, range(n, n - r, -1), 1)
    denom = reduce(mul, range(1, r + 1), 1)
    return numer // denom


def main():
    Al,Aa,Bl,Ba = map(int,input().strip().split())
    while True:
        Bl -= Aa
        if Bl<=0:
            print("Yes")
            return
        Al -= Ba
        if Al <= 0:
            print("No")
            return

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
ah,aa,bh,ba=list(map(int,input().split()))
while True:
  bh-=aa
  ah-=ba
  if bh<=0:
    print("Yes")
    break
  elif ah<=0:
    print("No")
    break

Submission status: Accepted

Solution code:
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

Submission status: Accepted

Solution code:
A,B,C,D = map(int,input().split())
x = (C - 1)//B + 1
y = (A - 1)//D + 1
if x <= y:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import math
a,b,c,d=map(int, input().split())
N=math.ceil(c/b)
if a-(N-1)*d>0:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
a,b,c,d = [int(i) for i in readline().split()]

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

Submission status: Accepted

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

x=-(-A//D)
y=-(-C//B)

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

Submission status: Accepted

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

n = c//b
m = a//d

if c%b != 0:
    n += 1

if a%d != 0:
    m += 1

if n <= m:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:


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

while True:
    if a <= 0 or c <= 0:
        break

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


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

Submission status: Accepted

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

#print(ceil(C/B),ceil(A/D))

tkhs_cnt = ceil(C/B)
aok_cnt = ceil(A/D)
ans = "Yes" if aok_cnt >= tkhs_cnt else "No"
print(ans)

Submission status: Accepted

Solution code:
# ABC164_B.py
a,b,c,d=map(int,input().split())
for i in range(300):

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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

Submission status: Accepted

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

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

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

if tcnt >= acnt:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
 
def main():
    a, b, c, d = map(int, input().split())
    while 1:
        c -= b
        if c <= 0:
            break
        a -= d
        if a <= 0:
            break
    if a <= 0:
        print('No')
    else:
        print('Yes')
if __name__ == '__main__':
    main()

Submission status: Accepted

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

flag = True

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c,d = list(map(int, input().split()))
c1 = -(-c//b)
c2 = -(-a//d)
#print(c1,c2)
if c1 <= c2:
    print('Yes')

else:
    print('No')

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
# S = input()
# X1_list = [int(input()) for i in range(N)]
# X2_list = [list(map(int,input().split())) for i in range(N)]
while True:
    C -= B
    #print(C)
    if C <= 0:
        print('Yes')
        break
    A -= D
    #print(A)
    if A <= 0:
        print('No')
        break

Submission status: Accepted

Solution code:
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

Submission status: Accepted

Solution code:
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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

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

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
turn = 0
while (A > 0 and C > 0):
    if turn == 0:
        C = C - B
        turn = 1
    else:
        A = A - D
        turn = 0

if A > C:
    print("Yes")
else:
    print("No")