Problem:


Score : 200 points

Problem Statement

Takahashi and Aoki will have a battle using their monsters.

The health and strength of Takahashi's monster are A and B, respectively, and those of Aoki's monster are C and D, respectively.

The two monsters will take turns attacking, in the order Takahashi's, Aoki's, Takahashi's, Aoki's, ...
Here, an attack decreases the opponent's health by the value equal to the attacker's strength.
The monsters keep attacking until the health of one monster becomes 0 or below. The person with the monster whose health becomes 0 or below loses, and the other person wins.

If Takahashi will win, print Yes; if he will lose, print No.

Constraints

1 \leq A,B,C,D \leq 100

All values in input are integers.

Input

Input is given from Standard Input in the following format:

A B C D

Output

If Takahashi will win, print Yes; if he will lose, print No.

Sample Input 1

10 9 10 10

Sample Output 1

No

First, Takahashi's monster attacks Aoki's monster, whose health is now 10-9=1.

Next, Aoki's monster attacks Takahashi's monster, whose health is now 10-10=0.

Takahashi's monster is the first to have 0 or less health, so Takahashi loses.

Sample Input 2

46 4 40 5

Sample Output 2

Yes



Sample input:
10 9 10 10


Sample output:
No

Submission status: Accepted

Solution code:
import sys
from collections import defaultdict, Counter, deque
from itertools import accumulate, permutations, combinations
from operator import itemgetter
from bisect import bisect_left, bisect_right, bisect
from heapq import heappop, heappush
from fractions import gcd
from math import ceil, floor, sqrt, cos, sin, pi
from copy import deepcopy

# If you use recursive call, uncomment this code
#sys.setrecursionlimit(10**6)

def main():
    a,b,c,d = map(int, input().split())
    myturn = True
    while True:
        if a <= 0 or c <= 0:
            break
        if myturn:
            c -= b
        else:
            a -= d
        myturn = not myturn
    if c <= 0:
        print("Yes")
    else:
        print("No")

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

class Main:
    t1, a1, t2, a2= map(int,input().split());
    w = "t1"
    while t1 >= 0 or t2 >= 0:
        if t2 <= 0:
            w = "t1"
            break;
        t2 = t2 - a1;
        if t1 <= 0:
            w = "t2"
            break;
        t1 =  t1 - a2;

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

Submission status: Accepted

Solution code:
import math
a=[int(i) for i in input().split()]
print("Yes"if math.ceil(a[2]/a[1])<=math.ceil(a[0]/a[3]) else"No")

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
taka=int((c+b-1)/b)
aoki=int((a+d-1)/d)

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

Submission status: Accepted

Solution code:
A,B,C,D=list(map(int,input().split(" ")))
t=0 # 現在のターン

while True:
    if t%2==0: # 高橋君のターン
        C-=B # 高橋君の攻撃
    elif t%2==1: # 青木君のターン
        A-=D # 青木君の攻撃
    
    if A<=0 or C<=0: # 戦闘終了
        break

    t+=1 # 次のターンへ

if C<=0: # 高橋君の勝ち
    print("Yes")
else: # 高橋君の負け
    print("No")

Submission status: Accepted

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

x0 = C // B
x1 = C % B

y0 = A // D
y1 = A % D

if x1 == 0:
  y0 += 1
if y1 == 0:
  x0 += 1

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

Submission status: Accepted

Solution code:
'''A=高橋のHP
B=高橋の攻撃力
C=青木のHP
D=青木の攻撃力 '''

# A,B,C,Dを受け取る
A,B,C,D = map(int,input().split())

#while文でHP計算
while C > 0 and A > 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().strip().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 C>0 and A>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())
print("No") if math.ceil(a/d) < math.ceil(c/b) 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:
a,b,c,d = map(int,input().split())
while True:
  if a > 0:
    c -= b
  else:
    print("No")
    exit()
  if c > 0:
    a -= d
  else:
    print("Yes")
    exit()

Submission status: Accepted

Solution code:
tH,tA,aH,aA=map(int,input().split())
print("Yes") if (aH-1)//tA+1<=(tH-1)//aA+1 else print("No")

Submission status: Accepted

Solution code:
a_hp,a_at,b_hp,b_at = map(int,input().split())
An = b_hp//a_at
Blit = b_hp%a_at
Bn = a_hp//b_at
Alit = a_hp%b_at
if Blit != 0:
    An += 1
