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())
x=0
y=0
x = int(-(-a//d))
y = int(-(-c//b))

if x < y :
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
#ABC164b
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:
#  =========     /\       /|    |====/|
#      |        /  \       |    |   / |
#      |       /____\      |    |  /  |
#      |      /      \     |    | /   |
#  ========= /        \  =====  |/====|  
#  code

def main():
    a,b,c,d = map(int , input().split())
    k1 = (b + c - 1) // b
    k2 = (d + a - 1) // d
    if k1 > k2:
        print('No')
    else:
        print('Yes')
    return

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
monstor_param = input().split()

takahashi_hp = int(monstor_param[0])
takahashi_ap = int(monstor_param[1])
aoki_hp = int(monstor_param[2])
aoki_ap = int(monstor_param[3])

result = "No"

while takahashi_hp >= 0 or aoki_hp >= 0:
    aoki_hp = aoki_hp - takahashi_ap
    if aoki_hp <= 0:
        result = "Yes"
        break
    else:
        takahashi_hp = takahashi_hp - aoki_ap
        if takahashi_hp <= 0:
            break

print(result)

Submission status: Accepted

Solution code:
a, b, c, d = (int(a) for a in 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  = 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:
import sys
A, B, C, D = map(int, input().split())

while A > 0:
  C -= B
  if(C <= 0):
    print('Yes')
    sys.exit()
  else:
    A -= D

print('No')

Submission status: Accepted

Solution code:
### ----------------
### ここから
### ----------------

import sys
from io import StringIO
import unittest

def yn(b):
    print("Yes" if b==1 else "No")
    return

def resolve():
    readline=sys.stdin.readline

    a,b,c,d=map(int, readline().rstrip().split())
    tHP=a
    tATC=b
    aHP=c
    aATC=d
    while 1:
        aHP-=tATC
        if aHP<=0:
            print("Yes")
            return
        tHP-=aATC
        if tHP<=0:
            print("No")
            return
    return

if 'doTest' not in globals():
    resolve()
    sys.exit()

### ----------------
### ここまで 
### ----------------

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
while c > 0:
    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())
x=(a//d)+1 if a%d!=0 else a//d
y=(c//b)+1 if c%b!=0 else c//b
print("Yes" if x>=y else "No")

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 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())
print('Yes' if (c-1)//b+1<=(a-1)//d+1 else '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:
A, B, C, D = [int(_) for _ in 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())

if math.ceil(C / B) > math.ceil(A / D):
    print('No')
else:
    print('Yes')

Submission status: Accepted

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

Submission status: Accepted

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

turn = True

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

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

Submission status: Accepted

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

while True:
    C -= B
    if C <= 0:
        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 A and C > 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())
n=1
while c-n*b>0 and a-n*d>0:
  n+=1
print('Yes' if c-n*b<=0 else 'No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
tl, ta, al, aa = map(int, input().split(" "))
print("Yes" if math.ceil(al/ta) - 1 < math.ceil(tl / aa) else "No")

Submission status: Accepted

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

def main():
    A,B,C,D = map(int,input().split())
    takahashi_num = int(C/B) if C%B==0 else int(C/B)+1
    aoki_num = int(A/D) if A%D==0 else int(A/D)+1
    print("Yes" if takahashi_num<=aoki_num else "No")

main()

Submission status: Accepted

Solution code:
A, B, C, D = [int(_) for _ in 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 = [int(_) for _ in input().split()]
if C//B + int(bool(C%B)) <= A//D + int(bool(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<1:
		print("Yes")
		break
	a -= d
	if a<1:
		print("No")
		break

Submission status: Accepted

Solution code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
mod2 = 998244353
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)


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

    return -1


print(main())

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

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

a = math.ceil(a/d)
b = math.ceil(c/b)
if a<b:
  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:

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

#print(A, B, C, D)

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

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

Submission status: Accepted

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

TyokudaiWin = True

for i in range(100):
    c -= b
    if c <= 0:
        break
    a -= d
    if a <= 0:
        TyokudaiWin = False
        break

if TyokudaiWin:
    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")
    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)&(c>0):
    c-=b
    a-=d

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

Submission status: Accepted

Solution code:
inp_ls = input().split(" ")
a,b,c,d = [int(e) for e in inp_ls[:4]]

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

def count(hp, attack):
    return hp // attack + (0 if hp % attack == 0 else 1)

def solve(A: int, B: int, C: int, D: int):
    print( "Yes" if count(C, B) <= count(A, D) else "No")
    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:
import sys
sys.setrecursionlimit(10 ** 6)
# input = sys.stdin.readline    ####
int1 = lambda x: int(x) - 1
def II(): return int(input())

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

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

INF = float('inf')

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

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


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-

import sys
sys.setrecursionlimit(10**7)
from pprint import pprint as pp
from pprint import pformat as pf

import math
#from sortedcontainers import SortedList, SortedDict, SortedSet # no in atcoder
import bisect

class Monster:
    def __init__(self, hp, atk):
        self.hp = hp
        self.atk = atk

    def __repr__(self):
        return "hp {} atk {}".format(self.hp, self.atk)

    def atack(self, opponent):
        opponent.hp -= self.atk
        if opponent.hp <= 0:
            return True
        else:
            return False

def battle(x, y):
    while True:
        #print('x') # debug
        #print(x) # debug
        #print('y') # debug
        #print(y) # debug
        if x.atack(y):
            return True
        #print('x') # debug
        #print(x) # debug
        #print('y') # debug
        #print(y) # debug
        if y.atack(x):
            return False

if __name__ == '__main__':
    a, b, c, d = list(map(int, input().split()))
    takahashi = Monster(a, b)
    aoki = Monster(c, d)
    if battle(takahashi, aoki):
        print("Yes")
    else:
        print("No")


    #print('\33[32m' + 'end' + '\033[0m') # debug

Submission status: Accepted

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

turn = 0
state = [[a, b], [c, d]]

while state[0][0] > 0 and state[1][0] > 0:
    opp = 1 - turn
    state[opp][0] = state[opp][0] - state[turn][1]
    turn = opp

if state[0][0] <= 0:
    print("No")
else:
    print("Yes")

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

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')
			exit(0)
	else:
		A -= D
		if A <= 0:
			print('No')
			exit(0)
	i += 1

Submission status: Accepted

Solution code:
taka_f,taka_p,aoki_f,aoki_p = map(int,input().split())
taka_life_span = -(-taka_f//aoki_p)
aoki_life_span = -(-aoki_f//taka_p)
print("Yes" if taka_life_span >= aoki_life_span else "No")

Submission status: Accepted

Solution code:
t_hp, t_atk, a_hp, a_atk = map(int, input().split())
t_life_span = -(-t_hp//a_atk)
a_life_span = -(-a_hp//t_atk)
#print(t_life_span,a_life_span)
print("Yes" if t_life_span >= a_life_span else "No")

Submission status: Accepted

Solution code:
taka_f,taka_p,aoki_f,aoki_p = map(int,input().split())

while True:
    aoki_f -= taka_p
    if  aoki_f < 1:
        print("Yes")
        exit()
    taka_f -= aoki_p
    if taka_f < 1:
        print("No")
        exit()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
print('Yes' if (a+d-1)//d >= (c+b-1)//b else '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:
mon = list(map(int,input().split()))

while mon[0] > 0:
        mon[2] = mon[2] - mon[1]
        if (mon[2] <= 0):
                print ("Yes")
                break
        else:
                mon[0] = mon[0] - mon[3]
                if (mon[0] <= 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')
        exit()
    A=A-D
    if(A<=0):
        print('No')
        exit()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
for i in range(10**3):
    if i % 2 == 0:
        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())

for _ in range(10000):
  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(i) for i in input().split(" ")]
attack_round_a = c // b if c % b == 0 else c // b + 1
attack_round_b = a // d if a % d == 0 else a // d + 1
print('Yes' if attack_round_a <= attack_round_b else 'No')

Submission status: Accepted

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

tairyoku1 = n[0]
tairyoku2 = n[2]

while True:
    tairyoku2 = tairyoku2 - n[1]
    if tairyoku2 <= 0:
        print("Yes")
        exit()
    tairyoku1 = tairyoku1 - n[3]
    if tairyoku1 <= 0:
        print("No")
        exit()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A,B,C,D=map(int,input().split())
taka=[A,B]
ao=[C,D]
import sys
while True:
    ao[0]-=taka[1]
    if ao[0]<=0:
        print('Yes')
        sys.exit()
    taka[0]-=ao[1]
    if taka[0]<=0:
        print('No')
        sys.exit()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

win = False
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 = 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=(int(x) for x in input().split())
while a>0 and c>0:
  c=c-b
  a=a-d
  if c<=0:
    print('Yes')
  else:
    if a<=0:
      print('No')

Submission status: Accepted

Solution code:
a, b, c, d = map(int, 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:
    if C > 0 and A > 0:
        C -= B
        if C > 0 and A > 0:
            A -= D
        elif C <= 0:
            print('Yes')
            break
    else:
        print('No')
        break

Submission status: Accepted

Solution code:
a, b, c, d = map(int,input().split())
#atk hp atk hp
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:
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("No")
elif c<=0 and a>0: 
  print("Yes")
elif a<=0 and c<=0:
  print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A_HP, A_ATK, B_HP, B_ATK = map(int, input().split())

f = False
while A_HP > 0 and B_HP > 0:
  # First
  B_HP -= A_ATK

  if B_HP <= 0:
    f = True
    break

  # Second
  A_HP -= B_ATK

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

Submission status: Accepted

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

if A % D == 0:
    aoki_turn = A // D
else:
    aoki_turn = A // D + 1

if C % B == 0:
    taka_turn = C // B
else:
    taka_turn = C // B + 1

if taka_turn <= aoki_turn:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a, b, c, d = map(int, input().split())
e = -(-c//b)
f = -(-a//d)
if e <= f:
  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:
tkhp, tkat, aohp, aoat = list(map(int, input().split()))

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

    tkhp = tkhp - aoat
    if tkhp <= 0:
        print('No')
        break

Submission status: Accepted

Solution code:
def main():
    abcd = list(map(int, input().split()))
    aok = (abcd[2]-1) // abcd[1]
    tac = (abcd[0]-1) // abcd[3]
    print('Yes' if tac >= aok else 'No')

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# -*- coding: utf-8 -*-
import math


def main():
  A, B, C, D = map(int, input().split())
  a = math.ceil(C / B)
  b = math.ceil(A / D)

  if b < a:
    print('No')
  else:
    print('Yes')


if __name__ == '__main__':
  main()

Submission status: Accepted

Solution code:
# Takahashi: A:HP, B:AP
# Aoki: C:HP, D:AP
A, B, C, D = map(int, input().split())

HP = [A, C]
AP = [B, D]

attack_turn = 0
defence_turn = 1

while(min(HP) > 0):
    HP[defence_turn] -= AP[attack_turn]    
    attack_turn = (attack_turn + 1)%2
    defence_turn = (defence_turn + 1)%2

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

Submission status: Accepted

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

while True:
    c -= b
    if c <= 0:
        print('Yes')
        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("No")
else:
  print("Yes")

Submission status: Accepted

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

ans = "Yes"
turn = "Takahashi"

while True:
  if turn == "Takahashi":
    C -= B
    if C<=0:
      ans = "Yes"
      break
    turn = "Aoki"
  else:
    A -= D
    if A<=0:
      ans = "No"
      break
    turn = "Takahashi"

print(ans)

Submission status: Accepted

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

ss = a / d
ss1 = c / b

n = min(ss, ss1)

for _ in range(int(n) + 1):
  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())
if ((c-1)//b) <= ((a-1)//d):
 print("Yes")
else:
 print("No")

Submission status: Accepted

Solution code:
A_ini, B, C_ini, D = map(int, input().split())
# print(A_ini)
# print(B)
# print(C_ini)
# print(D)
# print()

# print('main')
# print()

C_rem = C_ini - B
A_rem = A_ini - D
# print(C_rem)
# print(A_rem)

if C_rem <= 0 and A_rem > 0:
  print('Yes')
elif C_rem <= 0 and A_rem <= 0:
  print('Yes')
elif C_rem > 0 and A_rem <= 0:
  print('No')
else:
  while C_rem > 0 and A_rem > 0 :
    C_rem = C_rem - B
    # print(C_rem)
    if C_rem <= 0:
      print('Yes')
      break
    A_rem = A_rem - D
    if A_rem <= 0:
      print('No')
      break

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from __future__ import division, print_function
import sys
if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip

import os, sys, bisect, copy
from collections import defaultdict, Counter, deque
#from functools import lru_cache   #use @lru_cache(None)
if os.path.exists('in.txt'): sys.stdin=open('in.txt','r')
if os.path.exists('out.txt'): sys.stdout=open('out.txt', 'w')
#
def input(): return sys.stdin.readline()
def mapi(arg=0): return map(int if arg==0 else str,input().split())
#------------------------------------------------------------------

a,b,c,d = mapi()
#print((a+d-1)//d,(c+b-1)//b)
if (a+d-1)//d>=(c+b-1)//b:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

for _ in range(10000):
  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())

num1 = (a-1)//d
num2 = (c-1)//b

print('Yes' if num1>=num2 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:
A,B,C,D=list(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())
while True:
  C=C-B
  if C<=0:
    print("Yes")
    break
  A=A-D
  if A<=0:
    print("No")
    break

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:
a,b,c,d=map(int,input().split())
T=c//b + (c%b!=0)
A=a//d + (a%d!=0)
print("Yes" if T<=A else "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:
# 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)

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

Submission status: Accepted

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

Submission status: Accepted

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

if cc < aa+1:
  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")
    exit()
  a -= d
  if a <= 0:
    print("No")
    exit()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC 164
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 = [int(i) for i in 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())
print("No" if (A - 1) // D < (C - 1) // B else "Yes")

Submission status: Accepted

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

Submission status: Accepted

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