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())
tt = (c + b - 1) // b
at = (a + d - 1) // d
print("Yes" if tt <= at else "No")

Submission status: Accepted

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

i=0
while True:
    i += 1
    if c - b*i <=0:
        print("Yes")
        break
    elif a-d*i <=0:
        print("No")
        break
    else:
        continue

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

flag = False

while A > 0 or C > 0:
  C = C - B
  if C <= 0:
    flag = True
    break

  A = A - D
  if A <= 0:
    flag = False
    break

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# coding: utf-8
import sys
sysread = sys.stdin.readline
def run():
    a,b,c,d = list(map(int, sysread().split()))
    A = [0,[a,b],[c,d]]
    turn = 1
    while True:
        att = A[turn]
        de = A[-turn]
        de[0] -= att[1]
        if de[0] <= 0:
            break
        turn *= -1
    ret = ['', 'Yes', 'No']
    print(ret[turn])

if __name__ == "__main__":
    run()

Submission status: Accepted

Solution code:
A,B,C,D = (int(x) for x in 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())
isT = True
while True:
    if isT:
        c -= b
        isT = False
        if c <= 0:
            print("Yes")
            quit()
    else:
        a -= d
        isT = True
        if a <= 0:
            print("No")
            quit()

Submission status: Accepted

Solution code:
t_hp, t_att, a_hp, a_att = map(int, input().split())

while(t_hp > 0 and a_hp > 0):
    a_hp -= t_att
    t_hp -= a_att

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

Submission status: Accepted

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

# A and C is health

attA = A//D if (A%D==0) else A//D+1
attC = C//B if (C%B==0) else C//B+1


print("Yes" if attA>=attC else "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())
for i in range(101):
  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 = c - b
  if c <= 0:
    break
  a = a - d
  if a <= 0:
    break
#print(a,b,c,d)
if a <= 0:
  print('No')
else:
  print('Yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
hp = [0, 0]
atk = [0, 0]
hp[0], atk[0], hp[1], atk[1] = [int(x) for x in input().split()]

while True:
    for i in range(2):
        if hp[0] <= 0 or hp[1] <= 0: break
        hp[1 - i] -= atk[i]
    else:
        continue
    break
if hp[0] > 0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

import math
p1 = math.ceil(c/b)
p2 = math.ceil(a/d)

if(p1<=p2):
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
import numpy as np
import math

ABCD=np.array(input().split(" "),dtype=np.int32)

A=ABCD[0]
B=ABCD[1]
C=ABCD[2]
D=ABCD[3]

Aturn=math.ceil(A/D)
Cturn=math.ceil(C/B)

if(Aturn>=Cturn):
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inp = input()
values = inp.split(" ")
Ah = values[0]
As = values[1]
Bh = values[2]
Bs = values[3]
while int(Ah) > 0 and int(Bh) > 0:
    tempB = int(Bh)
    tempA = int(Ah)
    tempB = tempB - int(As)
    if tempB > 0:
        tempA = tempA - int(Bs)
    Ah = str(tempA)
    Bh = str(tempB)
if int(Ah) > int(Bh):
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
import numpy as np

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


def solve(A: int, B: int, C: int, D: int):
    while(True):
        C -= B
        if C<=0:
            print(YES)
            return
        A -= D
        if A<=0:
            print(NO)
            return

    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    B = int(next(tokens))  # type: int
    C = int(next(tokens))  # type: int
    D = int(next(tokens))  # type: int
    solve(A, B, C, D)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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


if wintaka<=winao:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

while 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())
ta = -a//d*-1
ao = -c//b*-1
if ta>=ao:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
A,B,C,D = map(int,input().split())
for i in range(A*C):
  if i%2 == 0:
    C = C - B
  else:
    A = A - D
  if C <= 0 or A <= 0:
    break
if C <= 0 and A > 0:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

if A%D !=0:
    b=A//D +1
else:
    b=A//D
    
if b<a:
    print('No')
else:
    print('Yes')

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

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

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

else:
    print('No')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solution():
    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

solution()

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

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 = input().split(' ')
A,B,C,D = int(A),int(B),int(C),int(D)

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
def main():
    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())

while C > 0 and A > 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=map(int,input().split(" "))

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

Submission status: Accepted

Solution code:
thp, tat, ahp, aat = map(int, input().split())
tturn = (ahp-1)//tat+1
aturn = (thp-1)//aat+1

if(tturn > aturn):
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, B, C, D = [int(i) for i in input().split()]
player1 = C//B
if C % B != 0:
    player1 += 1
