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())
tk_count = C//B if C%B==0 else C//B + 1
ao_count = A//D if A%D==0 else A//D + 1
if tk_count <= ao_count:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

i = 1

while True:
    if s[0] <= 0:
        print("No")
        break
    elif s[2] <= 0:
        print("Yes")
        break
    s[(i%2)*2] -= s[((i+1)%2)*2+1]
    i += 1

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
def main():
    A, B, C, D = map(int, input().split())

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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


if __name__=='__main__':
    a,b,c,d=readinput()
    ans=main(a,b,c,d)
    print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, C, D = [int(i) for i in input().split(' ')]
print('Yes' if int((A - 1) / D) >= int((C - 1) / B) 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")
        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:
    if (c - b) <= 0:
        print("Yes")
        exit()
    else:
        c = c - b
        if a - d <= 0:
            print("No")
            exit()
        else:
            a = a - 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('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.read
readlines = sys.stdin.readlines

def main():
    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
        if a <= 0:
            print('No')
            sys.exit()


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
takahasi = C // B
aoki = A // D
if C % B != 0:
    takahasi += 1
if A % D  != 0:
    aoki += 1 
if takahasi > aoki:
    print("No")
else:
    print("Yes")

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

Submission status: Accepted

Solution code:
score = list(map(int,input().split()))
taka = score[0]
aoki = score[2]
while taka > 0:
    aoki -= score[1]
    if aoki <= 0:
        print('Yes')
        break
    taka -= score[3]
if aoki > 0:
    print('No')

Submission status: Accepted

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

E = math.ceil(A/D)
F = math.ceil(C/B)

if E >= F:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

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

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

else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
ha,sa,hb,sb = list(map(int, input().split()))
while ha>0 and hb>0:
  hb -= sa
  if hb<=0: break
  ha -= sb
print('Yes' if ha>0 else '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:
    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 True:
    c -= b
    if c <= 0:
        print("Yes")
        break
    a -= d
    if a <= 0:
        print("No")
        break

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

while A > 0 and B > 0:
    if turn == "A":
        C -= B
        turn = "C"
        if not C > 0:
            print('Yes')
            break
    else:
        A -= D
        turn = "A"
        if not 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:
def main():
    A, B, C, D = map(int, input().split())

    tk = (C + B - 1) // B
    ak = (A + D - 1) // D

    cond = tk <= ak

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

Submission status: Accepted

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

if (math.ceil(C/B)-math.ceil(A/D))<1:
    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:
        print('Yes')
        exit()
    A -= D
print('No')

Submission status: Accepted

Solution code:
#https://atcoder.jp/contests/abc164/tasks/abc164_b
A,B,C,D = map(int,input().split())
Senkou_N,Senkou_Amari = divmod(C,B)
if Senkou_Amari != 0:
    Senkou_N += 1
Koukou_N,Koukou_Amari = divmod(A,D)
if Koukou_Amari != 0:
    Koukou_N += 1

if Senkou_N <= Koukou_N:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

result = False

while A > 0 and C > 0:
  C -= B
  if C <= 0:
    result = 'Yes'
    break
  A -= D
  if A <= 0:
    result = 'No'
    break

print(result)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#! python3
# coding:utf-8
 
def main():
    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")

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
#! python3
# coding:utf-8
 
def main():
    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
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
A,B,C,D=map(int,input().split())
num = 0
while(A>=0 and C>=0):
    if A<= 100 and 0 <= B<= 100 and C<= 100 and 0 <= D<= 100:
        if num %2 == 0:
            C = C- B
            if C<=0:
                print("Yes")
                break
            num += 1
        elif num %2 !=0:
            A = A - D
            if A<=0:
                print("No")
                break
            num += 1
    else:
        break

Submission status: Accepted

Solution code:
A,B,C,D=input().split()
num = 0
while(int(A)>=0 and int(C)>=0):
    if int(A)<= 100 and 0 <= int(B)<= 100 and int(C)<= 100 and 0 <= int(D)<= 100:
        if num %2 == 0:
            C = int(C)-int(B)
            if int(C)<=0:
                print("Yes")
                break
            num += 1
        elif num %2 !=0:
            A = int(A)-int(D)
            if int(A)<=0:
                print("No")
                break
            num += 1
    else:
        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:
from math import ceil

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

E = ceil(C/B)
F = ceil(A/D)
print('Yes' if E <= F else '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
    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-1)//d
aoki = (c+b-1)//b

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
tkhp, tkat , aohp, aoat = map(int, input().split())

while True:
    aohp -= tkat
    if aohp <= 0:
        print('Yes')
        exit()
    
    tkhp -= aoat
    if tkhp <= 0:
        print('No')
        exit()

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())
for i in range(100):
    if c > b:
        c -= b
        
    elif c <= b:
        print("Yes")
        exit()
        
    if a > d:
        a -= d
        
    elif a <= d:
        print("No")
        exit()

Submission status: Accepted

Solution code:
import sys, bisect, math, itertools, string, queue, copy
import numpy as np
import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
from fractions import gcd
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

a,b,c,d = inpm()

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

tk = math.ceil(C/B)
ao = math.ceil(A/D)

if tk<=ao:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


def resolve(in_):
    a, b, c, d = map(int, next(in_).split())
    while True:
        c -= b
        if c <= 0:
            return 'Yes'
        a -= d
        if a <= 0:
            return 'No'


def main():
    answer = resolve(sys.stdin.buffer)
    print(answer)


if __name__ == '__main__':
    main()

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

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

Submission status: Accepted

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

def main():

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

    t = math.ceil(A / D)
    a = math.ceil(C / B)

    if t >= a:
        ans = 'Yes'

    else:
        ans = 'No'


    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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:
# abc164_b.py
# https://atcoder.jp/contests/abc164/tasks/abc164_b

# B - Battle /
# 実行時間制限: 2 sec / メモリ制限: 1024 MB
# 配点 : 200点

# 問題文
# 高橋君と青木君がモンスターを闘わせます。
# 高橋君のモンスターは体力が Aで攻撃力が B です。 
# 青木君のモンスターは体力が C で攻撃力が Dです。
# 高橋君→青木君→高橋君→青木君→... の順に攻撃を行います。 
# 攻撃とは、相手のモンスターの体力の値を自分のモンスターの攻撃力のぶんだけ減らすことをいいます。 
# このことをどちらかのモンスターの体力が 0以下になるまで続けたとき、 先に自分のモンスターの体力が 0以下になった方の負け、
# そうでない方の勝ちです。
# 高橋君が勝つなら Yes、負けるなら No を出力してください。

# 制約

#     1≤A,B,C,D≤100
#     入力はすべて整数である。

# 入力
# 入力は以下の形式で標準入力から与えられる。
# A B C D

# 出力
# 高橋君が勝つなら Yes、負けるなら No を出力せよ。

# 入力例 1
# 10 9 10 10

# 出力例 1
# No

# はじめに、高橋君の攻撃で青木君のモンスターの体力が 10−9=1になります。
# 次に、青木君の攻撃で高橋君のモンスターの体力が 10−10=0になります。
# 高橋君のモンスターの体力が先に 0以下になったため、高橋君の負けです。

# 入力例 2
# 46 4 40 5

# 出力例 2
# Yes


global FLAG_LOG
FLAG_LOG = False


def log(value):
    # FLAG_LOG = True
    # FLAG_LOG = False
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    # S = lines[0]
    # N = int(lines[0])
    A, B, C, D = list(map(int, lines[0].split()))
    # values = list(map(int, lines[1].split()))
    # values = list(map(int, lines[2].split()))
    # values = list()
    # for i in range(N):
    #     values.append(int(lines[i]))
    # valueses = list()
    # for i in range(N):
    #     valueses.append(list(map(int, lines[i+1].split())))

    while True:
        C -= B
        if C <= 0:
            return ['Yes']
        A -= D
        if A <= 0:
            return ['No']


# 引数を取得
def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines


# テストデータ
def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['10 9 10 10']
        lines_export = ['No']
    if pattern == 2:
        lines_input = ['46 4 40 5']
        lines_export = ['Yes']
    return lines_input, lines_export


# 動作モード判別
def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode


# 主処理
def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    # if mode > 0:
    #     print(f'lines_input=[{lines_input}]')
    #     print(f'lines_export=[{lines_export}]')
    #     print(f'lines_result=[{lines_result}]')
    #     if lines_result == lines_export:
    #         print('OK')
    #     else:
    #         print('NG')
    # finished = time.time()
    # duration = finished - started
    # print(f'duration=[{duration}]')


# 起動処理
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
t = 1
a = 1
if C%B==0:
    t = 0
if A%D==0:
    a = 0

if C//B+t <= A//D+a:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

while True:
    c -= b
    if c <= 0:
        print("Yes")
        break

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

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#l = list(map(int, input().split()))
a,b,c,d= map(int, input().split())

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

Submission status: Accepted

Solution code:
import math
import sys
import collections
import bisect
readline = sys.stdin.readline


def main():
    a, b, c, d = map(int, readline().rstrip().split())
    taka = math.ceil(c / b)
    aoki = math.ceil(a / d)
    print('Yes' if taka <= aoki else 'No')


if __name__ == '__main__':
    main()

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

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

Submission status: Accepted

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

if not ( 1 <= A <= 100 and 1 <= B <= 100 and 1 <= C <= 100 and 1 <= D <= 100 ): sys.exit()

while A >= 1 and C >= 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())
takahashi_hp = A 
aoki_hp = C
while True:
  aoki_hp -= B
  if aoki_hp <= 0:
    break
  takahashi_hp -= D
  if takahashi_hp <= 0:
    break
if takahashi_hp <= 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 = 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 = list(map(int,input().split()))

while a > 0 or c > 0:
  c -= b
  if c <= 0:
    exit(print('Yes'))
  a -= d
  if a <= 0:
    exit(print('No'))

Submission status: Accepted

Solution code:
import math

a,b,c,d=map(int,input().split())
taka=math.ceil(c/b)
aoki=math.ceil(a/d)
print("YNeos"[taka>aoki::2])

Submission status: Accepted

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

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

Submission status: Accepted

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

a, m = divmod(A, D)
if m > 0:
    a += 1

b, m = divmod(C, B)
if m > 0:
    b += 1

print('Yes' if a >= b else 'No')

Submission status: Accepted

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

cnt1 = 0
cnt2 = 0
while c > 0:
    c -= b
    cnt1 += 1

while a > 0:
    a -= d
    cnt2 += 1

if cnt1 <= cnt2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
thp, tak, ahp, aak = map(int, input().split())
judge = 0
while thp > 0 and ahp > 0:
    if judge == 0:
        ahp -= tak
        judge = 1
    else:
        thp -= aak
        judge = 0
if thp <= 0:
    print("No")
else:
    print("Yes")

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

tk=c//b
ao=a//d
if c%b!=0:
  tk+=1
if a%d!=0:
  ao+=1

if tk>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

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
while A > 0 or B > 0:
    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, input().split())
