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:
def main():
    num = input().split()
    A = int(num[0])
    B = int(num[1])
    C = int(num[2])
    D = int(num[3])
    count = 0
    while A > 0 and C > 0:
        if count % 2 == 0:
            C = C - B
            count += 1
        elif count % 2 == 1:
            A = A - D
            count += 1

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

flag = False
for idx in input_list:
    if idx>=1 and idx<=100:
        flag = True
    if flag is False:
        break
  
turn = 0
if flag:
    A, B, C, D = input_list
    continue_flag = True
    while continue_flag:
        if turn%2==0:
          C -= B
          if C<=0:
            print("Yes")
            continue_flag = False
          turn += 1
        else:
          A -= D
          if A<=0:
            print("No")
            continue_flag = False
          turn += 1

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

a=C//B
b=A//D

if C%B !=0:
    a+=1

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
t_life, t_at, a_life, a_at = map(int,input().split())

count=0
while True:
    count+=1
    if t_life<=0:
        print('No')
        break
    elif a_life<=0:
        print('Yes')
        break
    elif count%2==0:
        t_life=t_life-a_at

    else:
        a_life=a_life-t_at

Submission status: Accepted

Solution code:
t_hp, t_atk, a_hp, a_atk = map(int, input().split())
while (1):
    a_hp -= t_atk
    if a_hp <= 0:
        ans = "Yes"
        break
    t_hp -= a_atk
    if t_hp <= 0:
        ans = "No"
        break
    
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

turn = 0

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

if turn % 2 == 0:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

A, B, C, D = map(int, input().split())
turnT = math.ceil(A / D )
turnA = math.ceil(C / B )
if turnA  <= turnT:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
line=input().split(" ")
a=int(line[0])
b=int(line[1])
c=int(line[2])
d=int(line[3])
 
while a>0 and c>0:
  c=c-b
  if c<=0:
    print("Yes")
    break
  a=a-d
  if a<=0:
    print("No")
    break

Submission status: Accepted

Solution code:
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");
    elif a <= 0:
        print("No");

Submission status: Accepted

Solution code:
def solve():
    from sys import stdin
    lines = stdin
    
    A, B, C, D = map(int, lines.readline().split())
    
    while True:
        C -= B
        if C <= 0:
            print("Yes")
            break
        A -= D
        if A <= 0:
            print("No")
            break

solve()

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())
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
Th, Ta, Ah, Aa = [int(x) for x in input().strip().split()]
print("Yes" if math.ceil(Ah/Ta) <= math.ceil(Th/Aa) else "No")

Submission status: Accepted

Solution code:
import sys
readline = sys.stdin.buffer.readline
t1,t2,a1,a2= list(map(int,readline().rstrip().split()))
nnn = lambda x: 0 if x == 0 else 1  
if a1//t2 + nnn(a1%t2) <= t1//a2 + nnn(t1%a2):
  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:
from pip._vendor.distlib.compat import raw_input

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

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

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split(' '))
t_div, t_mod = divmod(C, B)
a_div, a_mod = divmod(A, D)
attack_time_takahashi = t_div + ( 1 if t_mod > 0 else 0)
attack_time_aoki = a_div + (1 if a_mod > 0 else 0)

if(attack_time_takahashi <= attack_time_aoki):
    print("Yes")
else:
    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 or e>f:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import math

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

T_hp = int(A)
T_atk = int(B)
A_hp = int(C)
A_atk = int(D)

T_burstturn = math.ceil(T_hp / A_atk)
A_burstturn = math.ceil(A_hp / T_atk)

if T_burstturn < A_burstturn:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

t1 = (a - 1) // d + 1
t2 = (c - 1) // b + 1

if t1 >= t2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

for i in range(1,101):
    c -= b
    if (c <= 0):
        print("Yes")    
        break
    
    a -= d
    if (a <= 0):
        print("No")    
        break

Submission status: Accepted

Solution code:
import sys

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

while 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<=A//D and A/D!=A//D:
  print('Yes')
elif C//B==A//D and  A/D==A//D and C//B==C/B:
  print('Yes')
elif C//B-1==A//D and C//B==C/B and A//D!=A/D:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
ok = True
for i in range(1000):
    if (i % 2 == 0):
        c -= b
        if (c <= 0):
            break
    else:
        a -= d
        if (a <= 0):
            ok = False
            break
if (ok):
    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:
        break
    A=A-D
    if A<=0:
        break

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding:utf-8

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

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

Submission status: Accepted

