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())
while a>0 and c>0:
    c-=b
    if c>0:
        a-=d
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(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 sys

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

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

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

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

Submission status: Accepted

Solution code:
from math import ceil
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines

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

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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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


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

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

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

Submission status: Accepted

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

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

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

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 = list(map(int, input().split()))

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

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

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

print("No" if turn_t > turn_a else "Yes")

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 = [int(x) for x in input().split()]

Taka_HP = A
ao_HP = C

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

Submission status: Accepted

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

        
    

if __name__ == "__main__":
    main()

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:
a, b, c, d = map(int, input().split())
for i in range(100):
    c -= b
    if c <= 0:
        print("Yes")
        exit()
    a -= d
    if a <= 0:
        print("No")
        exit()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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


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

Submission status: Accepted

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

Submission status: Accepted

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

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

if q<=p:
	print "Yes"

else:
	print "No"

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import queue
import copy
import math
from collections import deque
import bisect


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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
m = 0
for i in range(200):
    c -= b
    if c <= 0:
        m = 1
        break
    a -= d
    if a <= 0:
        m = 2
        break
print("Yes" if m == 1 else "No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
  main()

Submission status: Accepted

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


# 入力を整数に変換して受け取る
def input_int():
    return int(input())


# マイナス1した値を返却
def int1(x):
    return int(x) - 1


# 半角スペース区切り入力をIntに変換してMapで受け取る
def input_to_int_map():
    return map(int, input().split())


# 半角スペース区切り入力をIntに変換して受け取る
def input_to_int_tuple():
    return tuple(map(int, input().split()))


# 半角スペース区切り入力をIntに変換してマイナス1した値を受け取る
def input_to_int_tuple_minus1():
    return tuple(map(int1, input().split()))


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

    ret = "No"

    import math

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

    if takahashi <= aoki:
        ret = "Yes"

    return ret


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

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 = [int(x) for x in input().split()]

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# import numpy as np
# import math
# import copy
# from collections import deque
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(10000)


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

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

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

    print(res)



main()

Submission status: Accepted

Solution code:
AH,AA,BH,BA=map(int,input().split())
while True:
  BH -= AA
  if BH <= 0:
    print("Yes")
    break
  else:
    AH -= BA
    if AH <= 0:
      print("No")
      break

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:
import sys, re
import math
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul	# 
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd	# 最大公約数
from heapq import heappush, heappop

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

# -*- coding: utf-8 -*-
a,b,c,d = LIST()

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys

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

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

Submission status: Accepted

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

if f >= e:
    print("Yes")
else:
    print("No")

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:
# -*- coding: utf-8 -*-

import math

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

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

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

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
import math
from collections import Counter
import itertools
#from functools import reduce

# 入力を整数に変換して受け取る
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
# 入力全てを整数に変換したものの配列を受け取る
def LI(): return list(map(int, sys.stdin.readline().split()))
# 入力全てを整数に変換して1引いたものの配列を受け取る
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SR(): return sys.stdin.readline().rstrip()

ascii_lowercase = 'abcdefghijklmnopqrstuvwxyz'
ascii_uppercase = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
ascii_uppercase2 = 'ABCDEFGHIJKLMNOPQRSTUVWXYZABCDEFGHIJKLMNOPQRSTUVWXYZ'

# リストを改行区切りで出力する
p2D = lambda x: print(*x, sep="\n")
p2E = lambda x: print(''.join(x))
p2S = lambda x: print(*x, sep=" ")

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

A,B,C,D=MI()

while True:
    if C-B>0:
        C=C-B
    else:
        print("Yes")
        exit()
    if A-D>0:
        A=A-D
    else:
        print("No")
        exit()

Submission status: Accepted

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

while ((A > 0) & (C > 0)):
  C -= B
  if C <= 0:
    print("Yes")
    quit()
  A -= D
  
  
print("No")

Submission status: Accepted

Solution code:
#!/usr/bin/python3
# -*- coding: utf-8 -*-
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:
# coding: utf-8
A, B, C, D = map(int, input().split())

while not(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:
#N = int(input())
l = [int(x) for x in input().split()]
while True:
    l[2] = l[2] - l[1]
    if l[2] <= 0:
        print("Yes")
        break
    l[0] = l[0] - l[3]
    if l[0] <= 0:
        print("No")
        break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

A, B, C, D = map(int,input().split())
for i in range (100):
    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:
# B - Battle

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 = list(map(int, input().split()))

while 1:
    a[2] -= a[1]
    if a[2] <= 0:
        print('Yes')
        break
    a[0] -=a[3]
    if a[0] <= 0:
        print('No')
        break

Submission status: Accepted

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

Submission status: Accepted

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

import sys
import pprint

sys.setrecursionlimit(10 ** 6)

class Logger:
	def __init__(self, debug):
		self.debug = debug
	def print(self, *args):
		if self.debug:
			pprint.pprint(args)


def main():
	log = Logger(1)
	a, b, c, d = map(int, sys.stdin.readline().split())
	turn = 1
	while (a > 0 and c > 0):
		if turn:
			c -= b
		else:
			a -= d
		turn = not turn
	if a <= 0:
		print("No")
	else:
		print("Yes")
	


main()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# coding:utf-8

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

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

Submission status: Accepted

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


taka = 0
ao = 0

while c >= 1:
    c -= b
    ao += 1
    
while a >= 1:
    a -= d
    taka += 1
    
if taka >= ao:
    print('Yes')
else:
    print("No")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    s = input().rstrip().split(' ')
    A,B,C,D = int(s[0]), int(s[1]), int(s[2]), int(s[3])
    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())
print(["No", "Yes"][(C + B - 1) // B <= (A + D - 1) // D])

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**9)


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

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

Submission status: Accepted

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

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 = list(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())
i = 0
r = ''
while True:
	if i % 2 == 0:
		c -= b
		if c <= 0:
			r = 'Yes'
			break
	else:
		a -= d
		if a <= 0:
			r = 'No'
			break
	i += 1
print(r)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
a,b,c,d=[int(x) for x in input().split()]
a_at=math.ceil(a/d)
t_at=math.ceil(c/b)
if t_at <= a_at:
  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):
    while A > 0 and C > 0:
        C -= B
        A -= D
    
    if C <= 0:
        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:
import math

th, ta, mh, ma = map(int, input().split(" "))

while True:
    mh -= ta
    if mh <= 0:
        print("Yes")
        exit()

    th -= ma
    if th <= 0:
        print("No")
        exit()

Submission status: Accepted

Solution code:
import sys
from io import StringIO
import unittest


def resolve():
    tak_hp, tak_ak, ao_hp, ao_ak = map(int, input().split())

    for i in range(9999999999999):
        ao_hp -= tak_ak
        if ao_hp <= 0:
            print("Yes")
            return
        tak_hp -= ao_ak
        if tak_hp <= 0:
            print("No")
            return



class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)
    def test_入力例_1(self):
        input = """10 9 10 10"""
        output = """No"""
        self.assertIO(input, output)
    def test_入力例_2(self):
        input = """46 4 40 5"""
        output = """Yes"""
        self.assertIO(input, output)

if __name__ == "__main__":
    # unittest.main()
    resolve()

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

Submission status: Accepted

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

# A,C 体力
# B,D 攻撃

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
import queue

def readInt():
	return int(input())

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

def readChars():
	return input().split()

x = readInts()
a = x[0]
b = x[1]
c = x[2]
d = x[3]

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

def main():
    mod=10**9+7
    a,b,c,d=MI()
    
    t=(c+b-1)//b
    a=(a+d-1)//d
    
    if t<=a:
        print("Yes")
    else:
        print("No")

main()

Submission status: Accepted

Solution code:
from math import pi, ceil, floor
import numpy as np
from collections import defaultdict, deque, Counter
from operator import itemgetter
from bisect import bisect_left, bisect_right, insort_left, insort_right
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(10 ** 6)
# MOD = 10 ** 9 + 7
# INF = float("inf")


def main():
    a, b, c, d = map(int, input().split())
    T = ceil(c / b)
    A = ceil(a / d)
    if T <= A:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()

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())
print ("Yes") if -(-a//d) >= -(-c//b) 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 main():
    from builtins import int, map, list, print
    import sys
    sys.setrecursionlimit(10 ** 6)

    input = sys.stdin.readline
    input_list = (lambda: input().rstrip().split())
    input_number = (lambda: int(input()))
    input_number_list = (lambda: list(map(int, input_list())))

    A,B,C,D = input_number_list()
    isNg = True
    while True:
        C-=B
        if C<=0:
            isNg = False
            break
        A-=D
        if A<=0:
            break
    print('YNeos'[isNg::2])


if __name__ == '__main__':
    main()

Submission status: Accepted

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

while(0<A or 0<C):
  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())

cnt = ceil(C/B)

if A - D*(cnt-1) > 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:
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())
ta, ao = 0, 0
if c % b == 0:
    ta = c // b
else:
    ta = c // b + 1
if a % d == 0:
    ao = a // d
else:
    ao = a // d + 1
if ta > ao:
    print("No")
else:
    print("Yes")

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