message stringlengths 2 45.8k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 254 108k | cluster float64 3 3 | __index_level_0__ int64 508 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a system of pipes. It consists of two rows, each row consists of n pipes. The top left pipe has the coordinates (1, 1) and the bottom right — (2, n).
There are six types of pipes: two types of straight pipes and four types of ... | instruction | 0 | 60,740 | 3 | 121,480 |
Tags: dp, implementation
Correct Solution:
```
def fastio():
import sys
from io import StringIO
from atexit import register
global input
sys.stdin = StringIO(sys.stdin.read())
input = lambda : sys.stdin.readline().rstrip('\r\n')
sys.stdout = StringIO()
register(lambda : sys.__stdout__.write(sys.stdout.getvalue... | output | 1 | 60,740 | 3 | 121,481 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a system of pipes. It consists of two rows, each row consists of n pipes. The top left pipe has the coordinates (1, 1) and the bottom right — (2, n).
There are six types of pipes: two types of straight pipes and four types of ... | instruction | 0 | 60,741 | 3 | 121,482 |
Tags: dp, implementation
Correct Solution:
```
t = int(input())
for _ in range(t):
n = int(input())
path = []
for i in range(2):
path.append([int(p) for p in list(input())])
for i in range(2):
for j in range(n):
if path[i][j] <= 2:
path[i][j] = 0
else:
path[i][j] = 1
i, j = 0, 0
ok = False
whil... | output | 1 | 60,741 | 3 | 121,483 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a system of pipes. It consists of two rows, each row consists of n pipes. The top left pipe has the coordinates (1, 1) and the bottom right — (2, n).
There are six types of pipes: two types of straight pipes and four types of ... | instruction | 0 | 60,742 | 3 | 121,484 |
Tags: dp, implementation
Correct Solution:
```
from sys import stdin
def main():
l = stdin.read().splitlines()
l, l1 = l[2::3], l[3::3]
for i, ab in enumerate(zip(l, l1)):
p = 4
for a, b in zip(*ab):
p = (0, 0, 0, 0, 8, 0, 4, 4, 4, 8, 0, 8)[(a < '3') * 2 + (b < '3') + p]
... | output | 1 | 60,742 | 3 | 121,485 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a system of pipes. It consists of two rows, each row consists of n pipes. The top left pipe has the coordinates (1, 1) and the bottom right — (2, n).
There are six types of pipes: two types of straight pipes and four types of ... | instruction | 0 | 60,743 | 3 | 121,486 |
Tags: dp, implementation
Correct Solution:
```
q = int(input())
Tube = list()
line = set('12')
sqr = set('3456')
for i in range(q):
n = int(input())
Tube.clear()
myX = 2
myY = n - 1
backX = 2
backY = n
backTube = '1'
Tube.append('0')
Tube.append(input())
Tube.append(input())
... | output | 1 | 60,743 | 3 | 121,487 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a system of pipes. It consists of two rows, each row consists of n pipes. The top left pipe has the coordinates (1, 1) and the bottom right — (2, n).
There are six types of pipes: two types of straight pipes and four types of ... | instruction | 0 | 60,744 | 3 | 121,488 |
Tags: dp, implementation
Correct Solution:
```
# import itertools
# import bisect
# import math
from collections import defaultdict, Counter
import os
import sys
from io import BytesIO, IOBase
# sys.setrecursionlimit(10 ** 5)
ii = lambda: int(input())
lmii = lambda: list(map(int, input().split()))
slmii = lambda: sort... | output | 1 | 60,744 | 3 | 121,489 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a system of pipes. It consists of two rows, each row consists of n pipes. The top left pipe has the coordinates (1, 1) and the bottom right — (2, n).
There are six types of pipes:... | instruction | 0 | 60,745 | 3 | 121,490 |
Yes | output | 1 | 60,745 | 3 | 121,491 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a system of pipes. It consists of two rows, each row consists of n pipes. The top left pipe has the coordinates (1, 1) and the bottom right — (2, n).
There are six types of pipes:... | instruction | 0 | 60,746 | 3 | 121,492 |
Yes | output | 1 | 60,746 | 3 | 121,493 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a system of pipes. It consists of two rows, each row consists of n pipes. The top left pipe has the coordinates (1, 1) and the bottom right — (2, n).
There are six types of pipes:... | instruction | 0 | 60,747 | 3 | 121,494 |
Yes | output | 1 | 60,747 | 3 | 121,495 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a system of pipes. It consists of two rows, each row consists of n pipes. The top left pipe has the coordinates (1, 1) and the bottom right — (2, n).
There are six types of pipes:... | instruction | 0 | 60,748 | 3 | 121,496 |
Yes | output | 1 | 60,748 | 3 | 121,497 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a system of pipes. It consists of two rows, each row consists of n pipes. The top left pipe has the coordinates (1, 1) and the bottom right — (2, n).
There are six types of pipes:... | instruction | 0 | 60,749 | 3 | 121,498 |
No | output | 1 | 60,749 | 3 | 121,499 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a system of pipes. It consists of two rows, each row consists of n pipes. The top left pipe has the coordinates (1, 1) and the bottom right — (2, n).
There are six types of pipes:... | instruction | 0 | 60,750 | 3 | 121,500 |
No | output | 1 | 60,750 | 3 | 121,501 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a system of pipes. It consists of two rows, each row consists of n pipes. The top left pipe has the coordinates (1, 1) and the bottom right — (2, n).
There are six types of pipes:... | instruction | 0 | 60,751 | 3 | 121,502 |
No | output | 1 | 60,751 | 3 | 121,503 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a system of pipes. It consists of two rows, each row consists of n pipes. The top left pipe has the coordinates (1, 1) and the bottom right — (2, n).
There are six types of pipes:... | instruction | 0 | 60,752 | 3 | 121,504 |
No | output | 1 | 60,752 | 3 | 121,505 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Chris is bored during his physics lessons (too easy), so he has built a toy box to keep himself occupied. The box is special, since it has the ability to change gravity.
There are n colu... | instruction | 0 | 61,028 | 3 | 122,056 |
No | output | 1 | 61,028 | 3 | 122,057 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Chris is bored during his physics lessons (too easy), so he has built a toy box to keep himself occupied. The box is special, since it has the ability to change gravity.
There are n colu... | instruction | 0 | 61,029 | 3 | 122,058 |
No | output | 1 | 61,029 | 3 | 122,059 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It is winter now, and Max decided it's about time he watered the garden.
The garden can be represented as n consecutive garden beds, numbered from 1 to n. k beds contain water taps (i-th tap is... | instruction | 0 | 61,219 | 3 | 122,438 |
Yes | output | 1 | 61,219 | 3 | 122,439 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It is winter now, and Max decided it's about time he watered the garden.
The garden can be represented as n consecutive garden beds, numbered from 1 to n. k beds contain water taps (i-th tap is... | instruction | 0 | 61,220 | 3 | 122,440 |
Yes | output | 1 | 61,220 | 3 | 122,441 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It is winter now, and Max decided it's about time he watered the garden.
The garden can be represented as n consecutive garden beds, numbered from 1 to n. k beds contain water taps (i-th tap is... | instruction | 0 | 61,221 | 3 | 122,442 |
Yes | output | 1 | 61,221 | 3 | 122,443 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It is winter now, and Max decided it's about time he watered the garden.
The garden can be represented as n consecutive garden beds, numbered from 1 to n. k beds contain water taps (i-th tap is... | instruction | 0 | 61,222 | 3 | 122,444 |
Yes | output | 1 | 61,222 | 3 | 122,445 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It is winter now, and Max decided it's about time he watered the garden.
The garden can be represented as n consecutive garden beds, numbered from 1 to n. k beds contain water taps (i-th tap is... | instruction | 0 | 61,223 | 3 | 122,446 |
No | output | 1 | 61,223 | 3 | 122,447 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It is winter now, and Max decided it's about time he watered the garden.
The garden can be represented as n consecutive garden beds, numbered from 1 to n. k beds contain water taps (i-th tap is... | instruction | 0 | 61,224 | 3 | 122,448 |
No | output | 1 | 61,224 | 3 | 122,449 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It is winter now, and Max decided it's about time he watered the garden.
The garden can be represented as n consecutive garden beds, numbered from 1 to n. k beds contain water taps (i-th tap is... | instruction | 0 | 61,225 | 3 | 122,450 |
No | output | 1 | 61,225 | 3 | 122,451 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It is winter now, and Max decided it's about time he watered the garden.
The garden can be represented as n consecutive garden beds, numbered from 1 to n. k beds contain water taps (i-th tap is... | instruction | 0 | 61,226 | 3 | 122,452 |
No | output | 1 | 61,226 | 3 | 122,453 |
Provide a correct Python 3 solution for this coding contest problem.
A plurality of trampolines are arranged in a line at 10 m intervals. Each trampoline has its own maximum horizontal distance within which the jumper can jump safely. Starting from the left-most trampoline, the jumper jumps to another trampoline withi... | instruction | 0 | 61,397 | 3 | 122,794 |
"Correct Solution:
```
N, *D = map(int, open(0).read().split())
ok = 1
e = 0
for i in range(N):
if e < i:
ok = 0
e = max(e, i+D[i]//10)
e = N-1
for i in range(N-1, -1, -1):
if e > i:
ok = 0
e = min(e, i-D[i]//10)
print("yes" if ok else "no")
``` | output | 1 | 61,397 | 3 | 122,795 |
Provide a correct Python 3 solution for this coding contest problem.
A plurality of trampolines are arranged in a line at 10 m intervals. Each trampoline has its own maximum horizontal distance within which the jumper can jump safely. Starting from the left-most trampoline, the jumper jumps to another trampoline withi... | instruction | 0 | 61,398 | 3 | 122,796 |
"Correct Solution:
```
N = int(input())
a = []
for i in range(N):
a.append(int(input())//10)
max_dist = 0
for i in range(N):
if max_dist >= i:
max_dist = max(max_dist, i + a[i])
if max_dist >= N-1:
max_dist = 0
for i in range(N):
if max_dist >= i:
max_dist = max(max_di... | output | 1 | 61,398 | 3 | 122,797 |
Provide a correct Python 3 solution for this coding contest problem.
A plurality of trampolines are arranged in a line at 10 m intervals. Each trampoline has its own maximum horizontal distance within which the jumper can jump safely. Starting from the left-most trampoline, the jumper jumps to another trampoline withi... | instruction | 0 | 61,399 | 3 | 122,798 |
"Correct Solution:
```
n = int(input())
d = [int(input())for i in range(n)]
ok1 = True
nowmx = 0
for i in range(n-1):
if i > nowmx:
ok1 = False
break
x = i+d[i]//10#いける右端のトランポリ
if x >= nowmx:
nowmx = x
if nowmx < n-1:ok1 = False
d = d[::-1]
ok2 = True
nowmx = 0
for i in range(n-1... | output | 1 | 61,399 | 3 | 122,799 |
Provide a correct Python 3 solution for this coding contest problem.
A plurality of trampolines are arranged in a line at 10 m intervals. Each trampoline has its own maximum horizontal distance within which the jumper can jump safely. Starting from the left-most trampoline, the jumper jumps to another trampoline withi... | instruction | 0 | 61,400 | 3 | 122,800 |
"Correct Solution:
```
import sys
input = sys.stdin.readline
def judge():
l = [10*i+d[i] for i in range(N)]
for i in range(1, N):
l[i] = max(l[i], l[i-1])
now = 0
for _ in range(N-1):
now = l[now//10]
if now>=10*(N-1):
return True
ret... | output | 1 | 61,400 | 3 | 122,801 |
Provide a correct Python 3 solution for this coding contest problem.
A plurality of trampolines are arranged in a line at 10 m intervals. Each trampoline has its own maximum horizontal distance within which the jumper can jump safely. Starting from the left-most trampoline, the jumper jumps to another trampoline withi... | instruction | 0 | 61,401 | 3 | 122,802 |
"Correct Solution:
```
n = int(input())
trs = [int(input()) for _ in range(n)]
cum = []
cannot = False
acc = 0
for i in range(n):
acc = max(acc, i + trs[i] // 10)
acc = min(acc, n - 1)
cum.append(acc)
rev = []
acc = 0
for i in range(n):
acc = max(acc, i + trs[n - 1 - i] // 10)
acc = min(acc, n - 1)
rev.a... | output | 1 | 61,401 | 3 | 122,803 |
Provide a correct Python 3 solution for this coding contest problem.
A plurality of trampolines are arranged in a line at 10 m intervals. Each trampoline has its own maximum horizontal distance within which the jumper can jump safely. Starting from the left-most trampoline, the jumper jumps to another trampoline withi... | instruction | 0 | 61,402 | 3 | 122,804 |
"Correct Solution:
```
n = int(input())
j = 0
t = 10
for i in range(n):
if j < i:
print("no")
break
d = int(input())
j += d // 10
if d < t:
t += 10
elif d >= t:
t = 10
else:
if t == 10:
print("yes")
else:
print("no")
``` | output | 1 | 61,402 | 3 | 122,805 |
Provide a correct Python 3 solution for this coding contest problem.
A plurality of trampolines are arranged in a line at 10 m intervals. Each trampoline has its own maximum horizontal distance within which the jumper can jump safely. Starting from the left-most trampoline, the jumper jumps to another trampoline withi... | instruction | 0 | 61,403 | 3 | 122,806 |
"Correct Solution:
```
n = 0
bounce = []
def IsReachable() :
current = 0
for i in range(n) :
if current < 10*i : return False
current = max( current, 10*i + bounce[i] )
if current >= 10*n : return True
return False
n = int(input())
for i in range(n) :
bounce.append( int(input()... | output | 1 | 61,403 | 3 | 122,807 |
Provide a correct Python 3 solution for this coding contest problem.
A plurality of trampolines are arranged in a line at 10 m intervals. Each trampoline has its own maximum horizontal distance within which the jumper can jump safely. Starting from the left-most trampoline, the jumper jumps to another trampoline withi... | instruction | 0 | 61,404 | 3 | 122,808 |
"Correct Solution:
```
n = int(input())
a = [int(input()) for i in range(n)]
ok = True
rg = range(n)
l = 0
for i,d in zip(rg,a):
if i*10 > l:
ok = False
break
if l >= (n-1)*10:
break
if i*10+d > l:
l = i*10+d
a.reverse()
l = 0
for i,d in zip(rg,a):
if i*10 > l:
... | output | 1 | 61,404 | 3 | 122,809 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A plurality of trampolines are arranged in a line at 10 m intervals. Each trampoline has its own maximum horizontal distance within which the jumper can jump safely. Starting from the left-most ... | instruction | 0 | 61,405 | 3 | 122,810 |
Yes | output | 1 | 61,405 | 3 | 122,811 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A plurality of trampolines are arranged in a line at 10 m intervals. Each trampoline has its own maximum horizontal distance within which the jumper can jump safely. Starting from the left-most ... | instruction | 0 | 61,406 | 3 | 122,812 |
No | output | 1 | 61,406 | 3 | 122,813 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A plurality of trampolines are arranged in a line at 10 m intervals. Each trampoline has its own maximum horizontal distance within which the jumper can jump safely. Starting from the left-most ... | instruction | 0 | 61,407 | 3 | 122,814 |
No | output | 1 | 61,407 | 3 | 122,815 |
Provide a correct Python 3 solution for this coding contest problem.
<!--
Problem C
-->
Balance Scale
You, an experimental chemist, have a balance scale and a kit of weights for measuring weights of powder chemicals.
For work efficiency, a single use of the balance scale should be enough for measurement of each a... | instruction | 0 | 61,431 | 3 | 122,862 |
"Correct Solution:
```
def main():
n,m = map(int,input().split())
if n*m == 0: return False
a = list(map(int, input().split()))
w = list(map(int,input().split()))
d = {0:1}
for i in w:
new_d = dict(d)
for j in d.keys():
new_d[j+i] = 1
new_d[abs(j-i)] = 1
... | output | 1 | 61,431 | 3 | 122,863 |
Provide a correct Python 3 solution for this coding contest problem.
<!--
Problem C
-->
Balance Scale
You, an experimental chemist, have a balance scale and a kit of weights for measuring weights of powder chemicals.
For work efficiency, a single use of the balance scale should be enough for measurement of each a... | instruction | 0 | 61,432 | 3 | 122,864 |
"Correct Solution:
```
from collections import defaultdict
def solve(N, M, A, W):
S = set([0])
for w in W:
T = set()
for s in S:
T.add(s); T.add(s + w); T.add(s - w)
S = T
C = defaultdict(int)
L = None
for a in A:
if a not in S:
if L is None:
... | output | 1 | 61,432 | 3 | 122,865 |
Provide a correct Python 3 solution for this coding contest problem.
<!--
Problem C
-->
Balance Scale
You, an experimental chemist, have a balance scale and a kit of weights for measuring weights of powder chemicals.
For work efficiency, a single use of the balance scale should be enough for measurement of each a... | instruction | 0 | 61,433 | 3 | 122,866 |
"Correct Solution:
```
while True:
n, m = list(map(int, input().split()))
if n == 0 and m == 0:
break
medicines = set(map(int, input().split()))
weights = list(map(int, input().split()))
possibles = {0}
for i in weights:
pre = possibles.copy()
for j in possibles:
... | output | 1 | 61,433 | 3 | 122,867 |
Provide a correct Python 3 solution for this coding contest problem.
<!--
Problem C
-->
Balance Scale
You, an experimental chemist, have a balance scale and a kit of weights for measuring weights of powder chemicals.
For work efficiency, a single use of the balance scale should be enough for measurement of each a... | instruction | 0 | 61,434 | 3 | 122,868 |
"Correct Solution:
```
#!/usr/bin/python3
import array
from fractions import Fraction
import functools
import itertools
import math
import os
import sys
def main():
while True:
N, M = read_ints()
if (N, M) == (0, 0):
break
A = read_ints()
W = read_ints()
print(... | output | 1 | 61,434 | 3 | 122,869 |
Provide a correct Python 3 solution for this coding contest problem.
<!--
Problem C
-->
Balance Scale
You, an experimental chemist, have a balance scale and a kit of weights for measuring weights of powder chemicals.
For work efficiency, a single use of the balance scale should be enough for measurement of each a... | instruction | 0 | 61,435 | 3 | 122,870 |
"Correct Solution:
```
from bisect import bisect_left, bisect_right
while True:
n, m = map(int, input().split())
if n == m == 0:
break
a = list(map(int, input().split()))
w = list(map(int, input().split()))
Set = set()
def go(i, weight):
if i == m:
Set.add(weight)
... | output | 1 | 61,435 | 3 | 122,871 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bob has put on some weight recently. In order to lose weight a bit, Bob has decided to swim regularly in the pool. However, the day before he went to the pool for the first time he had a weird d... | instruction | 0 | 61,487 | 3 | 122,974 |
No | output | 1 | 61,487 | 3 | 122,975 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bob is playing a game of Spaceship Solitaire. The goal of this game is to build a spaceship. In order to do this, he first needs to accumulate enough resources for the construction. There are n ... | instruction | 0 | 61,595 | 3 | 123,190 |
Yes | output | 1 | 61,595 | 3 | 123,191 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bob is playing a game of Spaceship Solitaire. The goal of this game is to build a spaceship. In order to do this, he first needs to accumulate enough resources for the construction. There are n ... | instruction | 0 | 61,596 | 3 | 123,192 |
Yes | output | 1 | 61,596 | 3 | 123,193 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bob is playing a game of Spaceship Solitaire. The goal of this game is to build a spaceship. In order to do this, he first needs to accumulate enough resources for the construction. There are n ... | instruction | 0 | 61,597 | 3 | 123,194 |
Yes | output | 1 | 61,597 | 3 | 123,195 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bob is playing a game of Spaceship Solitaire. The goal of this game is to build a spaceship. In order to do this, he first needs to accumulate enough resources for the construction. There are n ... | instruction | 0 | 61,598 | 3 | 123,196 |
Yes | output | 1 | 61,598 | 3 | 123,197 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bob is playing a game of Spaceship Solitaire. The goal of this game is to build a spaceship. In order to do this, he first needs to accumulate enough resources for the construction. There are n ... | instruction | 0 | 61,599 | 3 | 123,198 |
No | output | 1 | 61,599 | 3 | 123,199 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bob is playing a game of Spaceship Solitaire. The goal of this game is to build a spaceship. In order to do this, he first needs to accumulate enough resources for the construction. There are n ... | instruction | 0 | 61,600 | 3 | 123,200 |
No | output | 1 | 61,600 | 3 | 123,201 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bob is playing a game of Spaceship Solitaire. The goal of this game is to build a spaceship. In order to do this, he first needs to accumulate enough resources for the construction. There are n ... | instruction | 0 | 61,601 | 3 | 123,202 |
No | output | 1 | 61,601 | 3 | 123,203 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You've got a robot, its task is destroying bombs on a square plane. Specifically, the square plane contains n bombs, the i-th bomb is at point with coordinates (xi, yi). We know that no two bomb... | instruction | 0 | 61,764 | 3 | 123,528 |
Yes | output | 1 | 61,764 | 3 | 123,529 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You've got a robot, its task is destroying bombs on a square plane. Specifically, the square plane contains n bombs, the i-th bomb is at point with coordinates (xi, yi). We know that no two bomb... | instruction | 0 | 61,765 | 3 | 123,530 |
Yes | output | 1 | 61,765 | 3 | 123,531 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You've got a robot, its task is destroying bombs on a square plane. Specifically, the square plane contains n bombs, the i-th bomb is at point with coordinates (xi, yi). We know that no two bomb... | instruction | 0 | 61,766 | 3 | 123,532 |
Yes | output | 1 | 61,766 | 3 | 123,533 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.