Problem:


Score : 200 points

Problem Statement

Takahashi and Aoki will have a battle using their monsters.

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

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

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

Constraints

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

All values in input are integers.

Input

Input is given from Standard Input in the following format:

A B C D

Output

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

Sample Input 1

10 9 10 10

Sample Output 1

No

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

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

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

Sample Input 2

46 4 40 5

Sample Output 2

Yes



Sample input:
10 9 10 10


Sample output:
No

Submission status: Accepted

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

Submission status: Accepted

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

while True:
    C = C - B

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

    A = A - D

    if A <= 0:
        print('No')
        break

Submission status: Accepted

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

    h1, a1, h2, a2 = map(int, input().split())
    t1 = (h1 + a2 - 1)//a2
    t2 = (h2 + a1 - 1)//a1
    if t1 < t2:
        print('No')
    else:
        print('Yes')

Submission status: Accepted

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

def battle(a, b, c, d):
    i = 1
    while True:
        if i % 2 == 0:
            a -= d
            if a <= 0:
                return 'No'
        else:
            c -= b
            if c<= 0:
                return 'Yes'
        i += 1


print(battle(a, b, c, d))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,C,D = map(int, input().split())
for i in range(1,101):
  if C-B*i <= 0:
    print('Yes')
    exit()
  if A-D*i <= 0:
    print('No')
    exit()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, C, D = map(lambda x: int(x), 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 a <= 0:
        print('No')
        exit()
    if c <= 0:
        print('Yes')
        exit()
    
    a -= d
    if a <= 0:
        print('No')
        exit()
    if c <= 0:
        print('Yes')
        exit()

Submission status: Accepted

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

print('Yes') if taka_hp >= ao_hp else print('No')

Submission status: Accepted

Solution code:
T_HP, T_A, A_HP, A_A = map(int, input().split())

while (True):
    A_HP -= T_A
    if (A_HP <= 0):
        print('Yes')
        exit()
    else:
        T_HP -= A_A
    
    if (T_HP <= 0):
        print('No')
        exit()

Submission status: Accepted

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

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

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

Submission status: Accepted

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

takahashi = A
aoki = C

while takahashi > 0 and aoki > 0:
    aoki -= B 
    takahashi -= D

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

# print('-----output-----')

Submission status: Accepted

Solution code:
# B - Battle

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
data = input().split(' ')
a = int(data[0])
b = int(data[1])
c = int(data[2])
d = int(data[3])
takahashi_turn = False
while a > 0 and c > 0:
    takahashi_turn = not takahashi_turn
    if takahashi_turn:
        c -= b
    else:
        a -= d
if takahashi_turn:
    print('Yes')
else:
    print('No')

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:
A,B,C,D = map(int,input().split())
while True:
    C -= B
    if C <= 0:
        print("Yes")
        quit()
    A -= D
    if A <= 0:
        print("No")
        quit()

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
if(C % B == 0):
  Takahashi = C//B
else:
  Takahashi = C//B + 1
if(A % D == 0):
  Aoki = A//D
else:
  Aoki = A//D + 1
if(Takahashi > Aoki):
  print('No')
else:
  print('Yes')

Submission status: Accepted

Solution code:
a, b, c, d = list(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:
import math
a,b,c,d = list(map(int, input().split(" ")))

n_t = math.ceil(a/d)
n_a = math.ceil(c/b)

if n_a <= n_t :
    print('Yes')
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

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

    flg = False

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

        if c > 0:
            a -= d
        else:
            flg = True
            break

    if flg == False:
        print('No')
    else:
        print('Yes')



if __name__ == '__main__':
    main()

Submission status: Accepted

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

A += D
while True:
    A -= D
    if A<=0:
        print("No")
        break
    C -= B
    if C<=0:
        print("Yes")
        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:
A,B,C,D = map(int, input().split())
t_ta=0
t_aa=0

tatk = C//B
tss = C % B

aatk = A//D
ass = A % D

if tss == 0:
    t_ta = tatk
else: 
    t_ta = tatk+1
    
if ass ==0:
    t_aa = aatk
else:
    t_aa = aatk+1
    
if t_ta -t_aa >0:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
if a%d == 0:
    takahashi_turn = a//d
else:
    takahashi_turn = a//d+1
if c%b == 0:
    aoki_turn = c//b
else:
    aoki_turn = c//b+1
#print(takahashi_turn, aoki_turn)
print('Yes' if takahashi_turn >= aoki_turn else 'No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    A, B, C, D = map(int, input().split())
    for i in range(500):
        if i % 2 == 0:
            C -= B
        else:
            A -= D
        if (A < 1) or (C < 1):
            if i % 2 == 0:
                print('Yes')
            else:
                print('No')
            exit()


if __name__ == '__main__':
    main()

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

A,b,B,a = map(int,input().split())	
while A and B:
    B=B-b
    if(B<=0):
        print("Yes")
        quit()
    A=A-a
    if(A<=0):
        print("No")
        quit()

Submission status: Accepted

Solution code:
import math

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

t_num = math.ceil(c / b)
a_num = math.ceil(a / d)

if t_num <= a_num:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

div = True
while a > 0 and c > 0:
    if div:
        c -= b
        div = False
    else:
        a -= d
        div = True

if div:
    print('No')
else:
    print('Yes')

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:
import math
a,b,c,d=map(int,input().split())
for _ in range(100000):
  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
    if c <= 0:break
    a -= d
    if a <= 0:break
if a <= 0:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

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 = list(map(int,input().split()))
countT = 0
countA = 0
if A % D == 0:
  countT = int(A/D)
else:
  countT = A//D + 1
if C % B == 0:
  countA = int(C/B)
else:
  countA = C//B + 1
if countT >= countA:
  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:
        break
    a -= d
    if a <= 0:
        break

print(['No', 'Yes'][a > 0])

Submission status: Accepted

Solution code:
A, B, C, D = list(map(int, input().strip().split()))
Takahashi = A
Aoki = C
ans = ''

while True:
  Aoki -= B
  if Aoki <= 0:
    ans = 'Yes'
    break
  Takahashi -= D
  if Takahashi <= 0:
    ans = 'No'
    break
print(ans)

Submission status: Accepted

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

while a > 0 and c > 0:
    c -= b
    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().rstrip().split())
for _ in range(100):
    C -= B
    if C < 1:
        print('Yes')
        break
    A -= D
    if A < 1:
        print('No')
        break

Submission status: Accepted

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

def main():
    a, b, c, d = map(int, input().split())
    while a > 0 or c > 0:
        c -= b
        a -= d

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import math
A,B,C,D = map(int, input().split())
turn_A = math.ceil(C/B)
turn_B = math.ceil(A/D)
if turn_A<=turn_B:
    print("Yes")
else:
    print(("No"))

Submission status: Accepted

Solution code:
def main():
    import sys
    input = sys.stdin.readline

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

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import math
a,b,c,d=(int(i) for i in input().split())
k1=math.ceil(c/b)
k2=math.ceil(a/d)
if(k1<=k2):
  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
    if C <= 0:
        res = "Yes"
        break
    A -= D
    if A <= 0:
        res = "No"
        break
print(res)

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

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
print('Yes' if a > 0 else 'No')

Submission status: Accepted

Solution code:
a,b,c,d=[int(x) for x in input().split()]
t1=c//b
if c%b==0:
  t1-=1
t2=a//d
if a%d==0:
   t2-=1
if(t1>t2):
  print("No")
else:
  print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# import math
# import numpy as np
# import itertools
# import heapq
import sys
a,b,c,d=map(int,input().split())
cnt=1
for i in range(1000):
    if cnt==1:
        c-=b  
        if c<=0:
            print('Yes')  
            sys.exit()
        cnt*=-1
    if cnt==-1:
        a-=d
        if a<=0:
            print('No')
            sys.exit()
        cnt*=-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())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
##################################
# University of Wisconsin-Madison
# Author: Yaqi Zhang
##################################

# standard library
import sys
from functools import lru_cache

sys.setrecursionlimit(10**9)

Input = lambda: sys.stdin.readline().rstrip()
IntRead = lambda: int(Input())
LineRead = lambda: list(map(int, Input().split()))


INF = 10**18

def main():
    t_h, t_a, a_h, a_a = LineRead()
    idx = 0
    while True:
        if idx % 2 == 0:
            a_h -= t_a
            if a_h <= 0:
                print("Yes")
                break
        else:
            t_h -= a_a
            if t_h <= 0:
                print("No")
                break
        idx += 1


if __name__ == "__main__":
    main()

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:
a, b, c, d = map(int, input().split())
c_c = c//b if c%b == 0 else c//b+1
a_c = a//d if a%d == 0 else a//d+1

if c_c <= a_c:
  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:
    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 -= B
    A -= D

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

Submission status: Accepted

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

Submission status: Accepted

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

turn_T = 0
turn_A = 0

while C > 0:
    C -= B
    turn_A += 1


while A > 0:
    A -= D
    turn_T += 1

if turn_A <= turn_T:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import math
A, B, C, D = map(int, input().split())
t = math.ceil(C/B)
a = math.ceil(A/D)
if t <= a:
    print("Yes")
elif t > a:
    print("No")

Submission status: Accepted

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

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

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

Submission status: Accepted

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

while  c>0:
  c=c-b
  cnt_t+=1
while a>0:
  a=a-d
  cnt_a+=1

if cnt_t<=cnt_a:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

turn_a = math.ceil(c / b)
turn_b = math.ceil(a / d)

# print(turn_a)
# print(turn_b)

if turn_b < turn_a:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
hp_t,at_t,hp_a,at_a=map(int,input().split())

judge=1
while judge > 0:
    hp_a=hp_a-at_t
    if hp_a<=0:
        print('Yes')
        break
    hp_t=hp_t-at_a
    if hp_t<=0:
        print('No')
        break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import numpy as np
import sys
import math

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

time = int( c / b )
w = c % b 
if w != 0:
    time += 1

if a - ( (time-1)*d) > 0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding:utf-8

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

Submission status: Accepted

Solution code:
TH,TS,AH,AS = map(int,input().split())
while True:
  AH -= TS
  if AH <= 0:
    print('Yes')
    break
  else:
    TH -= AS
    if TH <= 0:
      print('No')
      break

Submission status: Accepted

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

for i in range(10**9):
    c = c - b
    
    if c <=0:
        print('Yes')
        exit()
    a = a - d
    if a <=0:
        print('No')
        exit()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input('').split(' '))