player2 = A//D
if A % D != 0:
    player2 += 1
if player1 <= player2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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


for c in range(205):
    if c % 2 ==0:
        C = C-B
        if C <=0:
            ans = 'Yes'
            break
    else:
        A =A-D
        if A <=0:
            ans = 'No'
            break
#     print(A,B,C,D)
print(ans)

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())
m=0
n=0
while C>0:
    C=C-B
    n+=1
while A>0:
    A=A-D
    m+=1
if m<n:
    print('No')
else:
    print('Yes')

Submission status: Accepted

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

for i in range(10000):
    if i % 2 == 0:
        c -= b
        if c <= 0:
            t_win = 1
            #print('Yes')
            break
    else:
        a -= d
        if a <= 0:
            t_win = 0
            #print('No')
            break
    
    #print(a, c)
    #if t_win == 0 or t_win == 1:
    #    break

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math
ah,ast,bh,bst=[int(x) for x in input().split()]
if(bh<=ast):
    print("Yes")
else:
    count_tak=math.ceil(ah/bst)
    count_aok=math.ceil(bh/ast)
    if(count_aok<=count_tak):
        print("Yes")
    else:
        print("No")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A_hp, B_attack, C_hp, D_attack = map(int, input().split())
turn = 0
while A_hp > 0 and C_hp > 0:
    turn = turn + 1
    if turn%2 == 1:
        C_hp = C_hp - B_attack
    else:
        A_hp = A_hp - D_attack
if turn%2 == 1:
    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] = [int(s) for s in input().rstrip().split(' ')]
