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 です。

    高橋君→青木君→高橋君→青木君→... の順に攻撃を行います。
    攻撃とは、相手のモンスターの体力の値を自分のモンスターの攻撃力のぶんだけ減らすことをいいます。
    このことをどちらかのモンスターの体力が 0 以下になるまで続けたとき、
    先に自分のモンスターの体力が 0 以下になった方の負け、そうでない方の勝ちです。

    高橋君が勝つなら Yes、負けるなら No を出力してください。
'''

'''
制約：
    1 ≦ A, B, C, D ≦ 100
    入力は全て整数である
'''
class Monster:
    def __init__(self, hp, power):
        self.hp = hp
        self.power = power

    def fight(self, power)  -> int:
        self.hp -= power
        return self.hp

    def is_loser(self)   -> bool:
        return self.hp <= 0

# 標準入力から A, B, C, D を取得する
a, b, c, d = map(int, input().split())

takahashi_monster = Monster(a, b)   # 高橋モンスター
aoki_monster = Monster(c, d)    # 青木モンスター
result = "ret"

while True:
    aoki_monster.fight(b)   # 高橋の攻撃
    if aoki_monster.is_loser():
        result = "Yes"
        break
    else:
        pass

    takahashi_monster.fight(d)  # 青木の攻撃
    if takahashi_monster.is_loser():
        result = "No"
        break
    else:
        pass

print(result)

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

Submission status: Accepted

Solution code:
# 164
# 高橋君モンスター体力A/攻撃力B
# 青木君ﾓﾝｽﾀｰ体力C/攻撃力D
# 高橋→青木→高橋→青木の順番
# 相手のﾓﾝｽﾀｰの体力を自分のﾓﾝｽﾀｰの攻撃分減らせる。C＝C-B/A=A-D
# どちらかの体力が０以下になるまで戦い続ける。 A<0 B<0
# 先に自分のﾓﾝｽﾀｰの体力が０になった方が負け。
# 高橋君が勝つなら”Yes”負けるなら”No”を出力

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

while A>0 and C>0:
    C = C-B
    A = 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 1:
    c -= b
    if c <= 0:
        print('Yes')
        exit()
    a -= d
    if a <= 0:
        print('No')
        exit()

Submission status: Accepted

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

while True:
    C -= B
    A -= D

    if C <= 0:
        result = "Yes"
        break
    if A <= 0:
        result = "No"
        break

print(result)

Submission status: Accepted

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

while True:
    C-=B
    A-=D
    if C<=0:
        result="Yes"
        break
    if A<=0:
        result="No"
        break

print(result)

Submission status: Accepted

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


while C>0 and A>0:
    C = C - B
    A = 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:
  A-=D
  C-=B

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

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

Submission status: Accepted

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

for i in range(100): # 繰り返し処理したい、とりあえず100回以上の繰り返しはないから100回繰り返す
    c -= b # 青木くんの体力cから高橋くんの攻撃力bぶん引く
#    print('青木体力', c) # 残り体力を確認する時は先頭の#を外す
    if c <= 0: # 青木くん体力が0以下になったら
        print('Yes') # 高橋くんの勝ちなのでYes
        break # 体力が0になったら繰り返しも終了

    a -= d # 次に高橋くんの体力aから青木くんの攻撃力dを引く
 #   print('高橋体力',a) # 残り体力を確認する時は先頭の#を外す
    if a <= 0: # 高橋くん体力が0以下になったら
        print('No') # 青木くん勝利でNo
        break # 体力が0になったら繰り返しも終了
# どちらの体力も残ってたら次の繰り返し

Submission status: Accepted

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

for i in range(100): # 繰り返し処理したい、とりあえず100回以上の繰り返しはないから100回繰り返す
    c -= b # 青木くんの体力cから高橋くんの攻撃力bぶん引く
#    print('c', c) # 残り体力確認用
    if c <= 0: # 青木くん体力が0以下になったら
        print('Yes') # 高橋くんの勝ちなのでYes
        break # 体力が0になったら繰り返しも終了

    a -= d # 次に高橋くんの体力aから青木くんの攻撃力dを引く
 #   print('a',a) # 残り体力確認用
    if a <= 0: # 高橋くん体力が0以下になったら
        print('No') # 青木くん勝利でNo
        break # 体力が0になったら繰り返しも終了
# どちらの体力も残ってたら次の繰り返し

Submission status: Accepted

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

for i in range(100):
    c -= b
#    print('c', c)
    if c < 1:
        print('Yes')
        break

    a -= d
 #   print('a',a)
    if a < 1:
        print('No')
        break

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

while A or C > 0:
    aoki_hitpoint = C - B
    if aoki_hitpoint <= 0:
        C = 0
        print("Yes")
        exit()
    else:
        C = aoki_hitpoint

    takahashi_hitpoint = A - D
    if takahashi_hitpoint <= 0:
        print("No")
        A = 0
        exit()
    else:
        A = takahashi_hitpoint

Submission status: Accepted

Solution code:
# 高橋くんのモンスター　体力A 攻撃B
# 青木くんのモンスター　体力C 攻撃D
# それぞれの値の入力
A, B, C, D = map(int, input().split())

#　高橋君→青木君→...で攻撃
# 攻撃は相手の体力の値を自分のモンスターの攻撃力分だけ減らす。
while True:
    C -= B
    A -= D

    # 高橋君が勝つ場合
    if C <= 0:
        result = 'Yes'
        break
    #　青木君が勝場合
    if A <= 0:
        result = 'No'
        break

print(result)

Submission status: Accepted

Solution code:
import math
A, B, C, D = map(int, input().split())
t_mon = [A, B]
a_mon = [C, D]
t_turn = math.ceil(t_mon[0] / a_mon[1])
a_turn = math.ceil(a_mon[0] / t_mon[1])

if t_turn >= a_turn:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import math
A, B, C, D = map(int, input().split())
t_mon = [A, B]
a_mon = [C, D]
t_turn = math.ceil(t_mon[0] / a_mon[1])
a_turn = math.ceil(a_mon[0] / t_mon[1])

if t_turn >= a_turn:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
#164b
#1.値を受け取る
A, B, C, D = map(int, input().split())

#2.結果を出力する
while C or A >= 0:
    C =C - B
    A =A - D
    if C <= 0:
        print('Yes')
        break
    if A <= 0:
        print('No')
        break

Submission status: Accepted

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

if C % B == 0:
    Takahashi_attacks = C // B
else:
    Takahashi_attacks = C // B + 1

if A % D == 0:
    Aoki_attacks = A // D
else:
    Aoki_attacks = A // D + 1



if Takahashi_attacks <= Aoki_attacks:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
# abc164B
# https://atcoder.jp/contests/abc164/tasks/abc164_b

# 高橋君モンスターの体力はA、攻撃力はB
# 青木君モンスターの体力はC、攻撃力はD

# 高橋君が勝ったら"Yes"、負けたら"No"

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

# 処理
# 必殺技を受けた残りの体力
while a > 0 and c > 0:
    a -= d
    c -= b

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

Submission status: Accepted

Solution code:
import math

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

T_kougeki = C / B     # 高橋くんが攻撃して、青木くんの体力が0になるまでの回数
A_kougeki = A / D     # 青木くんが攻撃して、高橋くんの体力0になるまでの回数

if math.ceil(T_kougeki) <= math.ceil(A_kougeki):   #切り上げた値で少ない方、同数なら先行の高橋くんの勝ち
    print('Yes')

else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

#何ターンで倒せるかを比較、ターン数が小さい方が強い。ターン数が同じなら高橋が勝ち。

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

Submission status: Accepted

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

while A or C > 0:
    aoki_hitpoint = C - B
    if aoki_hitpoint <= 0:
        C = 0
        print("Yes")
        exit()
    else:
        C = aoki_hitpoint

    takahashi_hitpoint = A - D
    if takahashi_hitpoint <= 0:
        print("No")
        A = 0
        exit()
    else:
        A = takahashi_hitpoint

Submission status: Accepted

Solution code:
# B - Battle

# 入力 A B C D
A, B, C, D = map(int, input().split(maxsplit=4))

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

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

print(answer)

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 b>0:
  a-=d
  c-=b

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

Submission status: Accepted

Solution code:
# 高橋くんのモンスターは体力Aで攻撃力B
# 青木くんのモンスターは体力Cで攻撃力D
# 高橋くんが勝つならYes、負けるならNoを出力する

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

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

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

Submission status: Accepted

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

i = 0
i1 = 0

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

while c > 0:
    c -= b
    i1 += 1

if i >= i1:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

sw = 0
while sw == 0:
    if C > 0:
        C = C - B
    else:
        sw = 1
        break
    if A > 0:
        A = A - D
    else:
        sw = 2
        break
if sw == 1:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
#   Battle

class Monster:
    def __init__(self, hp, attack):
        self.hp = hp
        self.attack = attack
        self.death = False


def battle(monster1, monster2):  # attack monster1 -> monster2
    monster2.hp -= monster1.attack
    if monster2.hp <= 0:
        monster2.death = True
    return monster2.death


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

t_monster = Monster(a, b)
a_monster = Monster(c, d)

# print(t_monster.hp)
# print(a_monster.hp)

while True:
    result = battle(t_monster, a_monster)
    if result:
        print("Yes")
        break
    result = battle(a_monster, t_monster)
    if result:
        print("No")
        break

Submission status: Accepted

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

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

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 です。
# 高橋君→青木君→高橋君→青木君→... の順に攻撃を行います。
# 先に自分のモンスターの体力が 0 以下になった方の負け、そうでない方の勝ちです。
# 高橋君が勝つなら Yes、負けるなら No を出力してください。

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

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

Submission status: Accepted

Solution code:
class monster:
    def __init__(self, hp: int, ap: int):
        self.hit_point = hp
        self.attack_point = ap
        self.status = 'healthy'

    def attack(self, enemy: 'monster'):
        enemy.defend(self.attack_point)

    def defend(self, enemy_ap: int):
        self.hit_point -= enemy_ap
        if self.hit_point <= 0:
            self.status = 'dead'

    def is_alive(self) -> bool:
        return not self.is_dead()

    def is_dead(self) -> bool:
        return self.status == 'dead'


def answer(t_hp: int, t_ap: int, a_hp: int, a_ap: int) -> str:
    taka_monster = monster(t_hp, t_ap)
    aoki_monster = monster(a_hp, a_ap)

    while taka_monster.is_alive() and aoki_monster.is_alive():

        taka_monster.attack(aoki_monster)
        if aoki_monster.is_dead():
            return 'Yes'

        aoki_monster.attack(taka_monster)
        if taka_monster.is_dead():
            return 'No'


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


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

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

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

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

Submission status: Accepted

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

# 高橋君のモンスターは体力が A で攻撃力が B です。
# 青木君のモンスターは体力が C で攻撃力が D です。
# 高橋君が勝つなら Yes、負けるなら No を出力してください。

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:
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:
taka_l, taka_a, ao_l, ao_a = map(int, input().split())
con = 0

while True:
  if con % 2 == 0:
    ao_l -= taka_a
    if ao_l <= 0:
      print("Yes")
      break
    con += 1
  if con % 2 != 0:
    taka_l -= ao_a
    if taka_l <= 0:
      print("No")
      break
    con += 1

Submission status: Accepted

Solution code:
hp1, atk1, hp2, atk2 = map(int, input().split())

print("Yes" if hp2 / atk1 <= -(-hp1 // atk2) else "No")

Submission status: Accepted

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

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

Submission status: Accepted

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

T_HP = A
T_AT = B
A_HP = C
A_AT = D
T_count = 0
A_count = 0

while T_HP > 0:
    T_HP -= A_AT
    T_count += 1
while A_HP > 0:
    A_HP -= T_AT
    A_count += 1

if T_count > A_count:
    print('Yes')
elif T_count == A_count:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

is_turn_of_takahashi = True

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

    is_turn_of_takahashi = not is_turn_of_takahashi

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

Submission status: Accepted

Solution code:
class Battle:
    def __init__(self, A, B, C, D):
        self.A = A
        self.B = B
        self.C = C
        self.D = D

    def result(self):
        while self.A > 0 or self.C > 0:
            self.C -= self.B
            if self.C <= 0:
                return "Yes"
            self.A -= self.D
            if self.A <= 0:
                return "No"


def atc_164b(ABCD: str) -> str:
    A, B, C, D = map(int, ABCD.split(" "))
    battle = Battle(A, B, C, D)
    return battle.result()


ABCD_input = input()
print(atc_164b(ABCD_input))

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:
S_list = list(map(int,input().split()))
A,B,C,D = S_list
takahashi ,aoki = A, C
while takahashi > 0 or aoki > 0:
    aoki = aoki - B
    if aoki <=0 :
        break
    takahashi = takahashi - D
    if takahashi <=0:
        break
        """
    print("あおき:"+str(aoki))
    print("たかはし:"+str(takahashi))
		"""
if takahashi > aoki:
    result = "Yes"
else:
    result = "No"
print(result)

Submission status: Accepted

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

Submission status: Accepted

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


while C > 0 and A > 0:
    C -= B
    # print(C)
    A -= D
    # print(A)

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

Submission status: Accepted

Solution code:
# 最後の体力が0になるのが早い方が負け
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())
while True:
    c = c - b
    a = a - d
    if c <= 0:
        print('Yes')
        break
    elif a <= 0:
        print('No')
        break
    else:
        pass

Submission status: Accepted

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

while True:
    C -= B
    A -= D

    if C <= 0:
        result = 'Yes'
        break
    if A <= 0:
        result = 'No'
        break

print(result)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
class Battle:
    def __init__(self, A, B, C, D):
        self.A = A
        self.B = B
        self.C = C
        self.D = D

    def result(self):
        while self.A > 0 or self.C > 0:
            self.C -= self.B
            if self.C <= 0:
                return "Yes"
            self.A -= self.D
            if self.A <= 0:
                return "No"


def atc_164b(ABCD: str) -> str:
    A, B, C, D = map(int, ABCD.split(" "))
    battle = Battle(A, B, C, D)
    return battle.result()


ABCD_input = input()
print(atc_164b(ABCD_input))

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:
# 164_b
A, B, C, D = map(int, input().split())
if (1 <= A and A <= 100) and (1 <= B and B <= 100) and (1 <= C and C <= 100) and (1 <= D and D <= 100):

    while True:
        C = C - B
        A = A - D

        if A <= 0 or C <= 0:
            break
    if C <= 0:
        print('Yes')
    elif A <= 0:
        print('No')

Submission status: Accepted

Solution code:
A,B,C,D=map(int,input().split())
x=(A-1)//D+1
y=(C-1)//B+1
if x<y:
    print("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
  A=A-D
  if C<=0:
    print('Yes')
    break
  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())
while A>0 and C>0:
  C-=B
  A-=D
#  print(A,C)
  
if C<=0:print('Yes')
else:print('No')

Submission status: Accepted

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

def ans164(A, B, C, D):
    while True:
        C=C-B
        if A<=0:
            return"No"
            break
        A=A-D
        if C<=0:
            return "Yes"
            break

print(ans164(A,B,C,D))

Submission status: Accepted

Solution code:
# 数値の取得
thp,tat,ahp,aat = map(int,input().split())

# 勝敗が決まるまでターンをループ
twin = ""
while twin == "":
    # 高橋君のターン
    ahp -= tat
    if ahp <= 0:
        twin = "Yes"
        break
    # 青木君のターン
    thp -= aat
    if thp <= 0:
        twin = "No"
        break
# 結果を出力
print(twin)

Submission status: Accepted

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

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

        takahash_hitpoint = a - d
        if takahash_hitpoint <= 0:
            a = 0
            print('No')
            exit()
        else:
            a = takahash_hitpoint

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math

takahashi_hp, t_atack, aoki_hp, a_attack = map(int, input().split())

t_atk_count = aoki_hp / t_atack
a_atk_count = takahashi_hp / a_attack

if math.ceil(a_atk_count) >= math.ceil(t_atk_count):
    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:
import math

takahashi_hp, t_atack, aoki_hp, a_attack = map(int, input().split())

t_atk_count = aoki_hp / t_atack
a_atk_count = takahashi_hp / a_attack

if math.ceil(a_atk_count) >= math.ceil(t_atk_count):
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 高橋 HP:a ATK:b
# 青木 HP:c ATK:d
a, b, c, d = map(int, input().split())

# 高橋が主人公
while a >= 0 or c >= 0:
    a = a - d
    c = c - b
    if c <= 0:
        print('Yes')
        break
    elif a <= 0:
        print('No')
        break

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

x = 0
y = 0

while c > 0:
    c -= b
    x += 1
    
while a > 0:
    a -= d
    y += 1
    
if x <= y:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
health1, strength1, health2, strength2 = map(int, input().split())
while health1 > 0 and health2 > 0:
    health2 -= strength1
    if health2 <= 0:
        print("Yes")
        break
    health1 -= strength2
    if health1 <= 0:
        print("No")
        break

Submission status: Accepted

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

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 = (int(x) for x in 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())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 164 B
A,B,C,D = list(map(int, input().split()))
j = 0
while A>0 and C>0:
    j += 1
    C -= B
    if C <= 0:
        break
    j += 1
    A -= D
    
print('Yes') if j%2==1 else print('No')

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

if mons_a >= mons_b:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
while True:
	c=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())
t_deth=(a+d-1)//d
a_deth=(c+b-1)//b
if t_deth>=a_deth:
	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())

tt, at = 0, 0
while(A>0 and C>0):
  tt += 1
  C -= B
  if(C <= 0):
    break
  at += 1
  A -= D
if(tt > at):
  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)
e=0
while e==0:
  c=c-b
  if c<=0:
    print("Yes")
    break
  a=a-d
  if a<=0:
    print("No")
    break

Submission status: Accepted

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

while 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 -= B
    if C < 1:
        print('Yes')
        quit()
    A -= D
    if A < 1:
        print('No')
        quit()

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:
from math import ceil

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

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

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

Submission status: Accepted

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

def kaisuu(atk, hp):
    if (hp/atk) > (hp//atk):
        return hp//atk + 1
    else:
        return hp//atk

if kaisuu(b,c) <= kaisuu(d,a):
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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


def solve(A: int, B: int, C: int, D: int):
    while True:
        # 高橋
        C -= B
        if C <= 0:
            return YES
        # 青木
        A -= D
        if A <= 0:
            return NO


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


if __name__ == "__main__":
    main()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
abcd = input().split()

hp1 = int(abcd[0])
at1 = int(abcd[1])
hp2 = int(abcd[2])
at2 = int(abcd[3])

while hp1 > 0 and hp2 > 0:
    hp2 -= at1
    if hp2 <= 0:
        print("Yes")
        break

    hp1 -= at2
    if hp1 <= 0:
        print("No")
        break