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

Submission status: Accepted

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

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

Submission status: Accepted

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

A=math.ceil(c/b)
B=math.ceil(a/d)

if A<=B:
  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:
        takahashi = True
        break
    a -= d
    if a <= 0:
        takahashi = False
        break

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

Submission status: Accepted

Solution code:
import sys

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections
from decimal import Decimal # 10進数で考慮できる

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))

A,B,C,D = LI()

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

Submission status: Accepted

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

Submission status: Accepted

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

i = 0
while True:
    if i % 2 == 0:
        c-=b
    else:
        a-=d

    if c <= 0:
        print('Yes')
        break
    if a <= 0:
        print('No')
        break
    i += 1

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
count1=0#高橋君が死ぬまでの回数
count2=0#青木君が死ぬまでの回数
while c>0:
    c-=b
    count2+=1
while a>0:
    a-=d
    count1+=1
if count1>=count2:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
ta_HP,ta_AT,ao_HP,ao_AT = map(int,input().split())

while True:
    ao_HP -= ta_AT
    if ao_HP <= 0:
        print('Yes')
        break
    ta_HP -= ao_AT
    if ta_HP <= 0:
        print('No')
        break

Submission status: Accepted

Solution code:
import sys 
import math
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
a,b,c,d = map(int,readline().split())
T = int(math.ceil(a / d))
A = int(math.ceil(c / b))
if A > T:
    print('No')
else:
    print('Yes')

Submission status: Accepted

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

Submission status: Accepted

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

taka_att = math.ceil(c / b)
aoki_att = math.ceil(a / d)

if taka_att <= aoki_att:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

while True:
    c -= b
    a -= d

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

Submission status: Accepted

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

turn_taka = True
while True:
    if turn_taka:
        c -= b
    else:
        a -= d

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

    turn_taka = not turn_taka

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

count = 0
while(True):
  if count%2 == 0:
    c -= b
  else :
    a -= d
  
  if (c <= 0) :
    print("Yes")
    break
  elif (a <= 0) :
    print("No") 
    break
  else :
    pass
  count += 1

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():

    A, B, C, D = input_ints()

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

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


def input_int():
    return int(input())


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


def input_int_list_in_line():
    return list(map(int, input().split()))


def input_int_tuple_list(n: int, q: int):
    return [tuple(map(int, input().split())) for _ in range(n)]


main()

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
h1,s1,h2,s2 = map(int, input().split())

while h1 > 0 or h2 > 0:
  h2 -= s1
  if h2 <= 0:
    print("Yes")
    break
  h1 -= s2
  if h1 <= 0:
    print("No")
    break

Submission status: Accepted

Solution code:
# 164 B