while(1):
    c=c-b
    if c<=0:
        s=1
        break
    
    a=a-d
    if a<=0:
        s=2
        break

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

Submission status: Accepted

Solution code:
import sys
a,b,c,d=map(int,input().split())
turn = 1 #1:Takahashi -1:Aoki
while True:
  if turn==1:
    c-=b
    if c <= 0:
      print('Yes')
      sys.exit()
    else:
      turn *= -1
  else:
    a-=d
    if a <= 0:
      print('No')
      sys.exit()
    else:
      turn *= -1

Submission status: Accepted

Solution code:
import sys
import os

def file_input():
    f = open('../Beginner_Contest_164/input.txt', 'r')
    sys.stdin = f

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
for i in range(110):
  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
if A <= 0:
    if C <= 0:
        print('Yes')
    else:
        print('No')
else:
    print('Yes')

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())
while 1:
  A -= D
  C -= B
  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())
amari = lambda x,y:0 if x%y == 0 else 1 
killaoki = C//B + amari(C,B)
killtakahashi = A//D + amari(A,D)
ans = lambda x,y:"Yes" if x<=y else "No"
print(ans(killaoki,killtakahashi))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math


def run():
    t_hp, t_att, a_hp, a_att = map(int, input().split())

    t_required_attack_num = math.ceil(a_hp / t_att)
    a_required_attack_num = math.ceil(t_hp / a_att)

    if t_required_attack_num <= a_required_attack_num:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    run()

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

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

