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:
a, b, c, d = map(int, input().split())
count_x = 0
count_y = 0
while a > 0:
    a -= d
    count_y += 1
while c > 0:
    c -= b
    count_x += 1

if count_x <= count_y:
    print("Yes")
else:
    print("No")

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#n=int(input())  #数値入力 「N」だけの入力のとき
th, ta, ah, aa = map(int, input().split())  #複数数値入力　「A B」みたいなスペース空いた入力のとき
#c=list(map(int, input().split()))  #リスト入力 「a1 a2 a3 ...」みたいな配列のような入力のとき
#s=[list(map(int,list(input()))) for i in range(h)]  # 二次元配列入力　二次元マップみたいな入力のとき

t_win = 'No'
while 1:
    ah -= ta
    if ah <= 0:
        t_win = 'Yes'
        break
    th -= aa
    if th <= 0:
        break
print(t_win)

Submission status: Accepted

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

d1 = math.ceil(c / b)
d2 = math.ceil(a/ d)

if d1 <= d2:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

X =-(-C//B)
Y =-(-A//D)
if X <= Y:
    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')
        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:
a,b,c,d=map(int,input().split())
taka_hp=a-d
aoki_hp=c-b
while True:
  if aoki_hp <=0:
    print("Yes")
    exit()
  else:
    aoki_hp -= b
    if taka_hp <= 0:
      print("No")
      exit()
    else:
      taka_hp -= d

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

at = a
ct = c
while True:
	ct-=b
	if(ct<=0):
		print("Yes")
		break
	at-=d
	if(at<=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:
# encoding="UTF-8"

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

Submission status: Accepted

Solution code:
#2020-04-29
a,b,c,d = map(int,input().split())

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

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

Submission status: Accepted

Solution code:
# This Python file uses the following encoding: utf-8

# if __name__ == "__main__":
#     pass
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")
'''
if  -(-c//b) <= -(-a//d):
    print("Yes")
else:
    print("No")

Submission status: Accepted

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


 
while a>0 or c>0:
    c = c - b
    
    if c<1:
        
        break
    
    a = a - d
    
    if a < 1:

        break
    
   

  


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

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
if c%b==0:
    x=c//b
else:
    x=c//b+1
if a%d==0:
    y=a//d
else:
    y=a//d+1


if x>y:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-


def main():
    import sys
    input = sys.stdin.readline

    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__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Wed Apr 29 20:56:18 2020
"""

import sys
#import numpy as np

sys.setrecursionlimit(10 ** 9)
#def input():
#    return sys.stdin.readline()[:-1]
mod = 10**9+7

#N = int(input())
a,b,c,d = map(int,input().split())
#A = list(map(int,input().split()))

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

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')
    
    else:
        A=A-D
        if A<=0:
          print('No')

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
for n in range(101):
  if c-n*b<=0:
    print("Yes")
    break
  else:
    if a-n*d<=0:
      print("No")
      break

Submission status: Accepted

Solution code:
from math import ceil, floor

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

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

if takahashi>=aoki:
    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())



#print(a//d)
for _ in range(200):
    c-=b
    if c<=0:
        print("Yes")
        break
    else: pass
    a-=d
    if a<=0:
        print("No")
        break
    else: pass

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 True:
    if c - b <= 0:
        print("Yes")
        break
    else:
        c = c - b

    if a - d <= 0:
        print("No")
        break
    else:
        a = a - d

Submission status: Accepted

Solution code:
te, to, ae, ao = map(int, input().split())

while True:
    ae -= to
    if ae <= 0:
        break
    te -= ao
    if te <= 0:
        break
        
if ae <= 0:
    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:
        ans='Yes'
        break
    a=a-d
    if a<=0:
        ans='No'
        break
print(ans)

Submission status: Accepted

Solution code:
# coding: utf-8


def main():
    hp1, atr1, hp2, atr2 = map(int, input().split())

    turn_takahashi = True
    while True:
        if turn_takahashi:
            hp2 -= atr1
        else:
            hp1 -= atr2

        if hp1 <= 0:
            return "No"
        elif hp2 <= 0:
            return "Yes"

        turn_takahashi = not turn_takahashi


print(main())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
t_hp, t_power, a_hp, a_power = map(int, input().split())

while True:
    a_hp -= t_power
    t_hp -= a_power
    if a_hp <= 0:
        print("Yes")
        break
    elif t_hp <= 0:
        print("No")
        break

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:
    break
  a = a - d

if a >= c:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

takahashiCnt = math.ceil(c/b)
aokiCnt =  math.ceil(a/d)

if takahashiCnt <= aokiCnt:
    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())

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:
#!/usr/bin/env python3

import sys
# import math
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product                # product(iter, repeat=n)
# from itertools import accumulate             # accumulate(iter[, f])
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from copy import deepcopy                    # to copy multi-dimentional matrix without reference
# from fractions import gcd                    # for Python 3.4


def main():
    mod = 1000000007                  # 10^9+7
    inf = float('inf')
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():  return int(input())
    def mi():  return map(int, input().split())
    def mi_0(): return map(lambda x: int(x)-1, input().split())
    def lmi(): return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():  return list(input())
    
    
    a, b, c, d = mi()
    while True:
        if a > 0 and c > 0:
            c -= b
        else:
            break
        if a > 0 and c > 0:
            a -= d
        else:
            break
    print('Yes') if a > 0 else print('No')


if __name__ == "__main__":
    main()

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

Submission status: Accepted

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

t = A // D
a = C // B

if A % D != 0:
    t += 1

if C % B != 0:
    a += 1
    
if t >= a:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().rstrip()

def main():
    A, B, C, D = map(int, input().split())
    A_dead = (A + D - 1) // D
    C_dead = (C + B - 1) // B
    if A_dead >= C_dead:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
#!/usr/bin/python3
# -*- coding: utf-8 -*-
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 True:
    c = c-b
    if c <= 0:
        print('Yes')
        break
    a = a-d
    if a <= 0:
        print('No')
        break

Submission status: Accepted

Solution code:
#!/usr/bin/python3
# -*- coding: utf-8 -*-
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:
t_h, t_a, a_h, a_a = [int(i) for i in input().split()]

turn = True
while True:
    if turn:
        a_h -= t_a
    else:
        t_h -= a_a

    turn = not turn

    if a_h <= 0:
        print('Yes')
        break
    if t_h <= 0:
        print('No')
        break

Submission status: Accepted

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

for i in range(1000000007):
    if i % 2 == 0:
        C -= B
    else:
        A -= D
    #
    if A <= 0 or C <= 0: break

if i % 2 == 0:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
from math import floor,ceil,sqrt,factorial,log
from collections import Counter, deque
from functools import reduce
# import numpy as np
def S(): return input()
def I(): return int(input())
def MS(): return map(str,input().split())
def MI(): return map(int,input().split())
def FLI(): return [int(i) for i in input().split()]
def LS(): return list(MS())
def LI(): return list(MI())
def LLS(): return [list(map(str, l.split() )) for l in input()]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def LLSN(n: int): return [LS() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]

A,B,C,D = MI()

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

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

# for i in range(100):
#     a -= B
#     if a <= 0:
#         print("Yes")
#         exit()
    
#     t -= D
#     if t <= 0:
#         print("No")
#         exit()

Submission status: Accepted

Solution code:
a = list(map(int, input().rstrip().split()))
A = a[0]
B = a[1]
C = a[2]
D = a[3]

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

Submission status: Accepted

Solution code:
import sys

input_array = input().split()
takahashi_tairyoku = int(input_array[0])
takahashi_kougeki = int(input_array[1])
aoki_tairyoku = int(input_array[2])
aoki_kougeki = int(input_array[3])

while(1):
  aoki_tairyoku -= takahashi_kougeki
  if(aoki_tairyoku <= 0):
    print('Yes')
    sys.exit()
  else:
    takahashi_tairyoku -= aoki_kougeki
    if(takahashi_tairyoku <= 0):
      print('No')
      sys.exit()

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
c1 = (C+B-1)//B
c2 = (A+D-1)//D

if c1<=c2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

# B - Battle
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:
F = list(map(int,input().split()))

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

count = 0
while(1):
    if count%2==0:
        C -= B
    else:
        A -= D
    
    count += 1
    if C<=0 or A<=0:
        if C <= 0:
            print('Yes')
            break
        else:
            print('No')
            break

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10 ** 9)
input = sys.stdin.readline
from itertools import permutations,  combinations, accumulate
from functools import *
from collections import deque, defaultdict, Counter
from heapq import heapify, heappop, heappush, heappushpop

INF = float('inf')
NIL = - 1


t, B, a, D = map(int, input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, C, D = [int(s) for s in input().split()]
turn = 0
while A > 0 and C > 0:
  if turn == 0:
    C -= B
    turn = 1
  else:
    A -= D
    turn = 0
if A > 0:
  print("Yes")
else:
  print("No")

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:
def solve(a, b, c, d):
    for t in range(300):
        if t % 2 == 0:
            c -= b
            if c <= 0:
                return "Yes"
        else:
            a -= d
            if a <= 0:
                return "No"

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,C,D = (int(x) for x in input().split())

for i in range(100):
    C =  C - B 
    if C <= 0:
        print("Yes")
        break
    else:
        A  = A - D
        if A <= 0:
            print("No")
            break

Submission status: Accepted

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

import math

#while文は使えないことがわかる。

takahashi = math.ceil(a / d) #切り上げ
aoki = math.ceil(c / b) #切り上げ

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

Submission status: Accepted

Solution code:
# B - Battle

import math

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

ao = math.ceil(c / b)  # 青木君の生存回数
ta = math.ceil(a / d)  # 高橋君の生存回数

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

Submission status: Accepted

Solution code:
# B - Battle

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

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

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

Submission status: Accepted

Solution code:
nums = list(map(int, raw_input().split()))
health = [nums[0], nums[2]]
strength = [nums[1], nums[3]]
turn = 0
while(health[turn] > 0):
    health[1-turn] -= strength[turn]
    turn = 1 - turn
if(turn == 0): print('No')
else: print('Yes')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
th,td,ah,ad = map(int,input().split())
x,y = (td+ah-1)//td,(ad+th-1)//ad
if(x<=y):print("Yes")
else:print("No")

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

while(1):
    c = c-b

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

Submission status: Accepted

Solution code:
a, b, c, d = [int(s) for s in 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 = [int(n) for n in 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:
a,b,c,d = map(int,input().split())
if c//b + (c%b>0) <= a//d + (a%d>0):
  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')
    else:
        A-=D
        if A<=0:
            print('No')

Submission status: Accepted

Solution code:
takahashi_hp, takahashi_attack, aoki_hp, aoki_attack = map(int, input().split())
a = 0
hps = [aoki_hp, takahashi_hp]
attacks = [takahashi_attack, aoki_attack]


def attack(hp, attack, is_takahashi):
    hp -= attack
    if hp <= 0:
        if is_takahashi:
            print("No")
        else:
            print("Yes")
        exit()
    return hp


def generator():
    global a
    a += 1
    yield a % 2 == 0


while True:
    is_takahashi = generator().__next__()
    hps[is_takahashi] = attack(hps[is_takahashi], attacks[is_takahashi], is_takahashi)

Submission status: Accepted

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

while not(a<=0 or c<=0):
        a=a-d
        c=c-b

if a<=0 and c<=0:
        print("Yes\n")
elif a<=0:
        print("No\n")
else:
        print("Yes\n")

Submission status: Accepted

Solution code:
arr = list(map(int, input().split()))
 
TAKA = 0
AOKI = 1
PH = 0
PW = 1
 
user = [[arr[0], arr[1]], [arr[2], arr[3]]]
 
taka = user[TAKA]
aoki = user[AOKI]
uid = TAKA
 
while (taka[PH] > 0 and aoki[PH] > 0):
  user[(uid + 1) % 2][PH] -= user[uid][PW]
  uid = (uid + 1) % 2
 
  
result = 'No' if taka[PH] <= 0 else 'Yes'
print(result)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a, b, c, d = (int(x) for x in 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:
a,b,c,d=(int(x) for x in input().split())
win = 0
while(True):
    c=c-b
    if c <= 0:
        win = 1
        break
    a=a-d
    if a <= 0:
        win = 2
        break
if win == 1:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
A,B,C,D=(int(x) for x in input().split())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
import math


def main():
    _in = [_.rstrip() for _ in stdin.readlines()]
    A, B, C, D = list(map(int,_in[0].split(' ')))  # type:list(int)
    # vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv
    HP_takahashi = A
    HP_aoki = C
    while HP_takahashi-D > 0 or HP_aoki-B > 0:
        HP_aoki -= B
        HP_takahashi -= D
    else:
        if HP_takahashi <= 0 and HP_aoki <= 0:
            TF = 'Yes'
        elif HP_takahashi <= 0:
            TF = 'No'
        else:
            TF = 'Yes'
    # ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
    print(TF)


def ans():
    _in = [_.rstrip() for _ in stdin.readlines()]
    A, B, C, D = list(map(int,_in[0].split(' ')))  # type:list(int)
    # vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv
    TF = 'Yes' if math.ceil(A/D)>=math.ceil(C/B) else 'No'
    # ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
    print(TF)


if __name__ == "__main__":
    #main()
    ans()

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin, stdout
import math
import bisect
import queue

a, b, c, d = map(int, stdin.readline().strip().split())

while True:
    c -= b
    if c <= 0:
        stdout.writelines('Yes\n')
        break
    a -= d
    if a <= 0:
        stdout.writelines('No\n')
        break

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

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
li=list(map(int,input().split()))

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

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:
temp=list(map(int,input().rstrip().split()))
a=temp[0]
b=temp[1]
c=temp[2]
d=temp[3]
while True :
    c=c-b
    if c<=0 :
        print("Yes")
        break
    else :
        a=a-d
        if a<=0 :
            print("No")
            break