TnT/Multi_CodeNet4Repair huggingface dataset:
Problem: 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`.

Submission attempts (in order):
A,B,C,D = map(int, input().split())
STOP = ""
a = 0
while STOP != "STOP":
    A = A - B
    D = D - C
    if A <= 0:
        a = 1
    if D <= 0:
        a = 2
    else:
        continue
if a == 1:
    print("Yes")
else:
    print("No")

A,B,C,D = map(int, input().split())
while A != 0 or B != 0 or C != 0 or D != 0:
    if A == 0 or B == 0:
        print("Yes")
    elif C == 0 or D == 0:
        print("No")
    else:
        continue
    A -= 1
    B -= 1
    C -= 1
    D -= 1

A,B,C,D = map(int, input().split())
S = 0
while S != 1:
    A = A-B
    C = C-B
    if A <= 0:
        S = 1
        print("Yes")
    if C <= 0:
        S = 1
        print("No")
    else:
        continue

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

A,B,C,D = map(int, input().split())
S = 0
while S != 1:
    C = C - B
    D = D - A
    if C <= 0:
        S = 1
        print("No")
    elif D <= 0:
        S = 1
        print("Yes")
    else:
        continue

A,B,C,D = map(int, input().split())
S = 0
while S != 1:
    A -=D
    C -=B
    if A <= 0:
        S = 1
        print("Yes")
    elif C <= 0:
        S = 1
        print("No")
    else:
        continue

A,B,C,D = map(int, input().split())
S = 0
while S != 1:
    C = C - B
    A = A - D
    if C <= 0:
        S = 1
        print("No")
    elif A <= 0:
        S = 1
        print("Yes")
    else:
        continue

A,B,C,D = map(int, input().split())
S = 0
while S != 1:
    C = C - B
    A = A - D
    if C <= 0:
        S = 1
        print("Yes")
    elif A <= 0:
        S = 1
        print("No")
    else:
        continue

Verdicts: Time Limit Exceeded

Time Limit Exceeded

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
a, b, c, d = map(int, input().split())

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

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

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

Verdicts: Time Limit Exceeded

Accepted
Problem: 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`.

Submission attempts (in order):
A,B,C,D=map(int,input().split())

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

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