Solution code:
def Next(): return input()
def NextInt(): return int(Next())
def NextInts(): return map(int,input().split())
def Nexts(): return map(str,input().split())
def NextIntList(): return list(map(int,input().split()))
def RowInts(n): return [input() for i in range(n)]

a,b,c,d= NextInts() #高橋体力a 青木体力c

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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:
def main():
    a,b,c,d=map(int,input().split())
    while True:
        c-=b
        if c<=0:
            print('Yes')
            return
        a-=d
        if a<=0:
            print('No')
            return
main()

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

i = 0
result = None

while not result:
    if i % 2 == 0:
        c = c - b
        if c <= 0:
            result = 'Yes'
    else:
        a = a - d
        if a <= 0:
            result = 'No'

    i = i + 1

print(result)

Submission status: Accepted

Solution code:
#-*- coding: utf-8 -*-
a,b,c,d = map(int,input().split())
i = 1
while True:
    if c <= 0:
        print("Yes")
        break
    elif a <= 0:
        print("No")
        break
    elif i % 2 != 0:
        c -= b
        i += 1
    else:
        a -= d
        i += 1

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
# takahashi life:A attack:B
# aoki life:C attack:D
while A 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=list(map(int,input().split()))
print("Yes" if (c-1)//b+1 <= (a-1)//d+1 else "No")

Submission status: Accepted

Solution code:
import sys

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

while True:
  c -= b
  if c<1:
    print("Yes")
    sys.exit()
  a -= d
  if a<1:
    print("No")
    sys.exit()

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
M = [[A, B], [C, D]]
T, A, HP, AP = 0, 1, 0, 1
atkTtoA = (M[A][HP] + M[T][AP] - 1) // M[T][AP]
atkAtoT = (M[T][HP] + M[A][AP] - 1) // M[A][AP]
if atkAtoT < atkTtoA:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
import math
 
A, B, C, D = map(int, input().split())
M = [[A, B], [C, D]]
T, A, HP, AP = 0, 1, 0, 1
atkTtoA = math.ceil(M[A][HP] / M[T][AP])
atkAtoT = math.ceil(M[T][HP] / M[A][AP])
#print("attack T to A = ", atkTtoA)
#print("attack A to T = ", atkAtoT)
if atkAtoT < atkTtoA:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
import math

A, B, C, D = map(int, input().split())
M = [[A, B], [C, D]]
T, A, HP, AP = 0, 1, 0, 1
atkTtoA = math.ceil(M[A][HP] / M[T][AP])
atkAtoT = math.ceil(M[T][HP] / M[A][AP])
#print("attack T to A = ", atkTtoA)
#print("attack A to T = ", atkAtoT)
if atkAtoT < atkTtoA:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
M = [[A, B], [C, D]]
T, A = 0, 1
HP, AP = 0, 1
i = 0
while M[T][HP] * M[A][HP] > 0:
    if i % 2 == T:   # turn T
        M[A][HP] -= M[T][AP]
    else:   # turn A
        M[T][HP] -= M[A][AP]
    i += 1
if M[T][HP] > 0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a, b, c, d = 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())
takahashi = -(-C // B)
aoki = -(-A // D)

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

else:
    print('No')

Submission status: Accepted

Solution code:
import math
List = input().split()
HP_T = int(List[0])
AT_T = int(List[1])
HP_A = int(List[2])
AT_A = int(List[3])
result = 0

Turn_T = math.ceil(HP_A/AT_T)
Turn_A = math.ceil(HP_T/AT_A)
if Turn_T - Turn_A == 0:
  result = "Yes"  
if Turn_T - Turn_A < 0:
  result = "Yes"
if Turn_T - Turn_A > 0:
  result = "No"

print(result)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
buf = input().split()
th = int(buf[0])
ts = int(buf[1])
ah = int(buf[2])
ass = int(buf[3])

while True:
  ah -= ts
  if ah <= 0:
    break
  th -= ass
  if th <= 0:
    break

if ah <= 0:
  print('Yes')
if th <= 0:
  print('No')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:

def turn(A, HP):
    return HP - A


def main():
    tHP, tA, aHP, aA = list(map(int, input().split()))

    while True:
        aHP = turn(tA, aHP)
        if aHP < 1:
            print('Yes')
            return
        tHP = turn(aA, tHP)
        if tHP < 1:
            print('No')
            return


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

i = math.ceil(C / B) #青木君のもんすたーがやられるのにかかる
j = math.ceil(A / D) #高橋君

if i <= j:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
while a 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:
from sys import stdin

a, b, c, d = [int(x) for x in stdin.readline().rstrip().split()]
th = a // d if a % d == 0 else a // d + 1
ah = c // b if c % b == 0 else c // b + 1
print("Yes" if th >= ah else "No")

Submission status: Accepted

Solution code:
A,B,C,D = map(int, input().split())
f = True#高橋くんが勝つ
while True:
    C = C -B
    if C <= 0:
        f = True
        break
    A = A - D
    if A <= 0:
        f = False
        break
if f:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c, d = 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:
#B
a, b, c, d = map(int, input().split())
for i in range(0, 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())
n = 1
while True:
    a -= d * ((n+1)%2)
    c -= b * (n%2)
    if a <= 0:
        print('No')
        break
    elif c <= 0:
        print('Yes')
        break
    n += 1

Submission status: Accepted

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

Submission status: Accepted

Solution code:
class Monster:
    def __init__(self, name, life, attack):
        self.name = name
        self.life = life
        self.attack = attack

    def damaged(self, a):
        self.life -= a
        return self.life > 0

#return Winner
def battle(A, B):
    while True:
        if not B.damaged(A.attack):
            return A.name
        if not A.damaged(B.attack):
            return B.name

def main():
    a, b, c, d = map(int, input().split())
    A = Monster('takahashi', a, b)
    B = Monster('aoki', c, d)
    Winner = battle(A, B)
    ans = 'Yes' if Winner == 'takahashi' else 'No'
    print(ans)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

lifeT = A
lifeA = C
hitT = B
hitA = D
while 1:
    lifeA -= hitT
    if lifeA <= 0:
        print('Yes')
        break
    lifeT -= hitA
    if lifeT <= 0:
        print('No')
        break

Submission status: Accepted

Solution code:
A_HP, A_AP, B_HP, B_AP = map(int, input().split())
while True:
  B_HP -= A_AP
  if B_HP <= 0:
    print("Yes")
    break
  else:
    pass
  A_HP -= B_AP
  if A_HP <= 0:
    print("No")
    break
  else:
    pass

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
if -(-a[0]//a[3]) >= -(-a[2]//a[1]):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
from math import ceil

l = list(map(int, input().split()))
q = ceil(l[0]/l[3])
w = ceil(l[2]/l[1] )
if w <= q:
  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")
    exit()
  a=a-d
  if a<=0:
    print("No")
    exit()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

turn = 1
while True:
    if turn % 2 == 1:
        #takahashi turn
        C = C - B

        #判定
        if C <= 0:
            print("Yes")
            sys.exit()

    if turn % 2 == 0:
        # aoki turn
        A = A - D

        #判定
        if A <= 0:
            print("No")
            sys.exit()

    turn = turn + 1

Submission status: Accepted

Solution code:
hp_t, atk_t, hp_a, atk_a = map(int, input().split(" "))
while hp_t > 0:
    hp_a += -atk_t
    if hp_a <= 0:
        print("Yes")
        break
    else:
        hp_t += -atk_a
        if hp_t <= 0:
            print("No")
            break

Submission status: Accepted

Solution code:


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

    i = 1
    j = 0

    while True:
        j = i%2
        k = j + 3 - ((j+1)*j)
        player[j] = player[j] - player[k]
        if( player[j] <= 0 ):
            break
        i = i + 1

    if(j!=0):
        print('Yes')
    else:
        print('No')
        
main()

Submission status: Accepted

Solution code:
a = list(map(int,input().split()))
 
A = a[0]
B = a[1]
C = a[2]
D = a[3]
 
while A>0 and C>0:
  C = C - B
  if C <= 0:
    print("Yes")
    break
  A = A - D
  if A <= 0:
    print("No")
    break

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
 
flg = True
t = False
while(flg):
  C -= B
  if (C <= 0):
    t = True
    break
  A -= D
  if (A <= 0) :
    t = False
    break

if (t):
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

ns = lambda: stdin.readline().rstrip()
ni = lambda: int(stdin.readline().rstrip())
nm = lambda: map(int, stdin.readline().split())
nl = lambda: list(map(int, stdin.readline().split()))

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

Submission status: Accepted

Solution code:
a, b, c, d  = map(int,input().split())
while a > 0 or c > 0 :
    c -= b
    if c <= 0 :
        print("Yes")
        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:
        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=map(int,input().split()) 
for i in range(200):
    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 :
     rem = C/B
else :
     rem = (C - C%B)/B+1

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

if rem <= rem2 :
    print('Yes')
else :
    print('No')

Submission status: Accepted

Solution code:
a, b, c, d = map( int, input().split() )
#print( a, b, c, d )
 
for i in range( 200 ):
    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() )
#print( a, b, c, d )
 
for i in range( 200 ):
    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())

taka = A//D
amt = A%D
aok = C//B
ama = C%B

if amt>0:
    taka+=1

if ama>0:
    aok +=1


if taka>=aok:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
takahashi = [a, b]
aoki = [c, d]
attackers = [takahashi, aoki]
attacker = 0

while attackers[0][0]!=0 and attackers[1][0]!=0:
  attackers[attacker^1][0] = max(0, attackers[attacker^1][0]-attackers[attacker][1])
  attacker = attacker^1

if attackers[0][0]==0:
  print('No')
else:
  print('Yes')

Submission status: Accepted

Solution code:
import numpy as np

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

for i in range( 200 ):
    c = c - b
    if c <= 0:
        print( "Yes" )
        exit()

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

Submission status: Accepted

Solution code:
import math

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

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


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

Submission status: Accepted

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

attackA = True

while a>0 and c>0:
  if attackA:
    c = c-b
  else:
    a = a-d
  
  attackA = not(attackA)

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

Submission status: Accepted

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

for i in range(1000):
    
    c -= b
    if c <=0:
        print("Yes")
        break
    
    a -=d
    if a <=0:
        print("No")
        break

Submission status: Accepted

Solution code:
string = input()
array = string.split()
hp_t = int(array[0])
attack_t = int(array[1])
hp_a = int(array[2])
attack_a = int(array[3])

for i in range(100):
    hp_a -= attack_t
    if hp_a <= 0:
        print('Yes')
        break
    hp_t -= attack_a
    if hp_t <= 0:
        print('No')
        break

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# B

inputs = input().split(' ')

d = inputs[0:2]
takahashi = {'Name': 'Takahashi', 'Hp': int(d[0]), 'Power': int(d[1])}
d = inputs[2:4]
aoki = {'Name': 'Aoki', 'Hp': int(d[0]), 'Power': int(d[1])}

players = [takahashi, aoki]

def compute(players):
    N =len(players)
    while True:
        for i in range(N):
            players[i-1]['Hp'] -= players[i]['Power']
            if players[i-1]['Hp'] <= 0:
                if players[i]['Name'] == 'Takahashi':
                    print('Yes')
                else:
                    print('No')
                return 

compute(players)

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=(a+d-1)//d
y=(c+b-1)//b

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

Submission status: Accepted

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

# a = 10
# b = 2
# c = 10
# d = 3

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

Submission status: Accepted

Solution code:
A,B,C,D=map(int,input().split())
while all:
    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:
    c = c-b
    if c <= 0:
        print('Yes')
        exit()
    a = a-d
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 = map(int, input().split(' '))
while A>0 and C>0:
  #青木戦
  C -= B
  if C <= 0: break
  #高橋戦
  A -= D
#結果出力
print('Yes' if A>C else 'No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

while True:
    c = c - b
    if c <= 0:
        print("Yes")
        sys.exit()
    else:
        a = a - d
    if a <= 0:
        print("No")
        sys.exit()

Submission status: Accepted

Solution code:
t_hp, t_pwr, a_hp, a_pwr = map(int, input().split())

while True:
    a_hp -= t_pwr
    t_hp -= a_pwr

    if a_hp <= 0:
        print("Yes")
        break
    elif t_hp <= 0:
        print("No")
        break

Submission status: Accepted

Solution code:
a1, a2, b1, b2 = map(int, input().split())

if -(-b1//a2) <= -(-a1//b2):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:

input_line = input().split()
A = int(input_line[0])
B = int(input_line[1])
C = int(input_line[2])
D = int(input_line[3])
while (1):
    C -= B
    if C <= 0:
        print("Yes")
        break
    A -= D
    if A <= 0:
        print("No")
        break

Submission status: Accepted

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

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

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

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

Submission status: Accepted

Solution code:
a,c,b,d = map(int,input().split())
 
def cmald(a,b,c,d):
  while True:
    b-=c
    if b<=0:
      print("Yes")
      return 
    a-=d
    if a<=0:
      print("No")
      return 
    
cmald(a,b,c,d)

Submission status: Accepted

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

print('Yes' if ceil(C / B) <= ceil(A / D) else 'No')

Submission status: Accepted

Solution code:
t_hp, t_atk, a_hp, a_atk = map(int, input().split())
frag = 0
winner = 0 # 1:takahashi, 2:Aoki
while(frag == 0):
    a_hp = a_hp - t_atk
    if(a_hp <= 0):
        frag = 1
        winner = 1
        break
    t_hp = t_hp - a_atk
    if(t_hp <= 0):
        frag = 1
        winner = 2
        break

if(winner == 1):
    print('Yes')
else:
    print('No')