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

if A%D != 0:
    E = A//D+1
else:
    E = A//D

if C%B != 0:
    F = C//B +1
else:
    F = C//B
    
if E > F:
    print("Yes")
elif E < F:
    print("No")

else:
    print("Yes")

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
count = 0
while a > 0 and b > 0:
    if count % 2 == 0:
        c -= b
    elif count % 2 == 1:
        a -= d
    count += 1
if c <= 0:
    print("Yes")
elif a <= 0:
    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:
A,B,C,D=map(int,input().split())
while A>0 and C>0:
    C-=B
    if C<=0:
        print("Yes")
    else :
        A-=D
        if A<=0:
            print("No")

Submission status: Accepted

Solution code:
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    a,b,c,d=INTM()
    cb=int((c+b-0.1)/b)
    ad=int((a+d-0.1)/d)
    if cb>ad:
        print('No')
    else:
        print('Yes')
if __name__ == '__main__':
    do()

Submission status: Accepted

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


main()

Submission status: Accepted

Solution code:
A,B,C,D = map(int,input().split(" "))
Takahasi = [A,B]
Aoki = [C,D]
while(1):
    Aoki[0]-=Takahasi[1]
    if Aoki[0]<=0:
        print("Yes")
        break
    Takahasi[0]-=Aoki[1]
    if Takahasi[0]<=0:
        print("No")
        break

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
import math
A,B,C,D = list(map(int,input().split()))
x = math.ceil(C/B)
y = math.ceil(A/D)
if x > y:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
def main():
    from math import ceil
    a, b, c, d = map(int, input().split())
    n = ceil(c / b)
    m = ceil(a / d)

    if n - 1 < m:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

aoki = math.ceil(C/B)
taka = math.ceil(A/D)

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

Submission status: Accepted

