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

Submission status: Wrong Answer

Solution code:
takahashi_h, takahashi_a, aoki_h, aoki_a = map(int, input().split())

if takahashi_h // aoki_a > aoki_h // takahashi_a:
    print("Yes")
elif takahashi_h // aoki_a < aoki_h // takahashi_a:
    print("No")
else:
    takahashi_h = takahashi_h - (aoki_a * (takahashi_h // aoki_a))
    aoki_h = aoki_h - (takahashi_a * (aoki_h // takahashi_a))
    
    if aoki_h > 0 and takahashi_h == 0:
        print("No")
    else:
        print("Yes")

Submission status: Wrong Answer

Solution code:
a,b,c,d=map(int,input().split())
e=[]
f=[]
g=c-b
h=a-d
while c>0:
    g=c-b
    e.append(g)
    c=g
    h=a-d
    f.append(h)
    a=h
if len(e)!=1:
    if e[len(e)-1]<f[len(f)-2]:
        print('Yes')
    else:
        print('No')
elif len(e)==1:
    print('Yes')

Submission status: Wrong Answer

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

while a>=0 or c>=0:
    a-=d
    if a<=0:
        print("No")
        break
    else:
        c-=d
        if c<=0:
            print("Yes")
            break
        else:
            pass

Submission status: Wrong Answer

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

Takahashi=math.ceil(a/d)
Aoki=math.ceil(c/b)-1
if Takahashi>=Aoki:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

if (a+b)%2 ==1 and (c+d)%2==0:
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print("Yes" if (a>c and d-b <= 2) or a >= d or b >= c else "No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if C//B == A//D:
  if C%B > A%D:
    print('No')
  else:
    print('Yes')  
else:
  if C//B > A//D:
    if C//B - A//D == 1:
      print('Yes')
    else:
      print('No')  
  elif C//B < A//D:  
      print('No')

Submission status: Wrong Answer

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

print("Yes" if (a>c and d-b <= 2) or a > d or b >= c else "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 and c>0:
  print('No')
else:
  print('Yes')

Submission status: Wrong Answer

Solution code:
t,k,a,o = map(int,input().split())
takahasi=int(a//k)
aoki=int(t//o)
if takahasi<=aoki:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

print("Yes" if (a>c and d-b <= 2) or a > d or b > c else "No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
takahashi_h, takahashi_a, aoki_h, aoki_a = map(int, input().split())

if takahashi_h // aoki_a > aoki_h // takahashi_a:
    print("Yes")
elif takahashi_h // aoki_a < aoki_h // takahashi_a:
    print("No")
else:
    takahashi_h = takahashi_h - (aoki_a * (takahashi_h // aoki_a))
    aoki_h = aoki_h - (takahashi_a * (aoki_h // takahashi_a))
    
    if aoki_h > 0 or takahashi_h <= 0:
        print("No")
    else:
        print("Yes")

Submission status: Wrong Answer

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

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline


def solve():
    a, b, c, d = map(int, rl().split())
    if c % b != 0:
        print('No')
        exit()
    if c % b != 1:
        print('Yes')
    

if __name__ == '__main__':
    solve()

Submission status: Wrong Answer

Solution code:
a,b,c,d=map(int,input().split())
e=[]
f=[]
g=c-b
h=a-d
while c>0:
    g=c-b
    e.append(g)
    c=g
    h=a-d
    f.append(h)
    a=h
if e[len(e)-1]>f[len(f)-2]:
    print('Yes')
elif e[len(e)-1]<0:
    print('Yes')
else:
    print('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")
elif E == F and A%D != 0:
	print("Yes")
elif E == F+1 and C%B != 0 and A%D == 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 =c - b
    if c > 0:
        a =a - d
    else:
        print('Yes')
if c <= 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

while (taka_hp > 0 and ao_hp > 0):
    ao_hp = ao_hp - taka_attack
    taka_hp = taka_hp - ao_attack
else:
    if ao_hp == 0:
      print("Yes")
    else:
      print("No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

if (a+b)%2 ==1 and (c+d)%2==0 or (a+b)==(c+d):
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
N = (input().split())
TH = int(N[0])
TP = int(N[1])
AH = int(N[2])
AP = int(N[3])
AI,TI = 0,0
chk = 0
NNa,NNb = 0 ,0

if 1 <= TH <= 100 and 1 <= TP <= 100 and 1 <= AH <= 100 and 1 <= AP <= 100:
  while chk == 1:
    AI += TP
    NNa +=1
    if AI <= AH:
      chk += 1
  chk = 0
  while chk == 1:
    AI += TP
    NNb +=1
    if TI <= TH:
      chk += 1
  if NNa <= NNb:
    print('Yes')
  else:
    print('No')

Submission status: Wrong Answer

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

i = C // B

y = A // D

if i > y:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

flag = 1

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

print( "Yes" if C == 0 else "No")

Submission status: Wrong Answer

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

print("Yes" if (a>c and d-b <= 2) or a > d else "No")

Submission status: Wrong Answer

Solution code:
A,B,C,D = map(int,input().split())
M = min([divmod(A,D)[0],divmod(C,B)[0]])
if divmod(C,B)==0:
    print("Yes")
elif divmod(A,D)==0:
    print("No")
else:
    C_1 = C-B*M
    A_1 = A-D*M
    if C_1 - B <= 0:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
numbers = input().split(" ")
healthOfT = int(numbers[0])
strengthOfT = int(numbers[1])
healthOfA = int(numbers[2])
strengthOfA = int(numbers[3])
times_T_win = healthOfA//strengthOfT + 1
times_A_win = healthOfT//strengthOfA + 1
if times_T_win >= times_A_win:
	print("Yes")
else:
	print("No")

Submission status: Wrong Answer

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

ttol=a%d
atol=c%b

tt=a//d
at=c//d
    
if ttol>=atol:
    print("Yes")
elif tt>at and ttol<atol:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a,b,c,d=map(int,input().split())
e=[]
f=[]
g=c-b
h=a-d
while c>0:
    g=c-b
    e.append(g)
    c=g
    h=a-d
    f.append(h)
    a=h
print(e,f)
if e[len(e)-1]>f[len(f)-2]:
    print('Yes')
elif e[len(e)-1]<0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
t,k,a,o = map(int,input().split())
taka=int(a//k)
aoki=int(t//o)
if taka<=aoki:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

n = C//B

if A-(D*n)<0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
A=list(map(int,input().split()))
aoki = A[2]-A[1]
taka = A[0]-A[3]
if aoki<=0:
    print("Yes")
elif aoki>taka:
    print("No")
elif aoki<taka:
    print("Yes")
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
  if c > 0:
    a -= d
  else:
    print('No')
  if a > 0:
    break
  else:
    print('Yes')

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A,B,C,D = map(int,input().split())
X = A-C
Y = D-B
if X > Y:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

if (a+b)%2 ==1 and (c+d)%2==0 or (a+b)%2 ==1 and (c+d)%2==1 or (a+b)%2 ==0 and (c+d)%2==0:
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
A,B,C,D = map(int,input().split())
M = min([divmod(A,D)[0],divmod(C,B)[0]])
if divmod(C,B)==0:
    print("Yes")
elif divmod(A,D)==0:
    print("No")
else:
    C_1 = C-B*M
    A_1 = A-D*M
    if C_1 - B <= 0 and C_1>0 and A_1>0:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

i = C // B

y = A // D

if C-B*i >= A-D*y:
  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:
  a -= d
  if a > 0:
    c -= b
  else:
    print('No')
  if c > 0:
    break
  else:
    print('Yes')

Submission status: Wrong Answer

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

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

if a < 0:
    print('No');
else :
    print('Yes');

Submission status: Wrong Answer

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

ans1=0
ans2=0

for i in range(201):
    A=A-i*D
    if A < 1 :
        ans1 = i
        break

for j in range(201):
    C=C-j*B
    if  C< 1:
        ans2 = j
        break
if ans1>=ans2:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
A,B,C,D=map(int,input().split())
win=A/D
lose=C/B
if lose<=win:
  print("Yes")
else:
  if lose<=1:
    print("Yes")
  else:
    if lose-win<1 and A%D!=0:
      print("Yes")
    else:
      print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
takahashi_h, takahashi_a, aoki_h, aoki_a = map(int, input().split())

takahashi_h = takahashi_h - (aoki_a * (takahashi_h // aoki_a))
aoki_h = aoki_h - (takahashi_a * (aoki_h // takahashi_a))

if aoki_h > 0 or takahashi_h <= 0:
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a, b, c, d = [int(x) for x in input().split()]

first_round = a - b

if first_round <= 0:
    print("Yes")
else:
    if c - d <= first_round:
        print("No")
    else:
        print("X")

Submission status: Wrong Answer

Solution code:
A,B,C,D = map(int,input().split())
M = min([divmod(A,D)[0],divmod(C,B)[0]])
if divmod(C,B)==0:
    print("Yes")
else:
    C_1 = C-B*M
    A_1 = A-D*M
    if C_1 - B <= 0 and C_1>0 and A_1>0:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

Solution code:
numbers = input().split(" ")
healthOfT = int(numbers[0])
strengthOfT = int(numbers[1])
healthOfA = int(numbers[2])
strengthOfA = int(numbers[3])
for i in (0, 110):
    healthOfA = healthOfA - strengthOfT
    if healthOfA <= 0:
        a = i
        break
for p in (0, 110):
    healthOfT = healthOfT - strengthOfA
    if healthOfT <= 0:
        break
if p < i:
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

i = C // B

y = A // D

if C-B*i > A-D*y:
  print("No")
else:
  print("Yes")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A,B,C,D = map(int,input().split())
X = D-B
Y = A-C
if X > Y:
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
takahashi_h, takahashi_a, aoki_h, aoki_a = map(int, input().split())

takahashi_h = takahashi_h - (aoki_a * (takahashi_h // aoki_a))
aoki_h = aoki_h - (takahashi_a * (aoki_h // takahashi_a))

if aoki_h > 0 or takahashi_h == 0:
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline


def solve():
    a, b, c, d = map(int, rl().split())
    if c % b != 0:
        print('No')
        exit()
    print('Yes')
    

if __name__ == '__main__':
    solve()

Submission status: Wrong Answer

Solution code:
A, B, C, D= map(int,input().split())
if A>=1 or B>=1 or C>=1 or D>=1 or A<=100 or B<=100 or C<=100 or D<=100:
    if (A+B)>(C+D):
        print("Yes")
    elif A>C:
        print("Yes")
    else:
        print("No")
else:
    pass

Submission status: Wrong Answer

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


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



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

while(1):
    aoki.stamina = aoki.stamina-taka.attack
    if aoki.stamina<=0:
        print('No')
        break
    taka.stamina = taka.stamina-aoki.attack
    if taka.stamina<=0 :
        print('Yes')
        break

Submission status: Wrong Answer

Solution code:
def solve(a, b, c, d):
    c = c + d
    a = a + b

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


if __name__ == '__main__':
    inputs = list(map(int, input().split()))
    solve(inputs[0], inputs[1], inputs[2], inputs[3])

Submission status: Wrong Answer

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

n_1=A//D
n_2=C//B

if n_2>=n_1:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
K = input().split(" ")
k = [int(n) for n in K]
t =k[0]//k[3]
a = k[2]//k[1]
t1 = k[0]%k[3]
a1 = k[2]%k[1]
if t > a:
    print('Yes')
elif t == a and a1 == 0:
    print('Yes')
elif t+1 == a and t1 != 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
def so():
    a,b,c,d=map(int,input().split())
    if d-b<=0:
        return "Yes"
    elif a-d<=0:
        return "No"
    elif c-a<=0:
        return "Yes"
    elif b-c<=0:
        return ("No")
    return ("No")
print(so())

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

if (a+b)%2 ==1 and (c+d)==0:
    print("No")
else:
    print("Yes")

Submission status: Wrong Answer

Solution code:
def so():
    a,b,c,d=map(int,input().split())
    if d-b<=0:
        return "Yes"
    elif a-d<=0:
        return "No"
    elif c-a<=0:
        return "Yes"
    elif b-c<=0:
        return ("No")
print(so())

Submission status: Wrong Answer

Solution code:
takahashi_h, takahashi_a, aoki_h, aoki_a = map(int, input().split())

takahashi_h = takahashi_h - (aoki_a * (takahashi_h // aoki_a))
aoki_h = aoki_h - (takahashi_a * (aoki_h // takahashi_a))

if aoki_h == 0 or takahashi_h > 0:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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


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



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

while(1):
    aoki.stamina = aoki.stamina-taka.attack
    if aoki.stamina<0:
        print('No')
        break
    taka.stamina = taka.stamina-aoki.attack
    if taka.stamina<0 :
        print('Yes')
        break

Submission status: Wrong Answer

Solution code:
A, B, C, D = map(int, input().split())
first = A-C
second = B-D
if (A>C):
    if first >= second:
        print("No")
    else:
        print("Yes")
elif(A==C):
    if B>D:
        print("Yes")
    else:
        print("No")
else:
    if first >= second:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

aoki_count = A//D
takahashi_count = C//B

if aoki_count < takahashi_count:
    print("Yes")
elif aoki_count == takahashi_count:
    if A%D > 0:
        print("Yes")
    else:
        print("No")
elif aoki_count > takahashi_count:
    if C%B - B < 0 and aoki_count - takahashi_count == 1:
        print("Yes")
    else:
        print("No")

Submission status: Wrong Answer

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

print("Yes" if a>c and d-b <= 2 else "No")

Submission status: Wrong Answer

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

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

if p == q:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

ttol=a%d
atol=c%b
    
    
if ttol>=atol or ttol==atol+1:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
A, B, C, D= map(int,input().split())
if A>=1 or B>=1 or C>=1 or D>=1 or A<=100 or B<=100 or C<=100 or D<=100:
    if (A+B)>(C+D):
        print("Yes")
    else:
        print("No")
else:
    pass

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def so():
    a,b,c,d=map(int,input().split())
    if d-b<=0:
        return "Yes"
    elif a-d<=0:
        return "No"
    elif c-a<=0:
        return "Yes"
    elif b-c<=0:
        print("No")
print(so())

Submission status: Wrong Answer

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

if B >= C:
  print ("Yes")
elif D >= A and B < C:
  print ("No")
elif (2*A/D) > (((2*C)/B)-2):
  print ("Yes")
elif (2*A/D) < (((2*C)/B)-2):
  print ("No")
else:
  print ("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
n = input().split()
n = [int(i) for i in n]
c = 0
d = 0
while n[0]>0:
  n[0]-=n[3]
  c+=1
while n[2]>0:
  n[2]-=n[1]
  d+=1

if c<=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")
elif((C/B-A/D)==1 and(C%B)!=0 and A%D==0):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
takahashi_h, takahashi_a, aoki_h, aoki_a = map(int, input().split())

takahashi_h = takahashi_h - (aoki_a * (takahashi_h // aoki_a))
aoki_h = aoki_h - (takahashi_a * (aoki_h // takahashi_a))

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

Submission status: Wrong Answer

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

t = C /B
a = A /D

if B >= C:
    ans = "Yes"
elif B < C and D >= A:
    ans = "No"
else:
    if t <= a+1 :
        ans = "Yes"
        if A % D == 0 and C % B ==0:
            ans = "Yes"
        elif A % D == 0:
            ans = "No"
    else:
        ans = "No"
print(ans)

Submission status: Wrong Answer

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

if (abs(a-b))%2>0 and (abs(c-d)%2)<0:
    print('No')
else:
    print('yes')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A,B,C,D=map(int,input().split())
a1=C-B
if a1 <=0 :
    print("Yes")
a2=A-D
if a2 <=0 :
    print("No")
a3=a1-B
if a3 <=0 :
    print("Yes")
a4=a2-D
if a4 <=0 :
    print("No")
a5=a3-B
if a5 <=0 :
    print("Yes")
a6=a4-D
if a6 <=0 :
    print("No")
a7=a5-B
if a7 <=0 :
    print("Yes")
a8=a6-D
if a8 <=0 :
    print("No")
a9=a7-B
if a9 <=0 :
    print("Yes")
a10=a8-D
if a10 <=0 :
    print("No")
a11=a9-B
if a11 <=0 :
    print("Yes")
a12=a10-D
if a12 <=0 :
    print("No")
a13=a11-B
if a13 <=0 :
    print("Yes")
a14=a12-D
if a14 <=0 :
    print("No")
a15=a13-B
if a15 <=0 :
    print("Yes")
a16=a14-D
if a16 <=0 :
    print("No")
a17=a15-B
if a17 <=0 :
    print("Yes")
a18=a16-D
if a16 <=0 :
    print("No")
a19=a17-B
if a19 <=0 :
    print("Yes")
a20=a18-D
if a20 <=0 :
    print("No")
a21=a19-B
if a21 <=0 :
    print("Yes")
a22=a20-D
if a22 <=0 :
    print("No")
a23=a21-B
if a23 <=0 :
    print("Yes")
a24=a22-D
if a24 <=0 :
    print("No")
a25=a23-B
if a25 <=0 :
    print("Yes")
a26=a24-D
if a26 <=0 :
    print("No")

Submission status: Wrong Answer

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

if C//B == A//D:
  if C%B > A%D:
    print('No')
  else:
    print('Yes')  
else:
  if C//B > A//D:
    if C//B - A//D == 1:
      print('Yes')
    else:
      print('No')  
  elif C//B < A//D:  
      print('Yes')

Submission status: Wrong Answer

Solution code:
s=input()
a,b,c,d=s.split()
a=int(a)
b=int(b)
c=int(c)
d=int(d)
if c%b==0:
    t=int(c/b)
else:
    t=int(c/b)+1
if a%d==0:
    k=int(a/d)
else:
    k=int(a/d)+1
if t<=k:
    print("yes")
else:
    print("no")

Submission status: Wrong Answer

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

if (abs(a-b))%2==1 and (abs(c-d)%2)==0:
    print('No')
else:
    print('yes')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A,B,C,D=[int(x) for x in input().split()]
while A and C:
    C=C-B
    A=A-D
if A==0:print('No')
else:print('Yes')

Submission status: Wrong Answer

Solution code:
numbers = input().split(" ")
healthOfT = int(numbers[0])
strengthOfT = int(numbers[1])
healthOfA = int(numbers[2])
strengthOfA = int(numbers[3])
for i in(0,100):
	healthOfA=healthOfA-strengthOfT
	if healthOfA<=0:
		a=i
		break
for p in(0,100):
	healthOfT=healthOfT-strengthOfA
	if healthOfT<=0:
		break
if p<i:
	print("No")
else:
	print("Yes")

Submission status: Wrong Answer

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

if (a+b)%2==1 and (c+d)%2==0:
    print('No')
else:
    print('yes')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
def solve(a, b, c, d):
    c = c % b
    a = a % d

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


if __name__ == '__main__':
    inputs = list(map(int, input().split()))
    solve(inputs[0], inputs[1], inputs[2], inputs[3])

Submission status: Wrong Answer

Solution code:
num = map(int,input().split())
a = list()
for i in num:
    a.append(i)
if a[0]-a[1] != 0:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
a,b,c,d=map(int,input().split())
T=[c-b*i for i in range(c//b+1)]
A=[a-d*j for j in range(a//d+1)]
print("Yes" if len(T)-len(A)==1 or len(T)<len(A) else "No")