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:
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
from collections import defaultdict
from heapq import heappop, heappush

from decimal import *

##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# bisect_right(lists, 3)

##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力

# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと

##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順

# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順

##### 累乗 #####
# pow(x, y, z) -> x**y % z

##### 割り算の切り上げ #####
# tmp = -(-4 // 3)

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

inf = float('inf')
mod = 1000000007

#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-

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

	ss = True
	while True:
		if A <= 0 or C <= 0:
			break

		if ss == True:
			ss = False
			C -= B
		else:
			ss = True
			A -= D

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


#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
# nCr mod m
# rがn/2に近いと非常に重くなる
def combination(n, r, mod=10**9+7):
    r = min(r, n-r)
    res = 1
    for i in range(r):
        res = res * (n - i) * modinv(i+1, mod) % mod
    return res

# mを法とするaの乗法的逆元
def modinv(a, mod=10**9+7):
    return pow(a, mod-2, mod)

def egcd(a, b):
    if a == 0:
        return b, 0, 1
    else:
        g, y, x = egcd(b % a, a)
        return g, x - (b // a) * y, y

# nHr mod m
# 問題によって、combination()を切り替えること
def H(n, r, mod=10**9+7):
	# comb = Combination(n+r-1, mod)
	# return comb(n+r-1, r)
    return combination(n+r-1, r, mod)

class Combination:
    """
    O(n)の前計算を1回行うことで，O(1)でnCr mod mを求められる
    n_max = 10**6のとき前処理は約950ms (PyPyなら約340ms, 10**7で約1800ms)
    使用例：
    comb = Combination(1000000)
    print(comb(5, 3))  # 10
    """
    def __init__(self, n_max, mod=10**9+7):
        self.mod = mod
        self.modinv = self.make_modinv_list(n_max)
        self.fac, self.facinv = self.make_factorial_list(n_max)

    def __call__(self, n, r):
        return self.fac[n] * self.facinv[r] % self.mod * self.facinv[n-r] % self.mod

    def make_factorial_list(self, n):
        # 階乗のリストと階乗のmod逆元のリストを返す O(n)
        # self.make_modinv_list()が先に実行されている必要がある
        fac = [1]
        facinv = [1]
        for i in range(1, n+1):
            fac.append(fac[i-1] * i % self.mod)
            facinv.append(facinv[i-1] * self.modinv[i] % self.mod)
        return fac, facinv

    def make_modinv_list(self, n):
        # 0からnまでのmod逆元のリストを返す O(n)
        modinv = [0] * (n+1)
        modinv[1] = 1
        for i in range(2, n+1):
            modinv[i] = self.mod - self.mod//i * modinv[self.mod%i] % self.mod
        return modinv

if __name__ == "__main__":
	main()

Submission status: Accepted

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

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:
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def S(): return input().rstrip()
def LS(): return S().split()
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float("INF")

#solve
def solve():
    a, b, c, d = LI()
    print("Yes" if (c - 1) // b + 1 <= (a - 1) // d + 1 else "No")
    return


#main
if __name__ == '__main__':
    solve()

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c,d=[int(i) for i in input().split()]
f=0
while a>0:
    c-=b
    if c<1:
        f+=1
    a-=d
print("Yes" if f>0 else "No")

Submission status: Accepted

Solution code:
hp_t, attack_t, hp_a, attack_a = map(int, input().split())
def battle(hp_t, attack_t, hp_a, attack_a, p):
    
    if p == 't':
        hp_a -= attack_t
    else:
        hp_t -= attack_a
        
    if hp_t <= 0:
        return 'No'
    elif hp_a <= 0:
        return 'Yes'
    
    return battle(hp_t, attack_t, hp_a, attack_a, 't' if p == 'a' else 'a')
print(battle(hp_t, attack_t, hp_a, attack_a, 't'))

Submission status: Accepted

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

num_t = (c-1)//b + 1
num_a = (a-1)//d + 1

if num_t <= num_a:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
for yagi in range(1,101):
  if c-b*yagi<=0:
    print("Yes")
    break
  if a-d*yagi<=0:
    print("No")
    break

Submission status: Accepted

Solution code:
import math

a, b, c, d = list(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())
x = -(-a // d)
y = -(-c // b)
if x >= y:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
import sys
import math
input = lambda: sys.stdin.readline().rstrip()
Yes = lambda boolean: print('Yes') if boolean else print('No')
ints = lambda: list(map(int, input().split()))
a,b,c,d = ints()
Yes(math.ceil(a/d)>=math.ceil(c/b))

Submission status: Accepted

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

T_time = C // B if C % B == 0 else C // B + 1
A_time = A // D if A % D == 0 else A // D + 1

if T_time <= A_time :
  print("Yes")
else :
  print("No")

Submission status: Accepted

Solution code:

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

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

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

Submission status: Accepted

Solution code:
A,B,C,D = map(int, open(0).read().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:
s=input()


a,b,c,d=map(int,s.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 = [int(x) for x in input().split()]

while True:
    c -= b
    if c  <= 0:
        ans = 'Yes'
        break
    a -= d
    if a <= 0:
        ans = 'No'
        break
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:
import math
def main(a,b,c,d):
    taka = math.ceil(a/d)
    aoki = math.ceil(c/b)
    return "Yes" if taka >= aoki else "No"

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

Submission status: Accepted

Solution code:
import math
a,b,c,d=map(int,input().split())
m=math.ceil(a/d)
n=math.ceil(c/b)
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(101):
  if c-b*i<=0:
    print("Yes")
    break
  if a-d*i<=0:
    print("No")
    break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
th, ta, ah, aa = map(int, input().split( ))
while th > 0 and ah > 0:
    ah -= ta
    #t win(Yes
    if ah <= 0:
        print("Yes")
        break
    th -= aa
    if th <= 0:
        print("No")

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

a, b, c, d = map(int, readline().split())
for i in range(10000):
    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:
a,b,c,d=map(int,input().split())
while a>0 and c>0:
  a-=d
  c-=b
  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= 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')
        exit()
    a -= d
    if a <= 0:
        print('No')
        exit()

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
ta = 0
aok = 0
while True:
    ta = c-b
    c = ta

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

Submission status: Accepted

Solution code:
A, B, C, D = [int(i) for i in input().split()]
x = (A + D - 1) // D
y = (C + B - 1) // B
print('Yes' if x >= y else 'No')

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 math
a,b,c,d=map(int, input().split())
N=math.ceil(c/b)
print(["No","Yes"][a-(N-1)*d>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
    else:
        a-=d
        if a<=0:
            print("No")
            break
        else:
            pass

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

    attack_count_A = C // B
    if C % B > 0:
        attack_count_A += 1
    
    attack_count_B = A // D
    if A % D > 0:
        attack_count_B += 1

    if attack_count_B >= attack_count_A:
        print('{}'.format('Yes'))
    else:
        print('{}'.format('No'))


if __name__ == '__main__':
    main()

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())
i = 0
while a > 0 and c > 0:
	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())
if c%b==0:
  tak = c/b
elif c/b<1:
  tak = 1
else:
  tak = c//b +1
if a%d ==0:
  ai = a/d
elif a/d<1:
  ai = 1
else:
  ai=a//d +1
if tak<=ai:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:

import math
A,B,C,D=map(int,input().split())
win=math.ceil(A/D)
lose=math.ceil(C/B)
if lose<=win:
  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
    elif a <= 0:
        print("No")
        break

Submission status: Accepted

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

import sys
sys.setrecursionlimit(300000)

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:
            ret = YES
            break
        A -= D
        if A <= 0:
            ret = NO
            break
    print(ret)
    return

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:
import sys
readline = sys.stdin.buffer.readline
def even(n): return 1 if n%2==0 else 0

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

for i in range(200):
    if even(i):
        c -= b
        if c <= 0:
            print("Yes")
            exit()
    else:
        a -= d
        if a <= 0:
            print("No")
            exit()

Submission status: Accepted

Solution code:
import math
P =  list(map(int,input().split()))
A = P[0]
B = P[1]
C = P[2]
D = P[3]

p = math.ceil(C/B)
q = math.ceil(A/D)
    

if p <= q:
    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, 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())
i = 0
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
  if c <= 0:
    break
  a -= d
if a > 0:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
a, b, c,d = map(int, input().split())
aa=a
cc=c
for i in range(a//d+1):
    cc = cc - b

    if cc<1:
      print("Yes")
      break;
    aa = aa - d

    if aa <1:
      print("No")
      break;

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
t_hp, t_at, a_hp, a_at = map(int, input().split())

while True:
    a_hp -= t_at
    if a_hp <= 0:
        print("Yes")
        exit()

    t_hp -= a_at
    if t_hp <= 0:
        print("No")
        exit()

Submission status: Accepted

Solution code:
t_x, t_y, a_x, a_y = map(int, input().split())

i = 0
while True:
    if i % 2 == 0:
        a_x -= t_y
    else:
        t_x -= a_y
    if t_x <= 0:
        print("No")
        break
    elif a_x <= 0:
        print("Yes")
        break
    i += 1

Submission status: Accepted

Solution code:
A,B,C,D=map(int,input().split())
E=A//D
F=C//B
if  E > F:
	print("Yes")
elif E == F and A%D != 0:
	print("Yes")
elif E == F and C%B == 0 and A%D == 0:
	print("Yes")
elif E+1 == F and C%B == 0 and A%D != 0:
	print("Yes")    
else:
	print("No")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from math import ceil
a,b,c,d=[int(x) for x in input().split()]
if ceil(a/d)==ceil(c/b):
    print('Yes')
elif ceil(a/d)>ceil(c/b):
    print('Yes')
elif ceil(a/d)<ceil(c/b):
    print('No')
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:
    a -= d
    if a <= 0:
      print('No')
  else:
    print('Yes')

Submission status: Accepted

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

n_1=A//D
n_2=A/D
if n_1<n_2:
    takahashi=n_1+1
else:
    takahashi=n_1

n_3=C//B
n_4=C/B
if n_3<n_4:
   aoki=n_3+1
else:
    aoki=n_3

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

Submission status: Accepted

Solution code:
t, k, c, d = (int(x) for x in input().split())
while (t >= 0 or c >= 0):
  c = c - k
  if c <= 0:
    print("Yes")
    break
  t = t - d
  if t <= 0:
    print("No")
    break

Submission status: Accepted

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

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

import math
# print(math.ceil(A / D), math.ceil(C / B))
if math.ceil(A / D) >= math.ceil(C / B):
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math

numbers = ["0"]*4
numbers = input().split(" ")
healthOfT = int(numbers[0])
strengthOfT = int(numbers[1])
healthOfA = int(numbers[2])
strengthOfA = int(numbers[3])
times_T_win = math.ceil(healthOfA/strengthOfT)
times_A_win = math.ceil(healthOfT/strengthOfA)
if times_T_win <= times_A_win:
	print("Yes")
else:
	print("No")

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
if c%b==0:
  tak = c/b
elif c/b<1:
  tak = 1
else:
  tak = c//b +1
if a%d ==0:
  ai = a/d
elif a/d<1:
  ai = 1
else:
  ai=a//d +1
if tak<=ai:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = input()
taka_hp = int(x.split()[0])
taka_attack = int(x.split()[1])
ao_hp = int(x.split()[2])
ao_attack = int(x.split()[3])

while (taka_hp > 0 and ao_hp > 0):
    ao_hp = ao_hp - taka_attack
    taka_hp = taka_hp - ao_attack
else:
    if ao_hp <= 0:
      print("Yes")
    elif taka_hp <= 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:
K = input().split(" ")
k = [int(n) for n in K]
t =k[0]//k[3]
a = k[2]//k[1]
t1 = k[0]%k[3]
a1 = k[2]%k[1]
if t1 != 0:
    t = t+1
if a1 != 0:
    a = a+1
if t>=a:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

flag = 1

while A>0 and C>0:
    if flag == 1:
        C -= B
    else:
        A -= D
    
    flag = flag * (-1)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
th,ts,oh,os=map(int,input().split())
while th>=1 and oh>=1:
  oh=oh-ts
  if oh>=1:
    th=th-os
if th>=1:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
th, tMon, ah, aMon  = map(int, input().split())
turn = 1
#1 represent takashi monster turn
#0 represent aoki monster turn
while(1):
  if(turn):
    ah-=tMon
    if(ah<=0):
      print("Yes")
      break
  else:
    th-=aMon
    if(th<=0):
      print("No")
      break
  turn^=1

Submission status: Accepted

Solution code:
import math
a,b,c,d=[int(x) for x in 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())

jumyo_t = A//D
jumyo_a = C//B
if A%D != 0:
    jumyo_t += 1
if C%B != 0:
    jumyo_a += 1

if jumyo_a > jumyo_t:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

while (A>0) and (B>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())

def attack_count(life, power):
    count = life // power
    if life % power == 0:
        return count
    else:
        return count + 1

t_lifespan = attack_count(a, d)
a_lifespan = attack_count(c, b)

if t_lifespan == a_lifespan:
    print("Yes")
elif t_lifespan > a_lifespan:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
class monster:
    stamina = 0
    attack= 0
    def __init__(self,stamina,attack):
        self.stamina = stamina
        self.attack = attack


abcd = input().split()
abcd=[int(x) for x in abcd]
a = abcd[0]
b = abcd[1]
c = abcd[2]
d = abcd[3]



taka = monster(a,b)
aoki = monster(c,d)

while(1):
    # print(taka.stamina,aoki.stamina)
    aoki.stamina = aoki.stamina-taka.attack
    if aoki.stamina<=0:
        print('Yes')
        break
    taka.stamina = taka.stamina-aoki.attack
    if taka.stamina<=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

X = list(map(int,input().split()))
Ahp = X[0]
Aat = X[1]
Bhp = X[2]
Bat = X[3]
Atm = math.ceil(Bhp/Aat)
Btm = math.ceil(Ahp/Bat)

if Atm<=Btm:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
s=list(map(int, input().split()))
import math
print("Yes" if (math.ceil(s[2]/s[1])) <= (math.ceil(s[0]/s[3])) 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:
import math
a,b,c,d = map(int,input().split())
t_n = math.ceil(c / b)
a_n = math.ceil(a / d)

if t_n <= a_n:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
e,r,t,y = [int(x) for x in input().split()]

while (e>= 0 or t >= 0):
    t = t - r
    if t<= 0:
        print('Yes')
        break
    e = e - y
    if e<= 0:
        print('No')
        break

Submission status: Accepted

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

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

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

Submission status: Accepted

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

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

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

if t_cnt > a_cnt:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
ms=[int(x) for x in input().split(' ')]
t=[ms[0],ms[1]]
a=[ms[2],ms[3]]
while True:
    a[0]-=t[1]
    if a[0]<1:
        print("Yes")
        break
    t[0]-=a[1]
    if t[0]<1:
        print('No')
        break

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin, setrecursionlimit, stdout
#setrecursionlimit(1000000)
from collections import deque
from math import sqrt, floor, ceil, log, log2, log10, pi, gcd, sin, cos, asin
def ii(): return int(stdin.readline())
def fi(): return float(stdin.readline())
def mi(): return map(int, stdin.readline().split())
def fmi(): return map(float, stdin.readline().split())
def li(): return list(mi())
def lsi():
    x=list(stdin.readline())
    x.pop()
    return x
def si(): return stdin.readline().rstrip()
#mod=1000000007
res=['Yes', 'No']
############# CODE STARTS HERE #############
a, b, c, d=mi()
f=0
if ceil(c/b)>ceil(a/d):
    f=1
print(res[f])

Submission status: Accepted

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

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())
count = 0
while(a>0 and c>0):
    count+=1
    if(count%2!=0):
        c-=b
    else:
        a-=d

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

Submission status: Accepted

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

Submission status: Accepted

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

l = c // b
if c % b !=0:
  l += 1
  
m = a // d
if a % d !=0:
  m += 1
  
if l == m:
  print("Yes")
elif l < m:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
def main():
  #n = int(input())
  #s = input()
  #s = input().split()
  a,b,c,d = list(map(int,input().split()))
  #a = [input() for i in range(n)]
  #a = [int(input()) for i in range(n)]
  #a = [input().split() for i in range(n)]
  #a = [list(map(int,input().split())) for i in range(n)]
  ans = 0
  count = 0
  lis = []
  
  while 1:
    c = c - b
    if c <= 0:
      print("Yes")
      exit()
    a = a - d
    if a <= 0:
      print("No")
      exit()
      
if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
t_hp ,t_atack ,a_hp ,a_atack = map(int, input().split())

t_death_sum = -(-t_hp // a_atack)
a_death_sum = -(-a_hp // t_atack)


if (t_death_sum < a_death_sum):
  print("No")
else :
  print("Yes")

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

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

turn_flag = True
for i in range(0, 100):
    if turn_flag:
        C -= B
        if C <= 0:
            break
        turn_flag = False
    
    else:
        A -= D
        if A <= 0:
            break
        turn_flag = True

    # print(A,B,C,D)

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

Submission status: Accepted

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