t = -(-A//D)
a = -(-C//B)
if t >= a:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
# from fractions import gcd
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from functools import reduce
from bisect import bisect_left, insort_left
from heapq import heapify, heappush, heappop

INPUT = lambda: sys.stdin.readline().rstrip()
INT = lambda: int(INPUT())
MAP = lambda: map(int, INPUT().split())
S_MAP = lambda: map(str, INPUT().split())
LIST = lambda: list(map(int, INPUT().split()))
S_LIST = lambda: list(map(str, INPUT().split()))

sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7


def main():
    A, B, C, D = MAP()

    for i in range(101):
        A -= D
        C -= B
        if C <= 0:
            print("Yes")
            sys.exit()
        elif A <= 0:
            print("No")
            sys.exit()


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# Problem B - Battle

import math

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

# initialization
takahashi = math.ceil(C / B)
aoki = math.ceil(A / D)

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import math
    
def abs(num):
    if num < 0:
        return -num
    else:
        return num

###
# main
if(__name__ == '__main__'):
    # input
    a, b, c, d = map(int, input().split(" "))

    num_t = c // b
    if c % b != 0:
        num_t += 1
    
    num_a = a // d
    if a % d != 0:
        num_a += 1
    
    if num_t <= num_a:
        print("Yes")
    else:
        print("No")
    
# else:
    # do nothing

Submission status: Accepted

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

n=(a-1)//d
m=(c-1)//b

if n>=m:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
t_hp, t_atk, a_hp, a_atk = [int(i) for i in input().split()]

while t_hp > 0 and a_hp > 0 :
  a_hp -= t_atk
  if a_hp <= 0 :
    break
  t_hp -= a_atk
if t_hp <= 0 :
  print('No')
else :
  print('Yes')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

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

e = ceil(c / b)
f = ceil(a / d)

ans = "Yes" if e <= f else "No"
print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin


def main():
    input = lambda: stdin.readline()[:-1]
    A, B, C, D = map(int, input().split())

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


main()

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())
aoki =-(-c//b)
taka = -(-a//d)
print('Yes' if taka >= aoki else 'No')

Submission status: Accepted

Solution code:
import math
def main():
    a, b, c, d = [float(i) for i in input().split()]
    taka = math.ceil(c / b)
    aoki = math.ceil(a / d)
    if taka <= aoki:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import math

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

x = math.ceil(A / D)
y = math.ceil(C / B)

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

Submission status: Accepted

Solution code:
line = input().rstrip().split(' ')

a = int(line[0])
b = int(line[1])
c = int(line[2])
d = int(line[3])

while a > 0 or 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())

isTsTurn = True

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

    isTsTurn = not isTsTurn

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

Submission status: Accepted

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

Submission status: Accepted

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

rnd = 0
while A > 0 and C > 0:
    rnd = (rnd + 1) % 2
    if rnd:
        C -= B
    else:
        A -= D

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

Submission status: Accepted

Solution code:
T_HP,T_AT,A_HP,A_AT = list(map(int, input().split()))
for i in range(102):
    A_HP = A_HP - T_AT
    if A_HP <= 0:
        print('Yes')
        break
    T_HP = T_HP - A_AT
    if T_HP <= 0:
        print('No')
        break

Submission status: Accepted

Solution code:
Thp, Tatk, Ahp, Aatk = map(int, input().split())
flag = 0
while(1):
    Ahp -= Tatk
    if Ahp <= 0:
        print("Yes")
        break
    Thp -= Aatk
    if Thp <= 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:
        break
    A = A - D

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

Submission status: Accepted

Solution code:
from math import ceil
A, B, C, D = map(int, input().split())
Takahashi = ceil(A/D)
Aoki = ceil(C/B)
if Takahashi >= Aoki:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math
import sys
#sys.exit()
#sorted( ,reverse=True)
#N = int(input())
A,B,C,D = map(int, input().split())
#A = list(map(int, input().split()))
#print(N)
#print(S,T)
#print(A)
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 a%d==0:
    s = a//d
else:
    s = a//d + 1
if c%b ==0:
    r = c//b
else:
    r = c//b+1
if s >= r:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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

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 and c<=0:
  print("Yes")
elif a<=0:
  print("No")
else:
  print("Yes")

Submission status: Accepted

Solution code:
date=input().rstrip().split(" ")
A=int(date[0])
B=int(date[1])
C=int(date[2])
D=int(date[3])
a=0
while a==0:
  C=C-B
  if C<=0:
    print("Yes")
    a=1
  else:
    A=A-D
    if A<=0:
      print("No")
      a=1

Submission status: Accepted

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

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

Submission status: Accepted

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

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())
counta = 0
countb = 0
while True:
    C = C - B
    countb += 1
    if C <= 0:
        break
while True:
    A = A - D
    counta += 1
    if A <= 0:
        break
if counta >= countb:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
from collections import defaultdict,deque
import sys,heapq,bisect,math,itertools,string,queue,copy,time
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inp():
    '''
    一つの整数
    '''
    return int(input())
def inpl():
    '''
    一行に複数の整数
    '''
    return list(map(int, input().split()))
def inpl_str():
    '''
    一行に複数の文字
    '''
    return list(input().split())


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

Submission status: Accepted

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

A_n = C // B
amari = C % B
if amari > 0:
  A_n += 1

C_n = A // D
amari = A % D
if amari > 0:
  C_n += 1

if A_n <= C_n:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

hoge1 = ((C-1) // B) + 1
hoge2 = ((A-1) // D) + 1

if hoge1 <= hoge2:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = 'Yes'
while True:
    # 高橋くんのターン
    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())
x = 0
y = 0
while a > 0:
    a = a-d
    x += 1
while c > 0:
    c = c-b
    y += 1
if x >= y:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

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

tt = a // d + 1
if a % d ==0:
    tt -= 1

ta = c // b + 1
if c % b == 0:
    ta -= 1

if tt >= ta:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

thp = A
ahp = C
flag = 0

while flag == 0:

	ahp = ahp - B
	if ahp <= 0:
		flag = 2
		break

	thp = thp - D
	if thp <= 0:
		flag = 1
		break

if flag==1:
	print('No')
elif flag==2:
	print('Yes')

Submission status: Accepted

Solution code:
# ABC164 B

def main():
    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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a,b,c,d = map(int, input().split())
# a,b,c,d = [46, 4, 40, 5]

tCount = (c+b-1)//b
aCount = (a+d-1)//d
print('Yes' if tCount <= aCount else 'No')

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
takahashi = a
aoki = c
count_takahashi = 0
count_aoki = 0

while takahashi > 0:
    count_aoki += 1
    takahashi -= d

while aoki > 0:
    count_takahashi += 1
    aoki -= b

if count_takahashi <= count_aoki:
    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<1:
		print('Yes')
		exit()
	a=a-d
	if a<1:
		print('No')
		exit()

Submission status: Accepted

Solution code:
A,B,C,D = map(int,input().split())
i = 0
while i == 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())
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:
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))


A, B, C, D = MAP()


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())
t = 0
while C > 0:
    C -= B
    t += 1
if A - D*(t-1) <= 0:
    print('No')
else:
    print('Yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

Ta = math.ceil(C/B)
Ao = math.ceil(A/D)

if(Ao < Ta):
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:

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

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

if C < A:
    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:
    print("Yes")
    exit()
  a = a - d
  if a <= 0:
    print("No")
    exit()