if A % D != 0:
    ans_C =  A // D + 1
else:
    ans_C = A // D


if ans_A <= ans_C:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
ans=0
for i in range(1,101):
  if b*i>=c and d*(i-1)<a:
    ans=1
    break
  elif b*i<c and d*i>=a:
    ans=0
    break
if ans==1:
  print('Yes')
elif ans==0:
  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())
 
if c%b==0:
  e=c//b
else:
  e=c//b+1
  
if a%d==0:
  f=a//d
else:
  f=a//d+1  

if e<=f:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
a, b, c, d = list(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('Yes')
else:
    print('No')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math

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

N = math.ceil(C / B)
M = math.ceil(A / D)

if N <= M:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:

A,B,C,D = map(int,input().split())
takahasi = 0
aoki = 0
while C > 0:
  C -= B
  takahasi += 1
while A > 0:
  A -= D
  aoki += 1
if takahasi <= aoki:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
# import sys
# sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
def II(): return int(input())

def MI(): return map(int, input().split())
def MI1(): return map(int1, input().split())

def LI(): return list(map(int, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

from math import ceil

def solve():
    a, b, c, d = MI()

    aoki = ceil(a / d)
    taka = ceil(c / b)
    # print(taka, aoki)

    if taka > aoki:
        print('No')
    else:   # taka <= aoki
        print('Yes')



if __name__ == '__main__':
    solve()

Submission status: Accepted

Solution code:
a = input().split(" ")
tk_hp= int(a[0])
tk_dmg= int(a[1])
aoki_hp= int(a[2])
aoki_dmg= int(a[3])

turn = 'tk'
while True:
  if turn == 'tk':
    aoki_hp -= tk_dmg
    turn = 'aoki'
  else:
    tk_hp -= aoki_dmg
    turn = 'tk'
    
  if aoki_hp <= 0:
    print('Yes')
    break
  elif tk_hp <= 0:
    print('No')
    break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
A, B, C, D = [int(x) for x in input().split()]
if math.ceil(A/D) < math.ceil(C/B):
  print("No")
else:
  print("Yes")

Submission status: Accepted

Solution code:
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:
# B
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())
ans = "Yes"
while True:
    C -= B
    if C <= 0:
        print("Yes")
        exit()
    A -= D
    if A <= 0:
        print("No")
        exit()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# int(input()) # 入力が1つ
a, b, c, d = map(int, input().split()) # 入力が複数
# [int(i) for i in input().split()] # 配列で数字

t = 0
while a > 0 or c > 0:
    if t == 0: # takahashi attack
        c -= b
        t = 1
    else:
        a -= d
        t = 0
    if c < 1:
        print('Yes')
        break
    if a < 1:
        print('No')
        break

Submission status: Accepted

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

taka = a
aoki = c

while taka > 0 and aoki > 0:
    aoki = aoki - b
    if(aoki <= 0):
        print("Yes")
        break

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

Submission status: Accepted

Solution code:
from heapq import heappush, heappop, heapify
from collections import deque, defaultdict, Counter
import itertools
from itertools import permutations, combinations, accumulate, product
import sys
import bisect
import string
import math
import time


def I(): return int(input())


def S(): return input()


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


def MS(): return map(str, input().split())


def LI(): return [int(i) for i in input().split()]


def LI_(): return [int(i)-1 for i in input().split()]


def StoI(): return [ord(i)-97 for i in input()]


def ItoS(nn): return chr(nn+97)


def input(): return sys.stdin.readline().rstrip()


def debug(table, *args):
    ret = []
    for name, val in table.items():
        if val in args:
            ret.append('{}: {}'.format(name, val))
    print(' | '.join(ret), file=sys.stderr)


yn = {False: 'No', True: 'Yes'}
YN = {False: 'NO', True: 'YES'}
MOD = 10**9+7
inf = float('inf')
IINF = 10**10
l_alp = string.ascii_lowercase
u_alp = string.ascii_uppercase
ts = time.time()
sys.setrecursionlimit(10**6)
nums = ['1', '2', '3', '4', '5', '6', '7', '8', '9', '10']

show_flg = False
# show_flg = True


def main():
    A, B, C, D = MI()
    i = 0

    while A > 0 and C > 0:
        if i % 2 == 0:
            C -= B
        else:
            A -= D
        i += 1
        # print('A', A)
        # print('C', C)

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 7)

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

def cond():
    count1 = c // b
    if c % b != 0:
        count1 += 1
    count2 = a // d
    if a % d != 0:
        count2 += 1
    return count1 <= count2

if cond():
    print('Yes')
else:
    print('No')