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())
cnt = 0
while True:
    if cnt % 2 == 0:
        C -= B
    else:
        A -= D
    if C <= 0:
        print("Yes")
        break
    elif A <= 0:
        print("No")
        break
    cnt += 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:
        break
    a -= d

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

Submission status: Accepted

Solution code:
import math
import collections


def main():
    a, b, c, d = input_list()
    while True:
        c -= b
        if c <= 0:
            print('Yes')
            exit(0)
        a -= d
        if a <= 0:
            print('No')
            exit(0)


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


def combinations_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

t = C // B if not C % B else C // B + 1
a = A // D if not A % D else A // D + 1

if t > a:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
l = input().split()
th = int(l[0])
ta = int(l[1])
ah = int(l[2])
aa = int(l[3])
win = False

while True:
	ah -= ta
	if ah <= 0:
		win = True
		break
	th -= aa
	if th <= 0:
		break

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

Submission status: Accepted

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

a, b, c, d = map(int, input().replace("\n","").split())

takahashihp = a
aokihp = c

while True:
    aokihp -= b
    if aokihp < 1:
        print("Yes")
        break
    takahashihp -= d
    if takahashihp < 1:
        print("No")
        break

Submission status: Accepted

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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

from math import ceil

def check(A,B,C,D):
    if ceil(C/B)<=ceil(A/D):
        return True
    return False
if check(A,B,C,D):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
for i in range(10**4):
    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())
import math
x=math.ceil(c/b)
y=math.ceil(a/d)
if x<=y:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import collections
import sys
import numpy as np
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
MOD = 10**9+7
import itertools
import math

a,b,c,d = map(int,input().split())
i = 0
cnt1 = 0
while True:
    if a<=0:
        break
    cnt1+=1
    a -= d
cnt2 = 0
while True:
    if c<=0:
        break
    cnt2+=1
    c -= b
if cnt1<cnt2:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
A,B,C,D=[int(x) for x in input().rstrip().split()]
import sys
#体力A,C、攻撃B,D
flag=1
while(flag==1):
  if C!=0:
    C-=B
    if C<=0:
      print("Yes")
      sys.exit()

  if A!=0:
    A-=D
    if A<=0:
      print("No")
      sys.exit()

Submission status: Accepted

Solution code:
s=input().rstrip().split(' ')
th=int(s[0])
tss=int(s[1])
ah=int(s[2])
ass=int(s[3])
I=0;
while(1):
    if ah>0 and th>0:
        if I%2==0:
            I+=1;
            ah-=tss;
        else:
            th-=ass
            I+=1;
    else:
        break;
if I%2==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())
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, sys.stdin.readline().split())
T = 0
O = 0
while C > 0:
    C = C - B
    T += 1

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

if T <= O:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

turn = 0
while a > 0 and c > 0:
    if turn == 0:
        c -= b
    else:
        a -= d
    turn = (turn + 1) % 2

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

Submission status: Accepted

Solution code:
import math
T_hp, T_att, A_hp, A_att = map(int, input().split())

T_tae = math.ceil(T_hp/A_att)

A_tae = math.ceil(A_hp/T_att)

if T_tae >= A_tae: print("Yes")
else: print("No")

Submission status: Accepted

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

abc164_b()

Submission status: Accepted

Solution code:
a_HP, a_AT, b_HP, b_AT = map(int, input().split())

while True:
    b_HP -= a_AT
    if b_HP <= 0:
        print('Yes')
        break
    
    a_HP -= b_AT
    if a_HP <= 0:
        print('No')
        break

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

Submission status: Accepted

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

    while True:
        a_hp -= t_atk
        if a_hp <= 0:
            print('Yes')
            return
        
        t_hp -= a_atk
        if t_hp <= 0:
            print('No')
            return
        

q2()

Submission status: Accepted

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


def log(*args):
    print(*args, file=sys.stderr)


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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from sys import setrecursionlimit, exit
setrecursionlimit(1000000000)

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

main()

Submission status: Accepted

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

for i in range(100):
    C -= B
    if C <= 0:
        print('Yes')
        break
    A -= D
    if A <= 0:
        print('No')
        break

Submission status: Accepted

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

takahashi_win=True
while True:
    c-=b
    if c<=0:
        takahashi_win=True
        break
    a-=d
    if a<=0:
        takahashi_win=False
        break


