message stringlengths 2 39.6k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 450 109k | cluster float64 2 2 | __index_level_0__ int64 900 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
n heroes fight against each other in the Arena. Initially, the i-th hero has level a_i.
Each minute, a fight between two different heroes occurs. These heroes can be chosen arbitrarily (it's even possible that it is the same two heroes that... | instruction | 0 | 8,577 | 2 | 17,154 |
Tags: implementation, sortings
Correct Solution:
```
import sys
from collections import defaultdict as dd
from collections import Counter as cc
from queue import Queue
import math
import itertools
try:
sys.stdin = open('input.txt', 'r')
sys.stdout = open('output.txt', 'w')
except:
pass
input = lambda: sys.stdin.buff... | output | 1 | 8,577 | 2 | 17,155 |
Provide tags and a correct Python 3 solution for this coding contest problem.
n heroes fight against each other in the Arena. Initially, the i-th hero has level a_i.
Each minute, a fight between two different heroes occurs. These heroes can be chosen arbitrarily (it's even possible that it is the same two heroes that... | instruction | 0 | 8,578 | 2 | 17,156 |
Tags: implementation, sortings
Correct Solution:
```
t=int(input())
while t:
n=int(input())
a=list(map(int,input().split()))
b=min(a)
out=0
for i in a:
if i>b:
out+=1
print(out)
t-=1
``` | output | 1 | 8,578 | 2 | 17,157 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
n heroes fight against each other in the Arena. Initially, the i-th hero has level a_i.
Each minute, a fight between two different heroes occurs. These heroes can be chosen arbitrarily (it's ev... | instruction | 0 | 8,579 | 2 | 17,158 |
Yes | output | 1 | 8,579 | 2 | 17,159 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
n heroes fight against each other in the Arena. Initially, the i-th hero has level a_i.
Each minute, a fight between two different heroes occurs. These heroes can be chosen arbitrarily (it's ev... | instruction | 0 | 8,580 | 2 | 17,160 |
Yes | output | 1 | 8,580 | 2 | 17,161 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
n heroes fight against each other in the Arena. Initially, the i-th hero has level a_i.
Each minute, a fight between two different heroes occurs. These heroes can be chosen arbitrarily (it's ev... | instruction | 0 | 8,581 | 2 | 17,162 |
Yes | output | 1 | 8,581 | 2 | 17,163 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
n heroes fight against each other in the Arena. Initially, the i-th hero has level a_i.
Each minute, a fight between two different heroes occurs. These heroes can be chosen arbitrarily (it's ev... | instruction | 0 | 8,582 | 2 | 17,164 |
Yes | output | 1 | 8,582 | 2 | 17,165 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
n heroes fight against each other in the Arena. Initially, the i-th hero has level a_i.
Each minute, a fight between two different heroes occurs. These heroes can be chosen arbitrarily (it's ev... | instruction | 0 | 8,583 | 2 | 17,166 |
No | output | 1 | 8,583 | 2 | 17,167 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
n heroes fight against each other in the Arena. Initially, the i-th hero has level a_i.
Each minute, a fight between two different heroes occurs. These heroes can be chosen arbitrarily (it's ev... | instruction | 0 | 8,584 | 2 | 17,168 |
No | output | 1 | 8,584 | 2 | 17,169 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
n heroes fight against each other in the Arena. Initially, the i-th hero has level a_i.
Each minute, a fight between two different heroes occurs. These heroes can be chosen arbitrarily (it's ev... | instruction | 0 | 8,585 | 2 | 17,170 |
No | output | 1 | 8,585 | 2 | 17,171 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
n heroes fight against each other in the Arena. Initially, the i-th hero has level a_i.
Each minute, a fight between two different heroes occurs. These heroes can be chosen arbitrarily (it's ev... | instruction | 0 | 8,586 | 2 | 17,172 |
No | output | 1 | 8,586 | 2 | 17,173 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A monster is attacking the Cyberland!
Master Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).
During the battle, every second the mo... | instruction | 0 | 9,455 | 2 | 18,910 |
Tags: binary search, brute force, implementation
Correct Solution:
```
h1,a1,d1 = map(int, input().split(' '))
h2,a2,d2 = map(int, input().split(' '))
H,A,D = map(int, input().split(' '))
ans = 100000000
for a in range(a1, 201) :
if a-d2 <= 0 : continue
for d in range(d1, 102) :
if a2-d <= 0 : ans = mi... | output | 1 | 9,455 | 2 | 18,911 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A monster is attacking the Cyberland!
Master Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).
During the battle, every second the mo... | instruction | 0 | 9,456 | 2 | 18,912 |
Tags: binary search, brute force, implementation
Correct Solution:
```
import math
hpy, atky, defy = map(int, input().split())
hpm, atkm, defm = map(int, input().split())
h,a,d = map(int, input().split())
ans = math.inf
for i in range(defy, 101):
for j in range(max(atky, defm+1), 201):
xx = math.ceil(hpm ... | output | 1 | 9,456 | 2 | 18,913 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A monster is attacking the Cyberland!
Master Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).
During the battle, every second the mo... | instruction | 0 | 9,457 | 2 | 18,914 |
Tags: binary search, brute force, implementation
Correct Solution:
```
R=lambda:map(int,input().split())
yH,yA,yD=R()
mH,mA,mD=R()
h,a,d=R()
Q=10**20
for A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):
for D in range(max(0,mA-yD)+1):
H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)
Q=min(A*a+D*d+max(0,h*(1-H)... | output | 1 | 9,457 | 2 | 18,915 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A monster is attacking the Cyberland!
Master Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).
During the battle, every second the mo... | instruction | 0 | 9,458 | 2 | 18,916 |
Tags: binary search, brute force, implementation
Correct Solution:
```
hy, ay, dy = map(int, input().split())
hm, am, dm = map(int, input().split())
h, a, d = map(int, input().split())
s = 1 << 30
for da in range(max(0, dm - ay + 1), max(0, hm - ay + dm) + 1):
for dd in range(max(0, am - dy) + 1):
dh = max(... | output | 1 | 9,458 | 2 | 18,917 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A monster is attacking the Cyberland!
Master Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).
During the battle, every second the mo... | instruction | 0 | 9,459 | 2 | 18,918 |
Tags: binary search, brute force, implementation
Correct Solution:
```
from math import *
#from bisect import *
#from collections import *
#from random import *
#from decimal import *"""
#from heapq import *
#from random import *
import sys
input=sys.stdin.readline
#sys.setrecursionlimit(3*(10**5))
global flag
def inp(... | output | 1 | 9,459 | 2 | 18,919 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A monster is attacking the Cyberland!
Master Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).
During the battle, every second the mo... | instruction | 0 | 9,460 | 2 | 18,920 |
Tags: binary search, brute force, implementation
Correct Solution:
```
R=lambda:map(int,input().split())
yH,yA,yD=R()
mH,mA,mD=R()
h,a,d=R()
Q=10**20
for A in range(max(0,mD-yA+1),max(0,mH+mD-yA)+1):
for D in range(max(0,mA-yD)+1):
H=yH-((mH+yA+A-mD-1)//(yA+A-mD))*max(0,mA-yD-D)
Q=min(A*a+D*d+max(0,h*(1-H)),Q)
pri... | output | 1 | 9,460 | 2 | 18,921 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A monster is attacking the Cyberland!
Master Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).
During the battle, every second the mo... | instruction | 0 | 9,461 | 2 | 18,922 |
Tags: binary search, brute force, implementation
Correct Solution:
```
H_y,A_y,D_y = map(int,input().split())
H_m,A_m,D_m = map(int,input().split())
h,a,d = map(int,input().split())
ans = 10**20
for A_buy in range(max(0,H_m+D_m-A_y)+1):
for D_buy in range(max(0,A_m-D_y)+1):
damage = A_y + A_buy - D_m
cost = A... | output | 1 | 9,461 | 2 | 18,923 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A monster is attacking the Cyberland!
Master Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power (DEF).
During the battle, every second the mo... | instruction | 0 | 9,462 | 2 | 18,924 |
Tags: binary search, brute force, implementation
Correct Solution:
```
# HEY STALKER
hp_y, at_y, df_y = map(int, input().split())
hp_m, at_m, df_m = map(int, input().split())
cst_hp, cst_at, cst_df = map(int, input().split())
ans = 2e18
for ati in range(201):
for dfi in range(201):
if ati + at_y > df_m:
... | output | 1 | 9,462 | 2 | 18,925 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A monster is attacking the Cyberland!
Master Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power... | instruction | 0 | 9,463 | 2 | 18,926 |
Yes | output | 1 | 9,463 | 2 | 18,927 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A monster is attacking the Cyberland!
Master Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power... | instruction | 0 | 9,464 | 2 | 18,928 |
Yes | output | 1 | 9,464 | 2 | 18,929 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A monster is attacking the Cyberland!
Master Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power... | instruction | 0 | 9,465 | 2 | 18,930 |
Yes | output | 1 | 9,465 | 2 | 18,931 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A monster is attacking the Cyberland!
Master Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power... | instruction | 0 | 9,466 | 2 | 18,932 |
No | output | 1 | 9,466 | 2 | 18,933 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A monster is attacking the Cyberland!
Master Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power... | instruction | 0 | 9,467 | 2 | 18,934 |
No | output | 1 | 9,467 | 2 | 18,935 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A monster is attacking the Cyberland!
Master Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power... | instruction | 0 | 9,468 | 2 | 18,936 |
No | output | 1 | 9,468 | 2 | 18,937 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A monster is attacking the Cyberland!
Master Yang, a braver, is going to beat the monster. Yang and the monster each have 3 attributes: hitpoints (HP), offensive power (ATK) and defensive power... | instruction | 0 | 9,469 | 2 | 18,938 |
No | output | 1 | 9,469 | 2 | 18,939 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya plays the Geometry Horse.
The game goal is to destroy geometric figures of the game world. A certain number of points is given for destroying each figure depending on the figure type and the current factor value.
There are n types o... | instruction | 0 | 10,223 | 2 | 20,446 |
Tags: greedy, implementation, sortings, two pointers
Correct Solution:
```
import sys
def solve():
n, = rv()
figures = list()
before = 0
for i in range(n):
number, cost, = rv()
figures.append([cost, number, before, before + number])
figures.sort()
for i in range(n):
numb... | output | 1 | 10,223 | 2 | 20,447 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya plays the Geometry Horse.
The game goal is to destroy geometric figures of the game world. A certain number of points is given for destroying each figure depending on the figure type and the current factor value.
There are n types o... | instruction | 0 | 10,224 | 2 | 20,448 |
Tags: greedy, implementation, sortings, two pointers
Correct Solution:
```
n=int(input())
a=[list(map(int,input().split()))[::-1] for i in range(n)]
t=int(input())
p=list(map(int,input().split()))
b=0
i=0
a.sort()
c=0
for j in range(n):
while i<t and p[i]-b<=a[j][1]:
c+=(p[i]-b)*(i+1)*a[j][0]
a[j][1... | output | 1 | 10,224 | 2 | 20,449 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya plays the Geometry Horse.
The game goal is to destroy geometric figures of the game world. A certain number of points is given for destroying each figure depending on the figure type and the current factor value.
There are n types o... | instruction | 0 | 10,225 | 2 | 20,450 |
Tags: greedy, implementation, sortings, two pointers
Correct Solution:
```
import sys
def solve():
n, = rv()
figures = list()
before = 0
for i in range(n):
number, cost, = rv()
figures.append([cost, number, before, before + number])
figures.sort()
for i in range(n):
numb... | output | 1 | 10,225 | 2 | 20,451 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya plays the Geometry Horse.
The game goal is to destroy geometric figures of the game world. A certain number of points is given for destroying each figure depending on the figure type and the current factor value.
There are n types o... | instruction | 0 | 10,226 | 2 | 20,452 |
Tags: greedy, implementation, sortings, two pointers
Correct Solution:
```
if __name__ == '__main__':
n = int(input())
pieces = [input() for _ in range(n)]
pieces = [_.split() for _ in pieces]
pieces = [tuple(_) for _ in pieces]
pieces = [[int(k), int(c)] for k, c in pieces]
t = int(input())
... | output | 1 | 10,226 | 2 | 20,453 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya plays the Geometry Horse.
The game goal is to destroy geometric figures of the game world. A certain number of points is given for destroying each figure depending on the figure type and the current factor value.
There are n types o... | instruction | 0 | 10,227 | 2 | 20,454 |
Tags: greedy, implementation, sortings, two pointers
Correct Solution:
```
n = int(input())
figures = []
for _ in range(n):
amount, cost = map(int, input().split())
figures += [(cost, amount)]
figures.sort()
t = int(input())
T = list(map(int, input().split()))
result = 0
destructed = 0
i, j = 0, 0
while... | output | 1 | 10,227 | 2 | 20,455 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya plays the Geometry Horse.
The game goal is to destroy geometric figures of the game world. A certain number of points is given for destroying each figure depending on the figure type and the current factor value.
There are n types o... | instruction | 0 | 10,228 | 2 | 20,456 |
Tags: greedy, implementation, sortings, two pointers
Correct Solution:
```
n = int(input())
fig = [tuple(map(int, input().split()))[::-1] for _ in range(n)]
fig.sort()
t = int(input())
a = list(map(int, input().split()))
res, curr = 0, 0
i, j = 0, 0
while i < n:
if j < t and curr + fig[i][1] >= a[j]:
take ... | output | 1 | 10,228 | 2 | 20,457 |
Provide a correct Python 3 solution for this coding contest problem.
Raccoon is fighting with a monster.
The health of the monster is H.
Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way to decrease the monster's health.
Raccoon wins when the ... | instruction | 0 | 10,550 | 2 | 21,100 |
"Correct Solution:
```
H, N = map(int, input().split())
l = list(map(int, input().split()))
print('Yes' if H <= sum(l) else 'No')
``` | output | 1 | 10,550 | 2 | 21,101 |
Provide a correct Python 3 solution for this coding contest problem.
Raccoon is fighting with a monster.
The health of the monster is H.
Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way to decrease the monster's health.
Raccoon wins when the ... | instruction | 0 | 10,551 | 2 | 21,102 |
"Correct Solution:
```
H, N = map(int, input().split())
PP = list(map(int, input().split()))
print("Yes" if sum(PP) >= H else "No")
``` | output | 1 | 10,551 | 2 | 21,103 |
Provide a correct Python 3 solution for this coding contest problem.
Raccoon is fighting with a monster.
The health of the monster is H.
Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way to decrease the monster's health.
Raccoon wins when the ... | instruction | 0 | 10,552 | 2 | 21,104 |
"Correct Solution:
```
H, N = map(int, input().split())
a = sum(map(int, input().split()))
print("Yes" if a >= H else "No")
``` | output | 1 | 10,552 | 2 | 21,105 |
Provide a correct Python 3 solution for this coding contest problem.
Raccoon is fighting with a monster.
The health of the monster is H.
Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way to decrease the monster's health.
Raccoon wins when the ... | instruction | 0 | 10,553 | 2 | 21,106 |
"Correct Solution:
```
h, n, *a = map(int, open(0).read().split())
if sum(a) >= h:
print("Yes")
else:
print("No")
``` | output | 1 | 10,553 | 2 | 21,107 |
Provide a correct Python 3 solution for this coding contest problem.
Raccoon is fighting with a monster.
The health of the monster is H.
Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way to decrease the monster's health.
Raccoon wins when the ... | instruction | 0 | 10,554 | 2 | 21,108 |
"Correct Solution:
```
h,n=map(int,input().split())
A=list(map(int,input().split()))
print("Yes" if h<=sum(A) else "No")
``` | output | 1 | 10,554 | 2 | 21,109 |
Provide a correct Python 3 solution for this coding contest problem.
Raccoon is fighting with a monster.
The health of the monster is H.
Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way to decrease the monster's health.
Raccoon wins when the ... | instruction | 0 | 10,555 | 2 | 21,110 |
"Correct Solution:
```
h,n = map(int,input().split())
a =[int(i) for i in input().split()]
print("Yes" if sum(a) >= h else "No")
``` | output | 1 | 10,555 | 2 | 21,111 |
Provide a correct Python 3 solution for this coding contest problem.
Raccoon is fighting with a monster.
The health of the monster is H.
Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way to decrease the monster's health.
Raccoon wins when the ... | instruction | 0 | 10,556 | 2 | 21,112 |
"Correct Solution:
```
H,N=map(int,input().split())
A=[int(i) for i in input().split()]
print('Yes' if H<=sum(A) else "No")
``` | output | 1 | 10,556 | 2 | 21,113 |
Provide a correct Python 3 solution for this coding contest problem.
Raccoon is fighting with a monster.
The health of the monster is H.
Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way to decrease the monster's health.
Raccoon wins when the ... | instruction | 0 | 10,557 | 2 | 21,114 |
"Correct Solution:
```
h,n = map(int,input().split())
a = list(map(int,input().split()))
print(["No","Yes"][sum(a) >= h])
``` | output | 1 | 10,557 | 2 | 21,115 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Raccoon is fighting with a monster.
The health of the monster is H.
Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way t... | instruction | 0 | 10,558 | 2 | 21,116 |
Yes | output | 1 | 10,558 | 2 | 21,117 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Raccoon is fighting with a monster.
The health of the monster is H.
Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way t... | instruction | 0 | 10,559 | 2 | 21,118 |
Yes | output | 1 | 10,559 | 2 | 21,119 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Raccoon is fighting with a monster.
The health of the monster is H.
Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way t... | instruction | 0 | 10,560 | 2 | 21,120 |
Yes | output | 1 | 10,560 | 2 | 21,121 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Raccoon is fighting with a monster.
The health of the monster is H.
Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way t... | instruction | 0 | 10,561 | 2 | 21,122 |
Yes | output | 1 | 10,561 | 2 | 21,123 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Raccoon is fighting with a monster.
The health of the monster is H.
Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way t... | instruction | 0 | 10,562 | 2 | 21,124 |
No | output | 1 | 10,562 | 2 | 21,125 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Raccoon is fighting with a monster.
The health of the monster is H.
Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way t... | instruction | 0 | 10,563 | 2 | 21,126 |
No | output | 1 | 10,563 | 2 | 21,127 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Raccoon is fighting with a monster.
The health of the monster is H.
Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way t... | instruction | 0 | 10,564 | 2 | 21,128 |
No | output | 1 | 10,564 | 2 | 21,129 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Raccoon is fighting with a monster.
The health of the monster is H.
Raccoon can use N kinds of special moves. Using the i-th move decreases the monster's health by A_i. There is no other way t... | instruction | 0 | 10,565 | 2 | 21,130 |
No | output | 1 | 10,565 | 2 | 21,131 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n castles in the Lannister's Kingdom and some walls connect two castles, no two castles are connected by more than one wall, no wall connects a castle to itself.
Sir Jaime Lannister ... | instruction | 0 | 11,317 | 2 | 22,634 |
No | output | 1 | 11,317 | 2 | 22,635 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n castles in the Lannister's Kingdom and some walls connect two castles, no two castles are connected by more than one wall, no wall connects a castle to itself.
Sir Jaime Lannister ... | instruction | 0 | 11,318 | 2 | 22,636 |
No | output | 1 | 11,318 | 2 | 22,637 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n castles in the Lannister's Kingdom and some walls connect two castles, no two castles are connected by more than one wall, no wall connects a castle to itself.
Sir Jaime Lannister ... | instruction | 0 | 11,319 | 2 | 22,638 |
No | output | 1 | 11,319 | 2 | 22,639 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.