a, b, c, d = map(int, 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:
import math

def solve(a,b,c,d):
  x = math.ceil(c / b)
  y = math.ceil(a / d)
  return "Yes" if x <= y else "No"

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

Submission status: Accepted

Solution code:

a,b,c,d = map(int, input().split())
cnta = 0
cntc = 0
while a > 0:
    a -= d
    cnta += 1

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

# print(cnta, cntc)

if cnta >= cntc:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
  a, b, c, d = list(map(int, input().split()))
  
  count1 = 0
  count2 = 0
  
  while c > 0:
    c -= b
    count1 += 1
    
  while a > 0:
    a -= d
    count2 += 1
    
  if count1 <= count2:
    print('Yes')
  else:
    print('No')
    
  
main()

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

Submission status: Accepted

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

Submission status: Accepted

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

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

    if c <= 0:
        print("Yes")
        exit()

    elif a <= 0:
        print("No")
        exit()

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
cntt=0
cnta=0
while a>0:
    a-=d
    cntt+=1
while c>0:
    c=c-b
    cnta+=1

if cntt>=cnta:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import numpy as np
def cumsum(x):
    return list(np.cumsum(x))

def cumsum_number(N,K,x):
    ans=[0]*(N-K+1)
    number_cumsum = cumsum(x)
    number_cumsum.insert(0,0)
    for i in range(N-K+1):
        ans[i]=number_cumsum[i+K]-number_cumsum[i]
    return ans
"""
int #整数
float #小数

#for
for name in fruits: #fruitの頭から操作
    print(name)

#リスト
list0 = [] #リスト生成
list0 = [1,2,3,4] #初期化
list0 = [0]*10 #[0,0,0,0,0,0,0,0,0,0]
list1= [i for i in range(10)] #>>> [0, 1, 2, 3, 4, 5, 6, 7, 8, 9]
list1 = list(map(int, input().split()))　# 複数の入力をリストに入れる
number=[int(input()) for i in range(int(input()))] #複数行の入力をリストに
list1 = list1 + [6, 7, 8] #リストの追加
list2.append(34) #リストの追加　最後に（）内が足される
list.insert(3,10) #リストの追加　任意の位置（追加したい位置,追加したい値）
len(list4) #リストの要素数
max(sa) #list saの最小値
list5.count(2) #リスト(文字列も可）内の2の数
list1.sort() #並び替え小さい順
list1.sort(reverse=True)  #並び替え大きい順
set(list1) #list1内の重複している要素を削除し、小さい順に並べる
sum([2,3,   ,3]) #リストの合計

abs(a) #aの絶対値
max(a,b) min(a,b) #最大値　最小値
text1 = text1.replace("34","test") #text1内の"34"を"test"に書き換える(文字列内の文字を入れ替える)

exit(0) #強制終了

cumsum(リスト) #累積和をリストで返す
cumsum_number(N,K,x) #N個の数が含まれるリストx内のK個からなる部分和をリストで返す
"""
A,B,C,D=map(int,input().split())
aoki=C
takahashi=A
while True:
    aoki = aoki-B
    if aoki<=0:
        print("Yes")
        exit(0)
    takahashi= takahashi-D
    if takahashi<=0:
        print("No")
        exit(0)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
import itertools
# import numpy as np
import time
import math
 
sys.setrecursionlimit(10 ** 7)
 
from collections import defaultdict
 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

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

Submission status: Accepted

Solution code:
a,b,c,d = map(int, input().split())
e = a//d
f = a%d
if(not(f==0)):
  e+=1
g = c//b
h = c%b
if(not(h==0)):
  g+=1
if(e>=g):
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

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

if A//D+int(A%D!=0) >= C//B+int(C%B!=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:
a,b,c,d = map(int,input().split())

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

Submission status: Accepted

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

HP_t = [A]
HP_a = [C]

while HP_t[-1] > 0:
  HP_t.append(HP_t[-1] - D)
  HP_a.append(HP_a[-1] - B)

if HP_a[-1] > 0:
  print("No")
else:
  print("Yes")

Submission status: Accepted

Solution code:
def resolve():
	A, B, C, D = map(int, input().split()) #A高橋体力
	while True:
		C -= B
		if C <= 0:
			print("Yes"); return
		A -= D
		if A <= 0:
			print("No"); return

resolve()

Submission status: Accepted

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

Submission status: Accepted

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

x = (c+b-1)//b
y = (a+d-1)//d

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

Submission status: Accepted

Solution code:
def battle():
    condition = input()
    condition_list = condition.split()
    A = int(condition_list[0])
    B = int(condition_list[1])
    C = int(condition_list[2])
    D = int(condition_list[3])
    
    while True:
        C -= B
        if C <= 0:
            print('Yes')
            return
        
        A -= D
        if A <= 0:
            print('No')
            return

battle()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
x=a//d
y=c//b
if y<x:
    print('Yes')
elif y==x:
    if c%b==0:
        print('Yes')
    else:
        if a%d==0:
            print('No')
        else:
            print('Yes')
            
elif y==x+1:
    if c%b==0:
        print('Yes')
    else:
        print('No')
            
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")
		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:
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:
import sys
def main():
    A,B,C,D=tuple(map(int,sys.stdin.readline().split()))
    t=0
    while True:
        if t==0:
            if C<=B:break
            C-=B
        else:
            if A<=D:break
            A-=D
        t^=1
    print('Yes') if t==0 else print('No')
if __name__=='__main__':main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
th,ta ,ah , aa = map(int,input().split())

while th > 0 or ah >0:
  ah -= ta
  if th > 0:
    win = 'Yes'
  th -= aa
  if ah > 0:
    win = 'No'
print(win)

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:
import sys
from collections import deque
sys.setrecursionlimit(10**6)
def S(): return sys.stdin.readline().rstrip()
def SL(): return map(str,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def IL(): return map(int,sys.stdin.readline().rstrip().split())
def LS(): return list(sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))

def Main():
    a,b,c,d = IL()
    t = 1
    while 0<a and 0<c:
        if t%2:
            c -= b
        else:
            a -= d
        t += 1
    if a<c:
        print('No')
    else:
        print('Yes')
    return

if __name__=='__main__':
    Main()

Submission status: Accepted

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

i=0
while True:
  if a<=0 or c<=0: break
  if i%2!=0:
    a-=d
  else:
    c-=b
  i+=1
    
if a<=0:
  print('No')
else:
  print('Yes')

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
    if a <= 0:
        flg_t = 0
    if c <= 0:
        flg_t = 1
    t += 1

if flg_t == 0:
    print('No')
else:
    print('Yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l=list(map(int,input().split()))
T=[l[0],l[1]]
A=[l[2],l[3]]
bool = True
while(True):

	if(bool):
		A[0] -= T[1]
		bool = False
		if(A[0] <= 0):
			print("Yes")
			break
	else:
		T[0] -= A[1]
		bool = True	
		if(T[0] <= 0):
			print("No")
			break

Submission status: Accepted

Solution code:
from sys import stdin, stdout
a, b, c ,d = map(int, stdin.readline().strip().split())
from math import ceil
x = ceil(a/d)
y = ceil(c/b)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    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 a > 0:
        print('Yes')
    else:
        print('No')
    
if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A, B, C, D = map(int,input().split())
ans = "Yes"
curA = A
curC = C
for i in range(max(A,C)):
  curC  = curC-B
  if(curC<=0):
    ans = "Yes"
    break
  curA = curA-D
  if(curA<=0):
    ans = "No"
    break
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

for _ in range(100):
    c -= b
    if c <= 0:
        print("Yes")
        exit()
    a -= d
    if a <= 0:
        print("No")
        exit()

Submission status: Accepted

Solution code:
t_tairyoku,t_attack,a_tairyoku,a_attack = list(map(int,input().split()))

flag = 0
i = 0

while flag == 0:
    if i%2 == 0:
        a_tairyoku -= t_attack
    else:
        t_tairyoku -= a_attack
    if a_tairyoku <= 0:
        print("Yes")
        exit()
    if t_tairyoku <= 0:
        print("No")
        exit()
    i += 1

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
while d != 0 or a != 0:
  c -= b  # 高橋君の攻撃
  a -= d  # 青木君の攻撃
  if c <= 0:
    print("Yes")
    break
  elif a <= 0:
    print("No")
    break

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  # ignore trailing spaces

a,b,c,d = na()

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

Submission status: Accepted

Solution code:
import sys
from math import sqrt, gcd, ceil, log
from bisect import bisect
from collections import defaultdict
inp = sys.stdin.readline
read = lambda: list(map(int, inp().strip().split()))

# sys.setrecursionlimit(10**6)



def solve():
	a, b, c, d = map(int, input().split(" "))
	i = 0
	while a > 0 or c > 0:
		if i%2 == 0:
			c -= b
		else:
			a -= d
		i += 1
	print("YNeos"[i%2::2])



if __name__ == "__main__":
	solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

takahashi_turn=0
aoki_turn=0

while a>0:
    a-=d
    takahashi_turn+=1 #高橋君の生き残るターン数

while c>0:
    c-=b
    aoki_turn+=1 #青木君の生き残るターン数

if takahashi_turn>=aoki_turn:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
#include <CodeforcesSolutions.h>
#include <ONLINE_JUDGE <solution.cf(contestID = "1364",problemID = "A",method = "GET")>.h>
"""
    Author : thekushalghosh
    Team   : CodeDiggers
 
    I prefer Python language over the C++ language :p :D
        
    Visit my website : thekushalghosh.github.io
"""
import sys,math,cmath,time
start_time = time.time()
##########################################################################
################# ---- THE ACTUAL CODE STARTS BELOW ---- #################

def solve():
    a,b,c,d = invr()
    while True:
        c = c - b
        if c <= 0:
            print("Yes")
            break
        a = a - d
        if a <= 0:
            print("No")
            break
            
################## ---- THE ACTUAL CODE ENDS ABOVE ---- ##################
##########################################################################
 
def main():
    global tt
    if not ONLINE_JUDGE:
        sys.stdin = open("input.txt","r")
        sys.stdout = open("output.txt","w")
    t = 1
    for tt in range(t):
        solve()
    if not ONLINE_JUDGE:
        print("Time Elapsed :",time.time() - start_time,"seconds")
        sys.stdout.close()
    
#---------------------- USER DEFINED INPUT FUNCTIONS ----------------------#
def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    return(input().strip())
def invr():
    return(map(int,input().split()))
 
#------------------ USER DEFINED PROGRAMMING FUNCTIONS ------------------#
def counter(a):
    q = [0] * max(a)
    for i in range(len(a)):
        q[a[i] - 1] = q[a[i] - 1] + 1
    return(q)
 
def string_counter(a):
    q = [0] * 26
    for i in range(len(a)):
        q[ord(a[i]) - 97] = q[ord(a[i]) - 97] + 1
    return(q)

def power_two(n):
    if n == 1:
        return(True)
    sttr = str(n)
    len_str = len(sttr)
    sttr = list(sttr)
    num = 0
    if (len_str == 1 and sttr[len_str - 1] == '1'): 
        return(False)
    while (len_str != 1 or sttr[len_str - 1] != '1'):
        if ((ord(sttr[len_str - 1]) - ord('0')) % 2 == 1):
            return(False)
        j = 0; 
        for i in range(len_str):  
            num = num * 10 + (ord(sttr[i]) - ord('0')); 
            if (num < 2): 
                if (i != 0):  
                    sttr[j] = '0'
                    j += 1
                continue
  
            sttr[j] = chr((num // 2) + ord('0'))
            j += 1; 
            num = (num) - (num // 2) * 2
        len_str = j
    return(True)

def getLeftmostBit(n): 
    m = 0
    while (n > 1) : 
        n = n >> 1
        m += 1
    return(m)
def getNextLeftmostBit(n, m) : 
    temp = 1 << m 
    while (n < temp) : 
        temp = temp >> 1
        m -= 1
    return m
def bitcounter(n) :
    m = getLeftmostBit(n) 
    return _countSetBits(n, m) 
def _countSetBits(n, m) :
    if (n == 0) : 
        return 0
    m = getNextLeftmostBit(n, m)
    if (n == (1 << (m + 1)) - 1) : 
        return ((m + 1) * (1 << m))
    n = n - (1 << m)
    return (n + 1) + bitcounter(n) + m * (1 << (m - 1)) 

def log_two(n): 
    return(math.log(n) / math.log(2))

#-----------------------------------------------------------------------#
        
ONLINE_JUDGE = __debug__
if ONLINE_JUDGE:
    input = sys.stdin.readline
    
main()

Submission status: Accepted

Solution code:
import math
def fact(n):
    ans = 1
    for i in range(2, n+1):
        ans*= i
    return ans
def comb(n, c):
    return fact(n)//(fact(n-c)*c)

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

def main():
    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 and t_hp > 0:
            print('Yes')
            exit(0)
        elif t_hp <= 0 and a_hp > 0:
            print('No')
            exit(0)
        elif a_hp <= 0 and t_hp <= 0:
            print('Yes')
            exit(0)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
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:
a, b, c, d = map(int, input().split())
if -(-c // b) <= -(-a // d):
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

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

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,C,D = map(int,input().split())
aok_attack = -(-A//D) #高橋を倒すための攻撃回数
tkhs_attack = -(-C//B)#青木を倒すための攻撃回数
#print(tkhs_attack)
#print(aok_attack)
if tkhs_attack > aok_attack:
    print('No')
else:
    print('Yes')

Submission status: Accepted

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

Submission status: Accepted

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