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:
TH,TB,AH,AB = map(int, input().split())

while True:
  AH=AH-TB
  if AH<=0:
    print("Yes")
    break
  TH=TH-AB
  if TH<=0:
    print("No")
    break

Submission status: Accepted

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

if -(-C//B) > -(-A//D):
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
t_hp, t_ap, a_hp, a_ap=(int(x) for x in input().split())
while(t_hp > 0):
  a_hp = a_hp - t_ap
  if a_hp < 1:
    print("Yes")
    break
  t_hp = t_hp - a_ap
if t_hp < 1:
  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())

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

Submission status: Accepted

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

taka = (int(c/b)) + (1 if c%b != 0 else 0)
aoki = (int(a/d)) + (1 if a%d != 0 else 0)

if taka <= aoki:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

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

print(ans)

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


def solve():
    t_stamina, t_attack, a_stamina, a_attack = map(int, input().split())
    t_num_attack_to_be_beaten = - (-t_stamina // a_attack)
    a_num_attack_to_be_beaten = - (-a_stamina // t_attack)

    if t_num_attack_to_be_beaten >= a_num_attack_to_be_beaten:
        return 'Yes'
    else:
        return 'No'


if __name__ == '__main__':
    answer = solve()
    print(answer)

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())
t = C//B
a = A//D
if C%B > 0:
    t += 1
if A%D > 0:
    a += 1

if t <= a:
    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:
        flag = True
        break
    a -= d
    if a <= 0:
        flag = False
        break
if flag:
    print("Yes")
else:
    print("No")

# a_turn = a / d
# b_turn = c / b

# if a_turn % 1 == 0:
#     a_turn = a // b
# else:
#     a_turn = (a//b) + 1

# if b_turn % 1 == 0:
#     b_turn = c // b
# else:
#     b_turn = (c // b) + 1

# if a_turn == b_turn:
#     print("Yes")
# else:
#     if a_turn > b_turn:
#         print("Yes")
#     else:
#         print("No")

Submission status: Accepted

Solution code:
a,b,c,d = map(int, input().split())
print(["No","Yes"][a//d + (a%d > 0) >= c//b + (c%b > 0)])

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
counter = 1
while A > 0 and C > 0:
    if counter % 2 == 1:
        '''T 攻击'''
        C -= B
    elif counter % 2 == 0:
        A -= D
    counter += 1
if A <= 0:
    print('No')
else:
    print('Yes')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding:utf-8
import math

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

at1 = math.ceil(c / b)
at2 = math.ceil(a / d)

if at1 <= at2:
    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("No")
elif f<e:
    print("Yes")
else:
    print("Yes")

Submission status: Accepted

Solution code:
import math

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

taka = math.ceil(c / b)
aoki = math.ceil(a / d)

ans = "No"
if taka <= aoki:
    ans = "Yes"
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

t = a // d
if a % d:
    t = a // d + 1

s = c // b 
if c % b:
    s = c // b + 1

if t >= s:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

T_hp = a
A_hp = c
for _ in range(100):
    A_hp -= b
    if A_hp <= 0:
        print('Yes')
        exit()
    T_hp -= d
    if T_hp <= 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):
    a -= d
print("Yes" if (a > 0) else "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
  
if A <= 0:
  print("No")
if C <= 0:
  print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

mod_a, q_a = divmod(a, d)
if (q_a == 0):
  aoki = mod_a
else:
  aoki = mod_a + 1

mod_t, q_t = divmod(c, b)
if (q_t == 0):
  takahashi = mod_t
else:
  takahashi = mod_t + 1

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# モジュールのインポート
import math

# 標準入力の取得
A,B,C,D = list(map(int, input().split()))

# 求解処理
takahashi_attack_count = math.ceil(C / B)
aoki_attack_count = math.ceil(A / D)
result = ""
if takahashi_attack_count <= aoki_attack_count:
    result = "Yes"
else:
    result = "No"

# 結果出力
print(result)

Submission status: Accepted

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

if c%b != 0:
    taka = c//b + 1
else:
    taka = c//b

if a%d != 0:
    ao = a//d + 1
else:
    ao = a//d

if taka > ao:
    print('No')
else:
    print('Yes')

Submission status: Accepted

Solution code:
import math
abcd = input().split()

a = float(abcd[0])
b = float(abcd[1])
c = float(abcd[2])
d = float(abcd[3])

t = math.ceil(a/d)
a = math.ceil(c/b)

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

Submission status: Accepted

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

acount=0
ccount=0

while 0<a:
    acount+=1
    a-=d


while 0<c:
    ccount+=1
    c-=b

#print(acount,ccount)

if acount<ccount:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
def func():
    return

# n = int(input())
# s = input()
a, b, c, d = map(int, input().split())
# a = list(map(int, input().split()))
# a = 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 > 0 and c > 0:
    c -= b
    if c <= 0:
        break
    a -= d
    if d <= 0:
        break

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

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 = C - B
    else:
        A = A- D
    i += 1

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

Submission status: Accepted

Solution code:
inp = input()
inlist = inp.split()

tD = int(inlist[0])
tA = int(inlist[1])
aD = int(inlist[2])
aA = int(inlist[3])

tlife = tD
alife = aD

while(True):
  alife -= tA
  if( alife <= 0):
    print("Yes")
    break
  
  tlife -= aA
  if( tlife <= 0):
    print("No")
    break

Submission status: Accepted

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

if tak>=aok:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
h1, s1, h2, s2 = map(int, input().split())
while(True):
  h2 -= s1
  if(h2 <= 0):	
    print('Yes')
    break
  h1 -= s2
  if(h1 <= 0):
    print('No')
    break

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
@author: H_Hoshigi
"""
def main():
    import math
    A, B, C, D = map(int, input().split())
    answer = ""
    atack_no_takahashi = math.ceil(C/B)
    atack_no_aoki = math.ceil(A/D)
    if atack_no_takahashi <= atack_no_aoki:
        answer = "Yes"
    else:
        answer = "No"
    print(answer)

if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A, B, C, D = map(int, input().split())
An=A
Cn=C
Ai=0
Ci=0
while An>0:
    An=An-D
    Ai+=1
while Cn>0:
    Cn=Cn-B
    Ci+=1
print("Yes" if Ai>=Ci else "No")

Submission status: Accepted

Solution code:
#ABC 164B

a, b, c, d = list(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:
def abc(A, B, C, D):
    # 答えの準備
    ans = 'No'
    
    # 比較
    while True:
        C -= B
        if C <= 0:
            ans = 'Yes'
            break
        A -= D
        if A <= 0:
            break
    
    # 答え
    return(ans)


# バッチスタート
if __name__ == "__main__":
    # 標準入力処理
    # 1行目の入力を空白で分割された4つの数値として扱う
    A, B, C, D = map(int, input().split())
    
    # 関数呼び出し
    f = abc(A, B, C, D)
    
    # 答えの出力
    print(f)

Submission status: Accepted

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

number_of_turns_takahsi = math.ceil(C / B)
number_of_turns_aoki = math.ceil(A / D)
# print(number_of_turns_takahsi, number_of_turns_aoki)

answer = 'Yes' if number_of_turns_takahsi <= number_of_turns_aoki else 'No'

print(answer)

Submission status: Accepted

Solution code:
inputs = str(input())
A = int(inputs.split()[0])
B = int(inputs.split()[1])
C = int(inputs.split()[2])
D = int(inputs.split()[3])


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

print(text)

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:
A, B, C, D = [int(n) for n in input().split()]
while True:
    C -= B
    if C<=0:
        break
    A -= D
    if A<=0:
        break
print('Yes' if A>C 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:
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 = 0
while a > 0 and c > 0:
    if turn % 2 == 0:
        c -= b
    else:
        a -= d
    turn += 1

print("Yes" if a > c else "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:
import math

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

Submission status: Accepted

Solution code:
A,B,C,D=map(int,input().split())
for x in range(102):
    C=C-B
    A=A-D
    if C<=0:
        print('Yes')
        break
    elif A<=0:
        print('No')
        break

Submission status: Accepted

Solution code:
from math import ceil
f=0
    # n=int(input())
    # a=list(map(int,input().split()))
    # c,d=map(int,input().split())
    
a,b,c,d=map(int,input().split())
x=ceil(c/b)
y=ceil(a/d)
if(x<=y):
    f=1


print("Yes" if f==1 else "No")

Submission status: Accepted

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

for count in range(0,1000):
    C = C-B
    if C <=0:
        wflag = True;
        break;
    A = A-D
    if A <=0:
        break;

if wflag == True:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
  a, b, c, d = tuple([int(e) for e in input().split()])

  s = [b, d]
  h = [c, a]
  idx = 0
  while h[0] > 0 and h[1] > 0:
    h[idx] -= s[idx]
    idx ^= 1
  
  if h[1] > 0:
    print('Yes')
  else:
    print('No')
  return 0

main()

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 -= B
  if(C <= 0):
    print('Yes')
    break
  A -= D
  if(A <= 0):
    print('No')
    break

Submission status: Accepted

Solution code:
hp, atk, ehp, eatk = map(int, input().strip().split())

while True:
    ehp -= atk
    if ehp <= 0:
        print('Yes')
        break
    hp -= eatk
    if hp <= 0:
        print('No')
        break

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

Submission status: Accepted

Solution code:
from math import ceil

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

print('Yes' if ceil(C / B) <= ceil(A / D) else 'No')

Submission status: Accepted

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

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-=B
  if C<=0:
    print('Yes')
    break
  A-=D
  if A<=0:
    print('No')
    break

Submission status: Accepted

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

while True:
    a[2] -= a[1]
    if a[2]<= 0:
        print("Yes")
        break
    a[0] -= a[3]
    if a[0]<=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 = map(int, input().split())
takahashi = a // d 
aoki = c // b

if a % d != 0:
    takahashi += 1
if c % b != 0:
    aoki += 1
    
if takahashi < aoki:
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

for i in range(1, 10000):
    c1=c-b*i
    if (c1 <= 0):
        print ('Yes')
        sys.exit()
    a1=a-d*i
    if (a1 <= 0):
        print ('No')
        sys.exit()

Submission status: Accepted

Solution code:
import math
a, b, c, d =map(int, input().split())
ans1 = math.ceil(a / d)
#青木君の攻撃回数
ans2 = math.ceil(c / b)
#高橋君の攻撃回数
if ans2 <= ans1:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

x=0
if c%b!=0:
    x=c//b+1
else:
    x=c//b

y=0
if a%d!=0:
    y=a//d+1
else:
    y=a//d

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

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:
import sys

lines = 1
inp = list()

for _ in range(lines):
    inp.append(sys.stdin.readline().strip())


line = inp[0].split()

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

t_life = a
a_life = c

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

Submission status: Accepted

Solution code:
def resolve():
    A, B, C, D = map(int, input().split())
    TA = C // B if C % B == 0 else C // B + 1
    AA = A // D if A % D == 0 else A // D + 1
    if TA > AA:
        print('No')
    else:
        print('Yes')

if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
import math

stMap = map(int, input().split())
st = list(stMap)

if (math.ceil(st[0] / st[3]) >= math.ceil(st[2] / st[1])):
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

result = ''
while True:
  C -= B

  if (C <= 0):
    result = 'Yes'
    break
  
  A -= D
  if (A <= 0):
    result = 'No'
    break

print(result)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import math
A, B, C, D = map(int, input().split())
print("Yes" if math.ceil(C / B) <= math.ceil(A / D) else "No")

Submission status: Accepted

Solution code:
a,b,c,d = map(int,input().split())
for i in range(1000):
    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:
n = input().split(" ")
a = int(n[0])
b = int(n[1])
c = int(n[2])
d = int(n[3])
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:
import sys
import math
def i():return int(sys.stdin.readline().replace("\n",""))
def i2():return map(int,sys.stdin.readline().replace("\n","").split())
def s():return str(sys.stdin.readline().replace("\n",""))
def l():return list(sys.stdin.readline().replace("\n",""))
def intl():return [int(k) for k in sys.stdin.readline().replace("\n","").split()]
def lx():return list(map(lambda x:int(x)*-1,sys.stdin.readline().replace("\n","").split()))
def t():return tuple(map(int,sys.stdin.readline().replace("\n","").split()))

if __name__ == "__main__":pass
a,b,c,d = i2()
a1 = a//d
a2 = c//b
if a%d != 0:a1 += 1
if c%b != 0:a2 += 1
print("Yes" if a1 >= a2 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:
import math
A,B,C,D = (int(i) for i in input().split())  
a = math.ceil(A/D) #青木くんが仕留める回数
t =math.ceil(C/B)
if t<=a:
  print("Yes")
else:
  print("No")

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('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)
count=0
while True:
    if count%2==0:
        c=c-b
    else:
        a=a-d
    if a<=0:
        print("No")
        break
    elif c <=0:
        print('Yes')
        break
    else:
        count+=1

Submission status: Accepted

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

count_ta = 0
for i in range(100):
    a = a - d
    count_ta += 1
    if a <= 0:
        break

count_ao = 0
for i in range(100):
    c = c - b
    count_ao += 1
    if c <= 0:
        break

if count_ta >= count_ao:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:

import math
from sys import stdin


def get_result(data):
    A, B, C, D = data
    takahasi_q = math.ceil(float(A/D))
    aoiki_q = math.ceil(float(C/B))
    if takahasi_q == aoiki_q:
        return 'Yes'
    return 'Yes' if takahasi_q > aoiki_q else 'No'


if __name__ == '__main__':
    data = list(map(int, stdin.readline().rstrip().split(' ')))
    result = get_result(data)
    print(result)

Submission status: Accepted

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

hp_a = a
hp_c = c

turn = "T"

while hp_a > 0 and hp_c > 0:
  if turn == "T":
    hp_c -= b
    turn = "A"
  elif turn == "A":
    hp_a -= d
    turn = "T"

if turn == "A":
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
import math

input_str = input()

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

print("Yes" if math.ceil(c/b) <= math.ceil(a/d) else "No")

Submission status: Accepted

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

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

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

while(1):
  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


def main(A=None, B=None, C=None, D=None):
    if not A:
        A, B, C, D = map(int, input().split())
    t = ceil(A/D)
    a = ceil(C/B)
    if t >= a:
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    # main(10, 9, 10, 10)
    # main(46, 4, 40, 5)
    main()

Submission status: Accepted

Solution code:
ok=True
i=0
a,b,c,d=map(int,input().split())
k=c//b
c-=b*k
a-=d*(k)
if(a<=0 and c!=0):
    print("No")
else:
    print("Yes")

Submission status: Accepted

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

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

Submission status: Accepted

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

while True:
  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 = map(int, input().split())
count1 = 0
count2 = 0
while c > 0:
    c -= b
    count1 += 1
while a > 0:
    a -= d
    count2 += 1
if count1 <= count2:
    print("Yes")
else:
    print("No")

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

Submission status: Accepted

Solution code:
from math import ceil

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

Submission status: Accepted

Solution code:
from sys import stdin

def main():

    input = stdin.readline

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

    A_turn = (C + B - 1) // B
    C_turn = (A + D - 1) // D

    if A_turn <= C_turn:
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a=list(map(int,input().split()))
while True:
  a[2]-=a[1]
  if a[2]<=0:
    break
  a[0]-=a[3]
  if a[0]<=0:
    break
if a[0]<=0:
  print('No')
else:
  print('Yes')

Submission status: Accepted

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

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:
A,B,C,D=map(int,input().split())
if A%D==0:
	x=A//D
else:
	x=A//D +1
if C%B==0:
	y=C//B
else:
	y=C//B +1
if y<=x:
	print("Yes")
else:
	print("No")

Submission status: Accepted

Solution code:
import math
a,b,c,d = map(int,input().split())
k = math.ceil(c/b)
r = math.ceil(a/d)
if r<k:
	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 :
        break
    a = a - d

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

Submission status: Accepted

Solution code:
import sys
A, B, C, D = (int(x) for x in input().split())
while 1:
    C = C - B
    A = A - D
    if C <= 0:
        print('Yes')
        sys.exit()
    else:
        if A <= 0:
            print('No')
            sys.exit()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# n,m = map(int,sys.stdin.readline().split())
# a = list(map(int,sys.stdin.readline().split()))
# a = [sys.stdin.readline() for _ in range(n)]
# s = sys.stdin.readline().rstrip()
# n = int(sys.stdin.readline())
import sys,bisect
sys.setrecursionlimit(15000)

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

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

Submission status: Accepted

Solution code:
import math

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

taka=math.ceil(c/b)
aoki=math.ceil(a/d)

print("Yes" if taka<=aoki else "No")

Submission status: Accepted

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

Submission status: Accepted

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

b_count = a // d
if a % d != 0:
    b_count += 1

a_count = c // b
if c % b != 0:
    a_count += 1

if a_count <= b_count:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

A,B,C,D=(int(x) for x in input().split())

t_count = 0
a_count = 0

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

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

if t_count >= a_count:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

while A>0:
    A=A-D
    count1+=1
while C>0:
    C=C-B
    count2+=1

if count1>=count2:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
# coding=UTF-8
from collections import deque
from operator import itemgetter
from bisect import bisect_left, bisect
import itertools
import sys
import math
sys.setrecursionlimit(10**6)
input = sys.stdin.readline


def main():
    a, b, c, d = map(int, input().split())
    flag = -1
    while (a > 0 and c > 0):
        if flag == -1:
            c -= b
        else:
            a -= d
        flag *= - 1
    if flag == 1:
        print("Yes")
    else:
        print("No")


if __name__ == '__main__':
    main()

Submission status: Accepted

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


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

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

if tk>=ao:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

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

Submission status: Accepted

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

from sys import exit
while True:

    c=c-b
    a=a-d

    if c<=0:

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

        print("No")
        exit()
    else: pass