while A > 0 or B > 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:
ha, sa, hb, sb = (int(i) for i in input().split())

while True:
    hb -= sa
    if hb <= 0:
        print("Yes")
        break
    ha -= sb
    if ha <= 0:
        print("No")
        break;

Submission status: Accepted

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

Takahashi_HP = A
Takahashi_Damage = B
Aoki_HP = C
Aoki_Damage = D

while Takahashi_HP > 0 or  Aoki_HP > C:
    Aoki_HP -= Takahashi_Damage
    if Aoki_HP <= 0:
        print('Yes')
        break
    Takahashi_HP -= Aoki_Damage
    if Takahashi_HP <= 0:   
        print('No')
        break

Submission status: Accepted

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

Submission status: Accepted

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

J = 0

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def s(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")

a,b,c,d = I()
while a > 0 and c > 0:
    c -= b
    a -= d

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7)
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()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#import numpy as np
#import math
#from decimal import *
#from numba import njit

#@njit
def main():
    A,B,C,D = map(int, input().split())
    turn = 0
    while A>0 and C>0:
        if turn == 0:
            C -= B
        else:
            A -= D
        turn = (turn+1)%2
    
    if C <= 0:
        print('Yes')
    else:
        print('No')

main()

Submission status: Accepted

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

resolve()