Solution code:
A, B, C, D = [int(s) for s in 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:
def LI(): return list(map(int,input().split()))
A,B,C,D = LI()
count = 0
while 1:
    count += 1
    C -= B
    if C<=0:
        break
    count += 1
    A -=D
    if A<=0:
        break
print('Yes' if count%2==1 else 'No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    # A, B, C, D = 10, 9, 10, 10
    A, B, C, D = map(int, input().split())

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

    if flag:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import itertools

def solve():
  a, b, c, d = map(int, input().split())
  hoge = 0
  bit = 0
  while True:
    if hoge % 2 == 0:
      c -= b
    if hoge % 2 == 1:
      a -= d
    if a <= 0:
      bit = 0
      break
    if c <= 0:
      bit = 1
      break
    hoge += 1
  if bit == 0:
    print("No")
  else:
    print("Yes")
  return 0
 
if __name__ == "__main__":
  solve()

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

# output
a = -(-A//D)
c = -(-C//B)
print("Yes" if c <= a  else "No")

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
for i in range(105):
    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())
takahashi = a//d if a%d ==0 else a//d+1
aoki = c//b if c%b ==0 else c//b+1
if takahashi >= aoki :
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
for i in range(101):
    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 = map(int,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
  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(1):
    c = c-b
    if(c < 1):
        print("Yes")       
        break
    a = a-d
    if(a < 1):
        print("No")
        break

Submission status: Accepted

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

import sys


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


def resolve():
    t_hp, t_att, a_hp, a_att = map(int, input().split())

    while True:

        a_hp = a_hp - t_att

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

        t_hp = t_hp - a_att

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



if __name__ == "__main__":
    resolve()

Submission status: Accepted

Solution code:
import numpy as np
a,b,c,d = [int(i) for i in input().split()]

a_num = np.ceil(c/b)
b_num = np.ceil(a/d)

if a_num<=b_num:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import math

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

takahashi_attack = math.ceil(c / b)
aoki_attack = math.ceil(a / d)

if takahashi_attack <= aoki_attack:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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


def waru(a, b):
    if a % b == 0:
        return (a//b)
    else:
        return (a//b)+1


ao_win = waru(A, D)
taka_win = waru(C, B)
if ao_win >= taka_win:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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
    i = i + 1

Submission status: Accepted

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

for i in range(100):
    ahp -= b
    thp -= d
    if ahp <= 0:
        print("Yes")
        exit()
    elif thp <= 0:
        print("No")
        exit()

Submission status: Accepted

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

ao = c // b
ta = a // d
if c % b != 0:
  ao += 1
if a % d != 0:
  ta += 1
if ta < ao:
  print('No')
else:
  print('Yes')

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

Submission status: Accepted

Solution code:
A,B,C,D=map(int,input().split())
if int((A-1)/D) >= int((C-1)/B):
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

t = (a+d-1)//d
o = (c+b-1)//b

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

Submission status: Accepted

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

Submission status: Accepted

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

if C%B == 0:
    t = C//B
else:
    t = C//B + 1
    
if A%D == 0:
    a = A//D
else:
    a = A//D + 1

    
if t > a:
    print('No')
elif t < a:
    print('Yes')
elif t == a:
    print('Yes')

Submission status: Accepted

Solution code:
import sys

a,b,c,d = 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()

Submission status: Accepted

Solution code:


def main():
    ABCD = list(map(int, input().split()))

    A = ABCD[0]
    B = ABCD[1]
    C = ABCD[2]
    D = ABCD[3]

    Takahashi = True

    while True:
        C = C - B
        if C <= 0:
            Takahashi = True
            break

        A = A - D
        if A <= 0:
            Takahashi = False
            break

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




if __name__ == '__main__':
    main()

Submission status: Accepted

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

s=0
while s==0:
    c-=b
    if c<1:
        s=1
        break

    a-=d
    if a<1:
        s=2
        break

if s==1:
    print('Yes')

if s==2:
    print('No')

Submission status: Accepted

Solution code:
import time
startTimeProblem=time.time()

import fileinput, sys, itertools, functools
from math import *
from bisect import *
from heapq import *
from collections import *

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

class InputHelper:
    def __init__(self):
        self.myinput = fileinput.input()

    def isLocal(self):
        return not fileinput.isstdin()

    def int(self):
        return int(self.myinput.readline().rstrip())

    def ints(self):
        return [int(_) for _ in self.myinput.readline().rstrip().split()]

    def str(self):
        return self.myinput.readline().rstrip()

    def strs(self):
        return [_ for _ in self.myinput.readline().rstrip().split()]

class OutputHelper:
    def int(self, a):
        print(a)    

    def ints(self, a):  
        print(" ".join([str(_) for _ in a]))
    
    def intsNL(self, a):
        for _ in a:
            print(_)
    
    def str(self, s):
        print(s)

    def strs(self, s):
        print(" ".join([_ for _ in s]))

    def strsNL(self, s):
        for st in s:
            print(st)

class ListNode:
    def __init__(self, val):
        self.val = val
        self.next = None
        self.prev = None

In = InputHelper()
Out = OutputHelper()

######################################

A, B, C, D = In.ints()

takTurn = True
while A>0 and C>0:
    if takTurn:
        C-=B
    else:
        A-=D

    takTurn = not takTurn

if A<=0:
    Out.str("No")
else:
    Out.str("Yes")

######################################

if len(sys.argv)>2 and sys.argv[2]=="TIMEIT":
    fin = (time.time()-startTimeProblem)*1000
    print("{:.2f}".format(fin) + "ms")

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

Submission status: Accepted

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


for i in range(100):
    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 = 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:
    x = c-b
    c = x
    if x<1:
        print('Yes')
        break
    y = a-d
    a = y
    if y<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:
import math


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

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

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
# Code for B - Battle
# Use input() to fetch data from STDIN
[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 = 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:
#B - Battle
A,B,C,D= map(int, input().split())

a = A//D
if A%D > 0:
    a += 1

b = C//B
if C%B > 0:
    b += 1

if a >= b:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
from sys import setrecursionlimit
from collections import Counter, deque, defaultdict
from bisect import bisect_left
setrecursionlimit(1000000)

INF = int(1e10)
MOD = int(1e9 + 7)

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


def main():
    from builtins import int, map
    A, B, C, D = map(int, input().split())
    count = 0
    while True:
        C -= B
        if C <= 0:
            print("Yes")
            exit()
        A -= D
        if A <= 0:
            print("No")
            exit()


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

takahashi = A
aoki = C

while takahashi>0 and aoki>0:
    aoki -= B
    if aoki<=0:
        print("Yes")
        break
    takahashi -= D
    if takahashi<=0:
        print("No")
        break

Submission status: Accepted

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

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

Submission status: Accepted

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

def solve(A, B, C, D):
    while A > 0 and C > 0:
        C -= B
        if C <= 0:
            return 'Yes'
        A -= D
        if A <= 0:
            return 'No'
    

if __name__ == '__main__':
    inputs = read()
    print("{}".format(solve(*inputs)))

Submission status: Accepted

Solution code:
import sys

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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=map(int,input().split())
while 1:
    c-=b
    if c<=0:
        print("Yes")
        exit()
    a-=d
    if a<=0:
        print("No")
        exit()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def main():
    A,B,C,D = [int(x) for x in 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,x,y=list(map(int,input().split()))

while True:
	x -= b
	if x <= 0:
		print("Yes")
		break
	a -= y
	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')
        exit()
    a -= d
    if a <= 0:
        print('No')
        exit()

Submission status: Accepted

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

first = True

while a > 0 and c > 0:
    if first:
        first = False
        c -= b
    else:
        first = True
        a -= d

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
from collections import deque

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 2020/04/26
# AtCoder Beginner Contest 164 - B

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

wa = a
wc = c

# Calc
while wa > 0 and wc > 0:
    wc = wc - b
    if wc <= 0:
        ans = 'Yes'
        break
        
    wa = wa - d
    if wa <= 0:
        ans = 'No'
        break

# Output
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c,d = list(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 = (int(i) for i in input().split())
takahashi = c // b
if c%b != 0:
    takahashi += 1
aoki = a // d
if a%d != 0:
    aoki += 1
if takahashi <= aoki:
    print("Yes")
else: print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
  import math
  A, B, C, D = map(int, input().split())
  y = math.ceil(A / D)
  x = math.ceil(C / B)
  if x <= y:
    print('Yes')
  else:
    print('No')
main()

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import itertools
if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
a,b,c,d=map(int,input().split())

e=0
f=0

while a>0:
	a-=d
	e+=1
	
while c>0:
	c-=b
	f+=1
	
if e>=f:
	print("Yes")
else:
	print("No")

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from heapq import heappush, heappop
from functools import reduce
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

A, B, C, D = MAP()

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

Submission status: Accepted

Solution code:
from collections import defaultdict, deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys
import random
import itertools
import math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt


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


def LF(): return list(map(float, input().split()))


def LI_(): return list(map(lambda x: int(x)-1, input().split()))


def II(): return int(input())


def IF(): return float(input())


def LS(): return list(map(str, input().split()))


def S(): return list(input().rstrip())


def IR(n): return [II() for _ in range(n)]


def LIR(n): return [LI() for _ in range(n)]


def FR(n): return [IF() for _ in range(n)]


def LFR(n): return [LI() for _ in range(n)]


def LIR_(n): return [LI_() for _ in range(n)]


def SR(n): return [S() for _ in range(n)]


def LSR(n): return [LS() for _ in range(n)]


def gcd(x, y):
    if y == 0:
        return x
    return gcd(y, x % y)


def my_index_multi(l, x):
    return [i for i, _x in enumerate(l) if _x == x]


def sosu(x):
    for i in range(2, int(sqrt(x)+1)):
        if x % i == 0:
            return False
    return True


mod = 1000000007
inf = float('INF')


def A():
    S, W = LI()
    if S>W:
        print('safe')
    else:
        print('unsafe')

    
    return

# B


def B():
    A,B,C,D=LI()
    while(1):
        C=C-B
        if C<=0:
            print('Yes')
            break
        A=A-D
        if A<=0:
            print('No')
            break



    return

# C


def true():
    S = input()
    S = S[:-1]

    tmp = 0
    for x in range(1 << (len(S)-1)):
        func = S[-1]
        for i in range(len(S)-1):
            if(x & (1 << i)):
                tmp += int(func)
                func = S[-2-i]
            else:
                func = S[-2-i]+func
        tmp += int(func)
    print(tmp)

    return


def D():
    N,K=LI()
    P=LI()
    tmp=sum(P[:K])
    s=0
    pp=sorted(P, reverse=True)
    tmpmax=sum(pp[:K])
    for i in range(K,N+1):
        if (P[i-1]>P[s-1] and s!=0):
            tmp2=sum(P[s:i])
            if (tmp2==tmpmax):
                tmp=tmp2
                break
            tmp=max(tmp,tmp2)
        s+=1
        

    print((tmp+K)/2)
    return

# E


def E():
    N, K = LI()
    A = LI()
    F = LI()
    A.sort(reverse=True)
    F.sort()
    cost = []
    for i in range(len(N)):
        cost.append(A[i]*F[i])

    a = F[cost.index(max(cost))]

    return

# F


def F():
    N, M = LI()

    value = [0] * M
    power = [0] * M
    for i in range(M):
        a, b = LI()
        value[i] = a
        c = LI()
        L = ['0'] * N
        for k in c:
            L[k - 1] = '1'
        bint = ''.join(L)
        power[i] = int(bint, 2)
    bint = ''.join(list(['1'] * N))
    dp = [inf] * (int(bint, 2)+1)
    t = 0
    cost = 0

    dp[0] = 0
    for s in range(int(bint, 2) + 1):
        for i in range(M):
            t = s | power[i]
            cost = dp[s] + value[i]
            dp[t] = min(dp[t], cost)
    print(-1) if(dp[-1] == inf) else print(dp[-1])

    return

    # you can write to stdout for debugging purposes, e.g.
# print("this is a debug message")


def solution(S):
    # write your code in Python 3.6
    N = len(S)

    pass


# Solve
if __name__ == '__main__':

    B()

Submission status: Accepted

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

Submission status: Accepted

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

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


def solve(A: int, B: int, C: int, D: int):
    t = math.ceil(C / B)
    h = math.ceil(A / D)
    if t<=h:
        print(YES)
    else:
        print(NO)

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

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

Submission status: Accepted

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

flag = 0

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

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
t_n = (c-1)//b + 1
a_n = (a-1)//d + 1
if t_n <= a_n:
    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, read().split())
    taka = -(-C//B)
    ao = -(-A//D)
    print('Yes' if taka <= ao else 'No')
    return

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

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