if Alit != 0:
    Bn += 1
print('Yes' if An<=Bn else 'No')

Submission status: Accepted

Solution code:
def fight(A,B,C,D):
  i = 1
  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')
    
if __name__=='__main__':
  A,B,C,D = map(int,input().split())
  fight(A,B,C,D)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A_B_C_D=input()
m=A_B_C_D.split()
A=m[0]
A=int(A)
B=m[1]
B=int(B)
C=m[2]
C=int(C)
D=m[3]
D=int(D)
while True:
    C-=B
    A-=D
    if  C<=0:
        print('Yes')
        break
    if  A<=0:
        print('No')
        break

Submission status: Accepted

Solution code:
t_hp,t_atk,a_hp,a_atk = map(int,input().split())

while True:
    a_hp -= t_atk
    t_hp -= a_atk
    if a_hp <= 0:
        print('Yes')
        break
    elif t_hp <= 0:
        print('No')
        break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
a,b,c,d = map(int,input().split())
answer = ""
while True:
  if c <= 0:
    answer = "Yes"
    break
  c -= b
  if a <= 0:
    answer = "No"
    break
  a -= d
print(answer)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n = list(map(int, input().split()))
while n[0]>0 and n[2]>0:
    n[2] = n[2] - n[1]
    if n[2] <= 0:
        break
    n[0] = n[0] - n[3]

if n[0]>n[2]:
    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
print("Yes" if C <= 0 else "No")

Submission status: Accepted

Solution code:
taka_HP, taka_Power, aoki_HP, aoki_Power = map(int, input().split())

while True:
    aoki_HP -= taka_Power
    if aoki_HP <= 0:
        print('Yes')
        break

    taka_HP -= aoki_Power        
    if taka_HP <= 0:
        print('No')
        break

Submission status: Accepted

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

while (A > 0):
    A = A - D
    cntT = cntT + 1

while (C > 0):
    C = C - B
    cntA = cntA + 1

if cntT >= cntA:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A, B, C, D = input().split()
A = int(A)  # 高橋
B = int(B)
C = int(C)
D = int(D)
takahasiA = C // B
if C % B != 0:
    takahasiA += 1
aokiA = A // D 
if A % D != 0:
    aokiA += 1
# print(takahasiA)
# print(aokiA)
ans = "Yes" if takahasiA <= aokiA else "No"
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=[int(x) for x in input().split()]
if not N[2]%N[1]==0:
   c=N[2]//N[1]+1
else:
    c=N[2]//N[1]
if not N[0]%N[3]==0:
   d=N[0]//N[3]+1
else:
    d=N[0]//N[3]
if d>=c:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
def abc():
    AH,AS,BH,BS=map(int,input().split(' '))

    while(AH>0 and BH>0 ):
        BH=BH-AS
        AH=AH-BS
    if(BH<=0 and AH+BS>0):
        print("Yes")
    else:
        print("No")
abc()

Submission status: Accepted

Solution code:
# B Battle

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

Submission status: Accepted

Solution code:
if __name__ == "__main__":
    a,b,c,d=map(int,input().strip().split())
    jishu1=0
    jishu2=0
    while True:
        a=a-d
        jishu1+=1
        if a<=0:
            break
    while True:
        c=c-b
        jishu2+=1
        if c<=0:
            break
    if jishu1<jishu2:
        print("No")
    else:
        print("Yes")

Submission status: Accepted

Solution code:
ht, st, ha, sa = list(map(int, input().split(' ')))
bool_player = True  # Takashi
while (ht > 0 and ha > 0):
    if bool_player:
        ha -= st
        bool_player = False
    else:
        ht -= sa
        bool_player = True

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

Submission status: Accepted

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

X = C - B
Y = A - D

while True:
  if X <= 0:
    print('Yes')
    break
  elif X > 0 and Y <= 0:
    print('No')
    break
  else:
    X = X - B
    Y = Y - D

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
TaHP,TaAP,AoHP,AoAP = map(int, input().split())

Flag_Ta = True
Flag_end = True
while Flag_end:
	if(TaHP <= 0 or AoHP <= 0):
  		break
	if	Flag_Ta:
		AoHP = AoHP - TaAP
		Flag_Ta = False
	else:
		TaHP = TaHP - AoAP
		Flag_Ta = True
if TaHP > 0:
	print("Yes")