Submission status: Accepted

Solution code:
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")


a,b,c,d = map(int, input().split())
v1 = c//b + int(c%b!=0)
v2 = a//d + int(a%d!=0)
if v1<=v2:
    ans = "Yes"
else:
    ans = "No"
print(ans)

Submission status: Accepted

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

if c%b==0:
    taka=c//b
else:
    taka=c//b+1
    
if a%d==0:
    ao=a//d
else:
    ao=a//d+1
    

if taka<=ao:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

cnt_T = -(-C//B)
cnt_A = -(-A//D)

ans = 'Yes' if cnt_T <= cnt_A else 'No'

print(ans)

Submission status: Accepted

Solution code:
# B Battle

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

t_kill_a = C // B
a_kill_t = A // D

if C % B != 0:
  t_kill_a += 1
if A % D != 0:
  a_kill_t += 1

if t_kill_a <= a_kill_t:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

A, B, C, D = mapint()

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

Submission status: Accepted

Solution code:
from sys import stdin
nii=lambda:map(int,stdin.readline().split())
lnii=lambda:list(map(int,stdin.readline().split()))

a,b,c,d=nii()

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

Submission status: Accepted

Solution code:
HPT,ATT,HPA,ATA=map(int,input().split())
for i in range(1000):
  HPA += -ATT
  if HPA <= 0:
    print("Yes")
    break
  HPT += -ATA
  if HPT <= 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("No")
else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

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