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: Wrong Answer

Solution code:
import math

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

num_A = math.floor(C/B)
num_B = math.floor(A/D)

if num_A >= num_B:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
nums = input()
Hp_Taka = int(nums.split(' ')[0])
Atk_Taka = int(nums.split(' ')[1])
Hp_Aoki = int(nums.split(' ')[2])
Atk_Aoki = int(nums.split(' ')[3])

while Hp_Taka > 0 and Hp_Aoki > 0:
	Hp_Taka = Hp_Taka - Atk_Aoki
	Hp_Aoki = Hp_Aoki - Atk_Taka
if Hp_Taka > 0:
	print('Yes')
else:
	print('No')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
a,b,c,d=map(int,input().split())
if(a//b > c//d):
    print("yes")
else:
    print("no")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

taka = a // d
ao = c // b

print("Yes") if ao >= taka else print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from math import factorial as fact
import math
import fractions
import sys
import itertools
import numpy as np
from collections import Counter
import datetime
#入力:N(int:整数)
def input1():
	return int(input())

#入力:N,M(int:整数)
def input2():
	return map(int,input().split())

#入力:[n1,n2,...nk](int:整数配列)
def input_array():
	return list(map(int,input().split()))

def keta(N):
	return len(str(N))


def input_daytime(input_time):
	time,distance=input_time.split()
	t=time.split(":")
	se=str(t[-1]).split(".")
	dt1 = datetime.timedelta(hours=int(t[0]),minutes=int(t[1]),seconds=int(se[0]),milliseconds=int(se[1]))
	return dt1

def combinations(n,r):
	return list(itertools.combinations(n,r))

def all_sets(num_list):
	subsets=[]
	for i in range(2,len(num_list) + 1):
		for c in combinations(num_list, i):
			subsets.append(c) 
	return subsets

#公約数の列挙
def ch(x1):
	cf=[]
	for i in range(2,math.sqrt(x1)+1):
		if x1 % i==0:
			cf.append(i)
	return cf

def CountOneRoots(x,y):
	#x:縦，y:横
	return fact(x+y)/fact(x)/fact(y)

# 素因数分解
def factorization(n):
	tmp=n
	count=0
	for i in range(2,int(n**0.5)+2):
		if tmp%i==0:
			cnt=0
			while tmp%i==0:
				cnt+=1
				tmp//=i
			count+=1
	if tmp!=1:
		count+=1

	return count
			


# s,w=input2()
# if w >=(s//2):
# 	print("unsafe")
# else:
# 	print("safe")

a,b,c,d=input2()

for i in range(1,101):
	if i%2==1:
		c-=b
		if c<=0:
			print("Yes")
			break
	else:
		a-=d
		if a<=0:
			print("No")
			break

Submission status: Wrong Answer

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

if ta <= tc:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if b//d >= c//a:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
T_H,T_A,A_H,A_A = map(int,input().split())




while True:
    T_H -= A_A
    if T_H > 0:
        A_H -= T_H    
        if A_H < 0:
            print("Yes")
            exit()
    else:
        print("No")
        exit()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

a_count = A // D + (1 if A % C else 0)
t_count = C // B + (1 if A % C else 0)
ans = 'No' if t_count < a_count else 'Yes'
#  print(t_count, a_count)
print(ans)

Submission status: Wrong Answer

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

for i in range(101):
    if i % 2 == 0:
        c -= b
        if c <= 0:
            print("Yes")
            break
    elif i % 2 == 1:
        a -= d
        if a <= 0:
            print("NO")
            break

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

index=0
for i in range(100):
	if index==0:
		c=c-b
		index=1
		if c<=0:
			print("Yes")
			break
	else:
		a=a-c
		index=0
		if a<=0:
			print("No")
			break

Submission status: Wrong Answer

Solution code:
a,b,c,d=map(int,input().split())
if a+b>d+c: print('yes')
else: print('no')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if a-b>= c-d:
    print("No")
else:
    print("yes")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def checkWin(T_hp, A_hp):
    if (T_hp <= 0):
        print('No')
    if (A_hp <= 0):
        print('Yes')

T_hp, T_at, A_hp, A_at = list(map(int, input().split()))

while (T_hp > 0 and A_hp > 0):
    A_hp = A_hp - T_at
    checkWin(T_hp, A_hp)
    T_hp = T_hp - A_at
    checkWin(T_at, A_at)

Submission status: Wrong Answer

Solution code:
A,B,C,D=input().split()
a=int(A)
b=int(B)
c=int(C)
d=int(D)
p=int((c%b)+1)
q=int((a%d)+1)
if p<=q:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

r1 = a // d
r2 = c // b
if r1 >= r2:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

if count_a > count_b:
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

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: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b,c,d=map(int,input().split())
if a+b>b+c: print('yes')
else: print('no')

Submission status: Wrong Answer

Solution code:
import sys
import math

from collections import defaultdict
from collections import deque
def load(vtype=int):
    return vtype(input().strip())
def load_list(seplator=" ", vtype=int):
    return [vtype(v) for v in input().strip().split(seplator)]
def exit():
    import sys
    sys.exit(0)
def perm_sub(li, used):
    if len(li) == len(used):
        return [deque()]
    k = []
    for i in range(len(li)):
        if i in used:
            continue
        used.add(i)
        sub_list = perm_sub(li, used)
        for sub in sub_list:
            sub.appendleft(li[i])
        k.extend(sub_list)
        used.discard(i)
    return k
def perm_li(li):
    return perm_sub(li, set())
def perm_n(n):
    return perm_sub(list(range(n)), set())
def join_i(li, sep=""):
    return sep.join([str(e) for e in li])
def li2n(li):
    n, base = 0, 1
    for i in range(len(li)-1, -1, -1):
        n += li[i] * base
        base *= 10
    return n
def sli2ili(li):
    return [int(s) for s in li] 
def prime_list(n):
    li = [i for i in range(2, n+1)]
    for i in range(len(li)):
        if li[i] >= int(math.sqrt(n)):
            break
        if li[i] == -1:
            continue
        for j in range(i+1, len(li)):
            if li[j] % li[i] == 0:
                li[j] = -1
    return [n for n in li if n != -1]
def gcd(a, b):
    a, b = max(a, b), min(a, b)
    while True:
        r = a % b
        if r == 0: return b
        a, b = b, r
def lcm(a, b):
    return int(a * b / gcd(a,b))
def all_subset(li):
    s = []
    n = len(li)
    for bit in range(0, (1<<(n+1))):
        ss = set()
        for i in range(0, n):
            if (bit & (1 << i)):
                ss.add(li[i])
        s.append(ss)
    return s
def factorial(n):
    if n == 1:
        return 1
    return n * factorial(n-1)
def mCn(m, n):
    def factorial_ntimes(m, n):
        r = 1
        while n:
            r *= m
            m -= 1
            n -= 1
        return r
    return int(factorial_ntimes(m, n) / factorial(n))

a,b,c,d = load_list()

x = math.ceil(d/b)
y = math.ceil(a/d)

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

Submission status: Wrong Answer

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

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

print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if (c // a) >= (b // d):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

if C//B+C%B<=A//D+A%D:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

if C//B >= A//D:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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: Wrong Answer

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

while c>0:
    c=c-b
    count1+=1

while  a>0:
    a=a-d
    count2+=1

if count1 < count2:
    print('No')
else:
    print('Yes')

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

Solution code:
li=input().split(" ")
a=int(li[0])
b=int(li[1])
c=int(li[2])
d=int(li[3])
stop=0
while stop==0:
    c-=b
    if c<=0:
        stop=2
    a-=d
    if a<=0:
        stop=1
    
if stop ==1:
    print("Yes")
if stop==2:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
#!python3

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


def main():
    a = A // D if A % D == 0 else A // D + 1
    b = C // B if C % B == 0 else C // B + 1
    ans = "No" if a < b else "Yes"
    print(a, b)
    print(ans)
    

if __name__ == "__main__":
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# coding: utf-8
# Your code here!
import sys
readline = sys.stdin.readline
read = sys.stdin.read

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


t = c//b
s = a//d
if t <= s:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import sys
def input(): return sys.stdin.readline().rstrip()

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

  a = A
  c = C
  for i in range(max(A, C)):
    if i%2 == 0:
      c -= B
      if c <= 0:
        print('Yes')
        return
    else:
      a -= D
      if a <= 0:
        print('No')
        return

if __name__ == '__main__':
  main()

Submission status: Wrong Answer

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

while True:
    C = C - A

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

    B = B - D

    if B <= 0:
        print('No')
        break

Submission status: Wrong Answer

Solution code:
def main():
	a,b,c,d = map(int,input().split())
	i = 0
	while a >= 0 or c >= 0:
		i += 1
		a = a - i*d
		c = c - i*b
		if a == c == 0:
			print("Yes")
			break
		elif c <= 0:
			print("Yes")
			break
		elif a <= 0:
			print("No")
			break

	

if __name__ == '__main__':
	main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin

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


while A and C >0 :
    C -= B
    A -= D
    
if A is not 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

if a//d  < c//b:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A, B, C, D = list(map(int, input().strip().split()))
Takahashi = A
Aoki = C
ans = ''

while True:
  Takahashi -= D
  if Takahashi <= 0:
    ans = 'No'
    break
  Aoki -= C
  if Aoki <= 0:
    ans = 'Yes'
    break
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if c%b!=0:
  e=c//b+1
else:
  e=c//b
  
if a%d!=0:
  f=a//d+1
else:
  f=a//d  
if e>=f:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if a-b>= c-d:
    print("yes")
else:
    print("No")

Submission status: Wrong Answer

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

# if a / c >= b / d
if a * d >= b * c :
  print("Yes")
else : print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
from sys import stdin
def main():
	inp=stdin.readline
	a,b,c,d=map(int, inp().split())
	f=True
	while a>0 or c>0:
		if f:
			a-=d
		else:
			c-=b
		f=not(f)
	if a>0:
		print("Yes")
	else:
		print("No")

main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print('Yse' if math.ceil(C/B) <= math.ceil(A/D) else 'No')

Submission status: Wrong Answer

Solution code:
import math

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

#items=[int(i) for i in input().split()]
if C/B > (A/D)+1:
    print("No")
    exit()
print("Yes")

Submission status: Wrong Answer

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

ans = 'Yes'
while True:
    # 高橋くんのターン
    D -= A
    if D <= 0:
        break

    # 青木くんのターン
    B -= C
    if B <= 0:
        ans = 'No'
        break

print(ans)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A, B, C, D = map(int, input().split())
taka = A % D + 1
aoki = C % B + 1

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import math

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

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

if takahashi_attack > aoki_attack:
    print('No')
else:
    print('Yes')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
#スペース区切りの整数の入力
tairyoku_A, kougeki_B,tairyoku_C,kougeki_D = map(int, input().split())

one = int(tairyoku_A /kougeki_D)
two = int(tairyoku_C /kougeki_B)


if(one>two):
  print("Yes")
elif(one<two):
  print("No")
else:
  print("Yes")

Submission status: Wrong Answer

Solution code:
from sys import stdin


if __name__ == "__main__":
    _in = [_.rstrip() for _ in stdin.readlines()]
    A, B, C, D = list(map(int,_in[0].split(' ')))  # type:list(int)
    # vvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvvv
    TF = 'Yes' if C//B >= A//D else 'No'
    # ^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^^
    print(TF)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

    if C % B <= A % D :
        print("Yes")
    else :
        print("No")


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
def main():
    t, t_a, a, a_a = list(map(int, input().split()))
    while True:
        a = a - t_a
        if a < 0:
            print('No')
            exit()
        t = t - a_a
        if t < 0:
            print('Yes')
            exit()




if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

while a > 0:
  c = c - b
  if c < 0:
    print('Yes')
    sys.exit()
  a = a - d
  
print('No')

Submission status: Wrong Answer

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

e=a//d
f=c//b

if a == d:
    e -= 1
if b == c:
    f -= 1

if e >= f:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A,B,C,D=input().split()
a=int(A)
b=int(B)
c=int(C)
d=int(D)
p=int(c/b)
q=int(a/d)
if p<=q:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def solve():
    a, b, c, d = map(int, input().split())
    
    x = a // d
    y = c // b

    return 'Yes' if x < y else 'No'

print(solve())

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

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

if __name__ == "__main__":
    resolve()

Submission status: Wrong Answer

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


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

Submission status: Wrong Answer

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

if c % b >= a % d:
    print('No')
else:
    print('Yes')

Submission status: Wrong Answer

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

from pprint import pprint
from collections import deque, defaultdict
import sys

sys.setrecursionlimit(10 ** 6)
inf = float("inf")

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

i = 0
while a > 0 and c > 0:
    if i % 2 == 0:
        c -= b
    else:
        a -= d

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

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10**6)
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: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
from collections import defaultdict
from heapq import heappop, heappush

from decimal import *

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

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

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

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

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

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

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

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

inf = float('inf')
mod = 1000000007

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

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

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

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

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


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

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

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

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

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

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

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

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

if __name__ == "__main__":
	main()

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

t = int(d/b)

if d*t >= a:
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

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