else:
	print("No")

Submission status: Accepted

Solution code:
A,B,C,D=map(int,input().split())
x=A-D #高橋の残りHP
y=C-B #青木の残りHP

while True:
  if y<=0:
    print("Yes") #高橋win
  elif x<=0:
    print("No") #y>0,高橋lose
  else:
      x=x-D
      y=y-B
      continue
  break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, C, D = map(int,input().split())
for i in range(100):
    C-=B
    A-=D
    if C<=0 and A<=0:
        print("Yes")
        break
    elif C>0 and A<=0:
        print("No")
        break
    else:
        continue

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def fight(a,b):
    if b%a==0:
        return b//a
    else:
        return (b//a)+1
A,B,C,D=map(int,input().split())
if fight(B,C)>fight(D,A):
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

# h, p
# A, B
# C, D

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

ABCD=input()
ABCD=ABCD.split()
A=int(ABCD[0])
B=int(ABCD[1])
C=int(ABCD[2])
D=int(ABCD[3])
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:
a=list(map(int,input().split()))
takahashi=0
takahashicount=0
aoki=0
aokicount=0

for i in range(a[2]):
    aoki+=a[1]
    if (a[2]-aoki)>0:
        aokicount+=1
    elif (a[2]-aoki)==0:
        break
    else:
        break
        
for i in range(a[0]):
    takahashi+=a[3]
    if (a[0]-takahashi)>0:
        takahashicount+=1
    elif (a[0]-takahashi)==0:
        break
    else:
        break
if takahashicount==aokicount:
    print("Yes")
elif takahashicount>aokicount:
    print("Yes")
elif takahashicount<aokicount:
    print("No")

Submission status: Accepted

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

A,B,C,D = MI()

t = A
a = C

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

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
e=a//d
f=c//b
x=a-e*d
y=c-f*b
if x==y==0:
  if f<=e:
    print('Yes')
  else:
    print('N0')
elif x==0 and y!=0:
  if f+1<=e:
    print('Yes')
  else:
    print('No')
elif y==0 and x!=0:
  if f<=e+1:
    print('Yes')
  else:
    print('NO')
else:
  if f<=e:
    print('Yes')
  else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
if c% b == 0:
    aoMake = (c//b)*2-1
else:
    aoMake = ((c//b)+1)*2-1

if a%d == 0:
    takaMake = (a//d)*2
else:
    takaMake = ((a//d)+1)*2

if takaMake > aoMake:
    print("Yes")
else:
    print("No")

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:
a,b,c,d=(int(i) for i in input().split())
x=c//b
if c%b!=0:
  x+=1
y=a//d
if a%d!=0:
  y+=1
if x<=y:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A, B, C, D = list(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:
def fight(p1, p2):
    p2['hp'] -= p1['attack']
    return p2['hp']

items = list(map(lambda x: int(x), input().split()))
takahashi = {
    'hp': items[0],
    'attack': items[1]
}
aoki = {
    'hp': items[2],
    'attack': items[3]
}
i = 0
while True:
    if i % 2 == 0:
        hp = fight(takahashi, aoki)
    else:
        hp = fight(aoki, takahashi)
    #print(i, takahashi, aoki)
    if hp <= 0:
        print('Yes' if i % 2 == 0 else 'No')
        break
    i += 1

Submission status: Accepted

Solution code:
A,B,C,D = map(int, input().split())
print("Yes"if ((C-1)//B+1)<=((A-1)//D+1)else"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:
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 = (int(x) for x in input().split())
while A > 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())

if a%d==0:
    last_ao=0
else:
    last_ao=1
    
if c%b==0:
    last_taka=0
else:
    last_taka=1
    
if (a//d +last_ao) >= (c//b + last_taka):
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

num_attack_taka = -(-C // B)
num_attack_aoki = -(-A // D)

if num_attack_taka <= num_attack_aoki:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
A, B, C, D = (int(i) for i 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())

while a >= 0 and c >= 0:
    if c - b > 0:
        c -= b
    else:
        print("Yes")
        exit()

    if a - d > 0:
        a -= d
    else:
        print("No")
        exit()

Submission status: Accepted

Solution code:
A, B, C, D =  map(int, input().split())
T_count = 0 
A_count = 0
for i in range(100):
    C -= B
    T_count += 1
    if C <= 0:
        break

for j in range(100):
    A -= D
    A_count += 1
    if A <= 0:
        break

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

Submission status: Accepted

Solution code:
A1, A2, B1, B2 = map(int, input().split())

while True:
    B1-=A2
    if B1<=0:
        print('Yes')
        break
    A1-=B2
    if A1<=0:
        print('No')
        break

Submission status: Accepted

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

#入力チェック

while a > 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 = 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:
import math

A, B, C, D = list(map(int, input().split()))
tak = math.ceil(A / D)
aok = math.ceil(C / B) 
print(('No', 'Yes')[tak - aok > -1])

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
#たかはしのa体力、b攻撃
#あおきのc体力、d攻撃
flag = 0
while(c>0 and a>0):
  c -= b
  if (c<=0):
    flag = 1
  a -= d
  if (a<=0 and c>0):
    flag = 2
if (flag == 1):
  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 = 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())
cb = c-b
ad = a-d
while True:
    if cb<=0:
        print("Yes")
        exit()
    elif ad <=0:
        print("No")
        exit()
    else:
        cb -= b
        ad -= d

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

lifeT = A
lifeA = C

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

Submission status: Accepted

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

while True:
    B[2] = int(B[2]) - int(B[1])
    B[0] = int(B[0]) - int(B[3])
    if int(B[2]) <= 0:
        print("Yes")
        break
    elif int(B[0]) <= 0:
        print("No")
        break

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
t,s1,a,s2 = map(int,input().split())
i = True
while(i):
    a = a - s1
    if (a <= 0):
        print("Yes")
        break
    t = t - s2
    if(t <= 0):
        print("No")
        break

Submission status: Accepted

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

_a = math.ceil(a / d)
_b = math.ceil(c / b)

if _a < _b:
    print('No')
else: 
    print('Yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
data = input().split()
a = int(data[0])
b = int(data[1])
c = int(data[2])
d = int(data[3])


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

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
i = 0
while C - B * i > 0:
  i += 1

j = 0
while A - D * j > 0:
  j += 1
  
if i <= j:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

i = 0

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

Submission status: Accepted

Solution code:
def attack(players_list, attacker_no, defender_no):
  players_list[defender_no][0] = players_list[defender_no][0] - players_list[attacker_no][1]
  return [players_list, players_list[defender_no][0]]

inputs = input().split(' ')

for i in range(0, 4):
  inputs[i] = int(inputs[i])

tk = [inputs[0], inputs[1]]
ao = [inputs[2], inputs[3]]

players_list = (tk, ao)

order = 0;
while True:
  result = attack(players_list, order % 2, ((order + 1 ) % 2))
  
  if (result[1] <= 0):
    if(order % 2 == 0):
      print("Yes")
    else:
      print("No")
      
    break;
  order+=1;

Submission status: Accepted

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

Submission status: Accepted

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

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

  a = A
  c = C
  for i in range(200):
    if i%2 == 0:
      c -= B
      if c <= 0:
        print('Yes')
        return
    else:
      a -= D
      if a <= 0:
        print('No')
        return

if __name__ == '__main__':
  main()

Submission status: Accepted

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

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

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


if (c_count - a_count) >= 1:
    print('No')
else:
    print('Yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = [input() for i in range(1)] 
li = list(map(int, s[0].split()))
for i in range(0,1000):
    if i % 2 == 0:
        li[2] = li[2] - li[1]
        if li[2] <= 0:
            print("Yes")
            break
    else:
        li[0] = li[0] - li[3]
        if li[0] <= 0:
            print("No")
            break

Submission status: Accepted

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

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

for i in range(100):
    c= c - b 

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
a,b,c,d = map(int, input().split())
if c%b == 0:
    t = c//b 
else:
    t = c//b +1
if a%d == 0:
    u = a//d
else:
    u = a//d +1
if t > u:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c,d = input().split()
A = int(a)
B = int(b)
C = int(c)
D = int(d)
for i in range(A):
    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 = [int(x) for x in input().split()]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
hp1,at1,hp2,at2=[int(x) for x in input().split()]

hp1=hp1-at2*(hp2//at1)
hp2=hp2%at1


if hp2<=0:
    print("Yes")
elif hp1>0:
    print("Yes")
else:
    print("No")

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

for i in range(100):
    A = A - D
    C = C - B

    if C <= 0:
        print("Yes")
        break

    elif A <= 0:
        print("No")
        break

    else:
        continue