if takahashi_win:
    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:
#!/usr/bin/env python3

MOD = 10**9
def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)
    return divisors

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

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

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

if t > a: print('No')
else: print('Yes')

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

Solution code:
from sys import stdin

[A, B, C, D]  = map(int, stdin.readline().rstrip().split())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

while(1):
    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=list(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:
import sys
import math
from collections import deque
input = lambda: sys.stdin.readline().rstrip()
Yes = lambda boolean: print('Yes') if boolean else print('No')
YES = lambda boolean: print('YES') if boolean else print('NO')
aint = lambda: int(input())
ints = lambda: list(map(int, input().split()))
is_even = lambda x: True if x%2==0 else False
 
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())
for i in range(100000):
    a = a - d
    c = c - b
    if c <= 0:
        print("Yes")
        exit()
    elif a <= 0:
        print("No")
        exit()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from math import ceil

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

if ceil(c/b) <= ceil(a/d):
    print('Yes')

else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A,B,C,D=[int(i) for i in input().split()]
n = 1
while True:
    if n:
        C -= B
        if C < 1:
            print("Yes")
            exit()
    else:
        A-=D
        if A < 1:
            print("No")
            exit()
    n ^= 1

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
while(A > 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())
taka=0
ao=0
while a>0:
  a-=d
  taka+=1
while c>0:
  c-=b
  ao+=1
if taka>=ao:
  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 = 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())
taka=True
while a>0 and c>0:
    if taka:
        c-=b
    else:
        a-=d
    taka = not taka
if taka:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
A, B, C, D = [int(str) for str in input().strip().split()]

print('Yes' if (C - 1) // B <= (A - 1) // D 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:
A, B, C, D = [int(i) for i in input().split()]
nT = (C + B - 1) // B 
nA = (A + D - 1)// D
if nT <= nA:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
ins = lambda : input().strip()
DBG = True # and False
BIG = 10**18
R = 10**9 + 7

def ddprint(x):
  if DBG:
    print(x)

a,b,c,d = inm()
for i in range(101):
    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())

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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:


def solve():

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

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


if __name__ == "__main__":
    solve()

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
#a = int(input())
a,b,c,d = map(int,input().split())
#a = [int(i) for i in input().split()]

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

Submission status: Accepted

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

takahashi = (c+b-1)//b
aoki = (a+d-1)//d

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

Submission status: Accepted

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


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


def main():
    A, B, C, D = inpl()
    takahashi = (C + B - 1) // B
    aoki = (A + D - 1) // D

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# Your code here!
import math
A,B,C,D = list(map(int,input().split()))

if A-(math.ceil(C/B) -1)*D >0:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def read_int():
    return int(input())

def read_int_map():
    return map(int,input().split(' '))

def read_int_list():
    return list(map(int,input().split(' ')))
import math

A,B,C,D = read_int_map()
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())

turn = 1
while True:
    if turn == 1:
        C -= B
        if C <= 0:
            print("Yes")
            exit()
    else:
        A -= D
        if A <= 0:
            print("No")
            exit()
    turn *= -1

Submission status: Accepted

Solution code:
import sys
import numpy as np
a, b, c, d = map(int, sys.stdin.readline().strip().split())

attack_t = np.ceil(c / b)
attack_a = np.ceil(a / d)

if attack_t <= attack_a:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
def main():
    A, B, C, D = map(int, input().split())
    ans = "Yes"
    while A > 0 or C > 0:
        C -= B
        if C <= 0:
            break
        A -= D
        if A <= 0:
            ans = "No"
            break
    print(ans)
if __name__ == "__main__":
    main()

Submission status: Accepted

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

t = 0

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

Submission status: Accepted

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

hp_t=a
hp_a=c

while hp_a>0 and hp_t>0:
    hp_a=hp_a - b
    if hp_a<=0:
        print("Yes")
        break
    hp_t=hp_t - d
    if hp_t<=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:
import sys
# sys.stdin = open('input.txt')

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:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)


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


main()

Submission status: Accepted

Solution code:
import math
from collections import defaultdict
ml=lambda:map(int,input().split())
ll=lambda:list(map(int,input().split()))
ii=lambda:int(input())
ip=lambda:(input())

"""========main code==============="""

a,b,c,d=ml()
i=0
while(a>0 and c>0):
    if(i%2==0):
        c-=b
    else:
        a-=d
    i+=1    