for i in range(max(C//B+1,A//D+1)):
  C=C-B
  if C<=0:
    print("Yes")
    break
    
  A=A-D
  if A<=0:
    print("No")
    break
  

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
a, b, c, d = map(int, input().split())
print("Yes" if a // d >= c // b else "No")

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

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
A, B, C, D = map(int,input().split())
ans = "Yes"
curB = B
curD = D
for i in range(max(B,D)):
  curD = curD-A
  if(curD<=0):
    ans = "Yes"
    break
  curB = curB-C
  if(curB<=0):
    ans = "No"
    break
print(ans)

A, B, C, D = map(int,input().split())
ans = "Yes"
curA = A
curC = C
for i in range(max(A,C)):
  curC  = curC-B
  if(curC<=0):
    ans = "Yes"
    break
  curA = curA-D
  if(curA<=0):
    ans = "No"
    break
print(ans)

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
A,B,C,D = map(int, input().split())

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

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

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

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
a, b, c, d = map(int, input().split())
x = a + d - 1 / d
y = b + c - 1 / b
if x >= y:
  print("YES")
else:
  print("NO") 

a, b, c, d = map(int, input().split())
x = a / d
y = c / b
if x >= y:
  print("YES")
else:
  print("NO") 

a, b, c, d = map(int, input().split())
while True:
  c = c - b
  if c <= 0:
    print("YES")
    break
  else: 
    a = a - d
    if a <= 0:
      print("NO")
      break

a, b, c, d = map(int, input().split())
x = a / d
y = b / c
if x >= y:
  print("YES")
else:
  print("NO") 

a, b, c, d = map(int, input().split())
x = int((a+d-1) / d)
y = int((b+c-1) / b)
if x >= y:
  print("YES")
else:
  print("NO") 

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

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
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('No')
    break
  if c<=0:
    print('Yes')
    break

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
  #print(a,c)
  i+=1
  if a<=0:
    print('No')
    break
  if c<=0:
    print('Yes')
    break


Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
A, B, C, D = map(int, input().split())

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


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


Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
a, b, c, d = map(int, input().split())
if c // b >= a // d:
    print('Yes')
else:
    print('No')

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

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
import math
List = input().split()
HP_T = int(List[0])
AT_T = int(List[1])
HP_A = int(List[2])
AT_A = int(List[3])
result = 0

Turn_T = math.ceil(HP_A/AT_T)
Turn_A = math.ceil(HP_T/AT_A)
print(Turn_T, Turn_A)
if Turn_T - Turn_A == 0:
  result = "Yes"  
if Turn_T - Turn_A < 0:
  result = "Yes"
if Turn_T - Turn_A > 0:
  result = "No"

print(result)

List = input().split()
HP_T = int(List[0])
AT_T = int(List[1])
HP_A = int(List[2])
AT_A = int(List[3])
result = 0

Turn_T = HP_A//AT_T 
Turn_A = HP_T//AT_A 
print(Turn_T, Turn_A)
if Turn_T - Turn_A < 0:
  result = "Yes"
else:
  result = "No"

print(result)

List = input().split()
HP_T = int(List[0])
AT_T = int(List[1])
HP_A = int(List[0])
AT_A = int(List[1])
Flag = False
result = []

for i in range(100):
  if Flag:
    break
  HP_A = HP_A - AT_T
  if HP_A <= 0:
    result.append("yes")
  HP_T = HP_T - AT_A
  if HP_T <= 0:
    result.append("No")
print(result[0])

List = input().split()
HP_T = int(List[0])
AT_T = int(List[1])
HP_A = int(List[2])
AT_A = int(List[3])
result = 0

Turn_T = HP_A/AT_T 
Turn_A = HP_T/AT_A 
print(Turn_T, Turn_A)
if Turn_T - Turn_A >= 0:
  result = "No"
else:
  result = "Yes"

print(result)

List = input().split()
HP_T = int(List[0])
AT_T = int(List[1])
HP_A = int(List[0])
AT_A = int(List[1])
Flag = False
result = []

for i in range(1000):
  if Flag:
    break
  HP_A = HP_A - AT_T
  if HP_A <= 0:
    result.append("Yes")
  HP_T = HP_T - AT_A
  if HP_T <= 0:
    result.append("No")
print(result[0])

import math
List = input().split()
HP_T = int(List[0])
AT_T = int(List[1])
HP_A = int(List[2])
AT_A = int(List[3])
result = 0

Turn_T = math.ceil(HP_A/AT_T)
Turn_A = math.ceil(HP_T/AT_A)
if Turn_T - Turn_A == 0:
  result = "Yes"  
if Turn_T - Turn_A < 0:
  result = "Yes"
if Turn_T - Turn_A > 0:
  result = "No"

print(result)

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
A,B,C,D = map(int, input().split())

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

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

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

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

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

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
a, b, c, d = map(int, input().split())

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


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

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


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

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
a, b, c, d = map(int, input().split())
while a > 0 and b > 0:
    c -= b
    if c>0:
        a -=d
    else:
        print("yes")
    if a<0:
        print("no")


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

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:
        print("no")


a, b, c, d = map(int, input().split())
while a > 0 and b > 0:
    c -= b
    if c>0:
        a -=d
    else:
        print("yes")
    if a<=0:
        print("no")


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:
        print("no")


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


try:
  a, b, c, d = map(int, input().split())
  while a > 0 and c > 0:
      c -= b
      if c>0:
          a -=d
          if a<=0:
          	print("No")
      else:
          print("Yes")
    
except:
  pass

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Wrong Answer

Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
num=list(map(int,input().split()))
while 1:
  num[2]=num[2]-num[1]
  if num[2]<=0:
    print("Yes")
    break
  num[0]=num[0]-num[3]
  if num[3]<=0:
    print("No")
    break

num=list(map(int,input().split()))
while 1:
  num[2]=num[2]-num[1]
  if num[2]<=0:
    print("Yes")
    break
  num[0]=num[0]-num[3]
  if num[0]<=0:
    print("No")
    break

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
def solve():
    A, B, C, D = map(int, input().split())
    print('NYoe s'[C//B > A//D::2])


if __name__ == '__main__':
    solve()


def solve():
    A, B, C, D = map(int, input().split())
    print('NYoe s'[-(-C//B) > -(-A//D)::2])


if __name__ == '__main__':
    solve()


def solve():
    A, B, C, D = map(int, input().split())
    print('YNeos'[-(-C//B) > -(-A//D)::2])


if __name__ == '__main__':
    solve()


Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
a,b,c,d = map(int,input().split())
if c / b - 1 < a / d :
    print("Yes")
else:
    print("No")

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

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

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
THP, TAT, AHP, AAT = map(int, input().split())

turn = 0
while True:
  if turn % 2 == 0:
    AHP -= TAT
    if AHP <= 0:
      print("Yes")
      break
  else:
    THP -= AAT
    if THP <= 0:
      print("No")
      break

THP, TAT, AHP, AAT = map(int, input().split())

turn = 0
while True:
  if turn % 2 == 0:
    AHP -= TAT
    if AHP <= 0:
      print("Yes")
      break
  else:
    THP -= AAT
    if THP <= 0:
      print("No")
      break
  turn += 1

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
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')

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

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

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

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')

Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
a, b, c, d = map(int, input().split())

killcount_a = -(-C//B)
killcount_b = -(-A//D)

if a <= b:
  print("Yes")
else:
  print("No")

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

Verdicts: Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
a,b,c,d = map(int, input().split())

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

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

Verdicts: Time Limit Exceeded

Accepted
Problem: 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`.

Submission attempts (in order):
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")


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")


Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
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()

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




if __name__ == '__main__':
    main()

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
a,b,c,d = map(int,input().split())
if (c//a) >= (d//b):
 print("yes")
else:
 print("no")

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

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

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

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
import math
A,B,C,D =map(int,input().split())

T =math.ceil(C/B)
K =math.ceil(A/D)
if T <= K:
  print("Yes")
else:
  print("NO")



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

T =math.ceil(C/B)
K =math.ceil(A/D)
if T <= K:
  print("Yes")
else:
  print("No")

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
a,b,c,d = map(int, input().split())

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


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

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

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

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


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

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

Verdicts: Wrong Answer

Wrong Answer

Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
A,B,C,D = map(int,input().split())
if -A//D >= -C//B  :
  print('Yes')
else:
  print('No')


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


Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
#-*-coding:utf-8-*-

def main():
    a, b, c, d = map(int, input().split())
    aoki = c // b
    takahashi = (a // d)
    if aoki > takahashi:
        print("yes")
    else: 
        print("no")

    
if __name__ == '__main__':
    main()

#-*-coding:utf-8-*-

def main():
    a, b, c, d = map(int, input().split())
    e = -(-c // b)
    f = -(-a // d)
    if e > f:
        print("No")
    else: 
        print("Yes")
        
if __name__ == '__main__':
    main()

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
a=int(input())#takahashi
b=int(input())
c=int(input())#aoki
d=int(input())
flag=True
while flag:
    c-=b
    if(c<=0):
        flag=False
        print("Yes")
        break
        
    a-=d
    if(a<=0):
        falg=False
        print("No")
        break

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

Verdicts: Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
Thp,Tatk,Ahp,Aatk = map(int,input().split())

import math

Ta = math.ceil(Thp/Aatk)
Ao = math.ceil(Ahp/Tatk)

print(Ta,Ao)

if Ta >= Ao:
    print("Yes")
else:
    print("No")

Thp,Tatk,Ahp,Aatk = map(int,input().split())
 
import math
 
Ta = math.ceil(Thp/Aatk)
Ao = math.ceil(Ahp/Tatk)

if Ta >= Ao:
    print("Yes")
else:
    print("No")

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
hp_a,at_a,hp_b,at_b = map(int, input().split())


b_death = ((hp_b-0.01) // at_a) + 1
a_death = ((hp_a-0.01) // at_b) + 1


print(b_death,a_death)
if b_death > a_death:
  print("No")
else:
  print("Yes")

hp_a,at_a,hp_b,at_b = map(int, input().split())


b_death = ((hp_b-0.01) // at_a) + 1
a_death = ((hp_a-0.01) // at_b) + 1


if b_death > a_death:
  print("No")
else:
  print("Yes")

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
a, b, c, d = map(int, input().split())
if a * b + b * d > c * d:
    print("Yes")
else:
    print("No")


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


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


Verdicts: Wrong Answer

Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
A, B, C, D = map(int, input().split())

aoD = C // B
aoR = C % B
takD = A // D
takR = A % B

if aoD == takD:
    print('Yes') if takR >= aoR else print('No')
elif takD < aoD:
    print('Yes')
else:
    print('No')

import math

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

tak = math.ceil(C / B)
ao = math.ceil(A / D)

if tak <= ao:
    print('Yes')
else:
    print('No')

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
items=list(input().split())
    T_health=int(items[0])
    T_strength=int(items[1])
    A_health=int(items[2])
    A_strength=int(items[3])
    while(T_health>0 and A_health>0):
        A_health-=T_strength
        if(A_health>0):
            T_health-=A_strength
    if(T_health<=0):
        print("No")
    if(A_health<=0):
        print("Yes")

items=list(input.split())
    T_health=int(items[0])
    T_strength=int(items[1])
    A_health=int(items[2])
    A_strength=int(items[3])
    while(T_health>0 and A_health>0):
        A_health-=T_strength
        if(A_health>0):
            T_health-=A_strength
    if(T_health<=0):
        print("No")
    if(A_health<=0):
        print("Yes")

def solve():
    items=list(input().split())
    T_health=int(items[0])
    T_strength=int(items[1])
    A_health=int(items[2])
    A_strength=int(items[3])
    while(T_health>0 and A_health>0):
        A_health-=T_strength
        if(A_health>0):
            T_health-=A_strength
    if(T_health<=0):
        print("No")
    if(A_health<=0):
        print("Yes")
    return
solve()

Verdicts: Runtime Error

Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
a,b,c,d=map(int,input().split())
cnt=0
while True:
  cnt+=1
  if cnt%2==0:
    s=a-(cnt/2)*d
    if s<=0:
      print('No')
      
  else:
    s=c-(cnt+1)/2*b
    if s<=0:
      print('Yes')

a,b,c,d=map(int,input().split())
cnt=0
while True:
  cnt+=1
  if cnt%2==0:
    s=a-(cnt/2)*d
    if s<=0:
      print('No')
      break
      
  else:
    s=c-(cnt+1)/2*b
    if s<=0:
      print('Yes')
      break

Verdicts: Time Limit Exceeded

Accepted
Problem: 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`.

Submission attempts (in order):
a,b,c,d=map(int,input().split())

print(a,b,c,d)

x = c/b
y = a/d

if x > int(x):
    x+=1
    x=int(x)
if y > int(y):
    y+=1
    y=int(y)
print(x)
print(y)
if x <= y:
    print("Yes")
else:
    print("No")

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

x = c/b
y = a/d

if x > int(x):
    x+=1
    x=int(x)
if y > int(y):
    y+=1
    y=int(y)

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

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
a,b,c,d= map(int, input().split())
e=a//d
f=c//b
if a%d!=0:
  e+=1
if c%b!=0:
  f+=1
if e<=f:
  print("Yes")
else:
  print("No")
  


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

Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):
import math
A,B,C,D = map(int,input().split())
if (math.ceil(C/B) =< math.ceil(A/D)):
    print('Yes')
else:
    print('No')

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

Verdicts: Runtime Error

Accepted
Problem: 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`.

Submission attempts (in order):
a,b,c,d = map(int,input().split())

aoki = c - b
takahasi = a - d

for i in range(100):
  if i % 2 == 0:
    c -= b
    if c < 0:
      print('Yes')
      exit()
  elif i % 2 == 1:
    a -= d
    if a < 0:
      print('No')
      exit()

  
  

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

aoki = c - b
takahasi = a - d

for i in range(10000):
  if i % 2 == 0:
    c -= b
    if c <= 0:
      print('Yes')
      exit()
  elif i % 2 == 1:
    a -= d
    if a <= 0:
      print('No')
      exit()

  
  


Verdicts: Wrong Answer

Accepted
Problem: 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`.

Submission attempts (in order):

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

if senkou >= koukou:
    print("Yes")
else:
    print("No")


A,B,C,D = map(int,input().split())
senkou = C//B
koukou = A//D
if senkou <= koukou:
    print("Yes")
else:
    print("No")


A,B,C,D = map(int,input().split())
Senkou_N,Senkou_Amari = divmod(C,B)
if Senkou_Amari != 0:
    Senkou_N += 1
Koukou_N,Koukou_Amari = divmod(A,D)
if Koukou_Amari != 0:
    Koukou_N += 1

if Senkou_N <= Koukou_N:
    print("Yes")
else:
    print("No")

Verdicts: Wrong Answer

Wrong Answer

Accepted