if(a<=0):
    print("No")
elif c<=0:
    print("Yes")

Submission status: Accepted

Solution code:
import math

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

t_cnt = math.ceil(C / B)
a_cnt = math.ceil(A / D)

print('Yes' if t_cnt <= a_cnt else 'No')

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    from sys import stdin
    input = stdin.readline

    a, b, c, d = map(int, input().split())
    w = (a-1)//d
    s = (c-1)//b
    if s <= w:
        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
    else:
        A -= D
        if A <= 0:
            print('No')
            break

Submission status: Accepted

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

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

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

if taka_kougeki <= ao_kougeki:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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


takahasi_times = -(-c // b)
aoki_times = -(-a // d)

if takahasi_times <= aoki_times:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

if c%b:
    aoki = c//b + 1
else:
    aoki = c//b

if a%d:
    ta = a//d + 1
else:
    ta = a//d

if aoki > ta:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:

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

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

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

Submission status: Accepted

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

taka=(c+b-1)//b
ao=(a+d-1)//d

print("Yes" if taka<=ao 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:
        break
    A -= D

print('YNeos'[A<C::2])

Submission status: Accepted

Solution code:
A,B,C,D=[int(i) for i in input().split()]
aokiAttack=A//D+(A%D>0)
takahashiAttack=C//B+(C%B>0)

print("Yes" if takahashiAttack<=aokiAttack else "No")

Submission status: Accepted

Solution code:
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

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

        a -= d
        if a <= 0:
            print('No')
            exit()


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

a_hp = (a // d) + 1 if a%d!=0 else a//d
c_hp = (c // b) + 1 if c%b!=0 else c//b

if a_hp >= c_hp:
    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
    else:
        A -= D
        if A <= 0:
            print("No")
            break

Submission status: Accepted

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

takahashi = (C+B-1)//B
aoki      = (A+D-1)//D
if takahashi <= aoki:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

import sys


def answer(A,B,C,D):
    flag = True
    while True:
        if(flag):
            C -= B
            if(C <= 0):
                return "Yes"
            else:
                flag = False
        else:
            A -= D
            if(A <= 0):
                return "No"
            else:
                flag = True


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

if __name__ == '__main__':
   main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

while True:
    c -= b
    if c<=0:
        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 True:
    C -= B
    if C <= 0:
        print("Yes")
        sys.exit()
    A -= D
    if A <= 0:
        print("No")
        sys.exit()

Submission status: Accepted

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

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

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

Submission status: Accepted

Solution code:

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

    takahashi_win = False

    while takahashi_hp >= 0 and aoki_hp >= 0:
        aoki_hp -= takahashi_at
        if aoki_hp <= 0:
            takahashi_win = True
            break
        takahashi_hp -= aoki_at
        if takahashi_hp <= 0:
            takahashi_win = False
            break

    print("Yes" if takahashi_win else "No")

if __name__ == '__main__':
    main()

Submission status: Accepted

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

def LI(): return list(map(int, stdin.readline().split()))
def LS(): return list(stdin.readline())

a,b,c,d = LI()
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
  a -= d

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

Submission status: Accepted

Solution code:
# a, b 体力と攻撃
# c, d 体力と攻撃

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

count_t = -(-c // b)
count_a = -(-a // d)

if count_t <= count_a:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

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

YES = "Yes" 
NO = "No" 

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c,d = map(int, input().split())
while True:
	c -= b
	if c <= 0: 
		print("Yes")
		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 = list(map(int,input().split()))
th = a[0]
ta = a[1]
ah = a[2]
aa = a[3]
res = ''
while th>0 or ah>0:
    ah -= ta
    if ah<=0:
        res = 'Yes'
        break
    else:
        th -= aa
    if th<=0:
        res = 'No'
        break
print(res)

Submission status: Accepted

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

def RD(): return sys.stdin.read()
def II(): return int(input())
def MI(): return map(int,input().split())
def LI(): return list(map(int,input().split()))
def TI(): return tuple(map(int,input().split()))


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

    while True:
        C = C-B
        if C <= 0:
            print("Yes")
            break
        A = A - D
        if A <= 0:
            print("No")
            break
    """
    if w>=s:
        print("unsafe")
    else:
        print("safe")
        """




if __name__ == "__main__":
	main()