message stringlengths 2 44.5k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 276 109k | cluster float64 23 23 | __index_level_0__ int64 552 217k |
|---|---|---|---|---|---|
Provide a correct Python 3 solution for this coding contest problem.
Given are a positive integer N and a sequence of length 2^N consisting of 0s and 1s: A_0,A_1,\ldots,A_{2^N-1}. Determine whether there exists a closed curve C that satisfies the condition below for all 2^N sets S \subseteq \\{0,1,\ldots,N-1 \\}. If t... | instruction | 0 | 42,665 | 23 | 85,330 |
"Correct Solution:
```
res = []
n = int(input())
a = [int(c) for c in input()]
def solve():
if a[0] == 0:
return False
for x in range(1, 2**n):
s = list(filter(lambda i: (x >> i) & 1, range(n)))
xl = [(x >> i) & 1 for i in range(n)]
if a[x] == 0:
for d in s:
... | output | 1 | 42,665 | 23 | 85,331 |
Provide a correct Python 3 solution for this coding contest problem.
Given are a positive integer N and a sequence of length 2^N consisting of 0s and 1s: A_0,A_1,\ldots,A_{2^N-1}. Determine whether there exists a closed curve C that satisfies the condition below for all 2^N sets S \subseteq \\{0,1,\ldots,N-1 \\}. If t... | instruction | 0 | 42,666 | 23 | 85,332 |
"Correct Solution:
```
n = int(input())
a = [int(x) for x in input()]
holes = []
for i in range(2**n):
if a[i] == 1:
continue
for j in range(i+1, 2**n):
if (j | i) == j and a[j] == 1:
print("Impossible")
exit()
if any((k | i) == i for k in holes):
continue
... | output | 1 | 42,666 | 23 | 85,333 |
Provide a correct Python 3 solution for this coding contest problem.
Given are a positive integer N and a sequence of length 2^N consisting of 0s and 1s: A_0,A_1,\ldots,A_{2^N-1}. Determine whether there exists a closed curve C that satisfies the condition below for all 2^N sets S \subseteq \\{0,1,\ldots,N-1 \\}. If t... | instruction | 0 | 42,667 | 23 | 85,334 |
"Correct Solution:
```
import sys
from heapq import *
def first_1(x):
if x:
i = 0
while x & 1 == 0:
x >>= 1
i += 1
return i
def sep_single(s):
if s:
r = 1 << (s.bit_length()-1)
i = s.bit_length()-1
while s:
if r & s:
yield -i, r
s ^= r
r >>= 1
... | output | 1 | 42,667 | 23 | 85,335 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given are a positive integer N and a sequence of length 2^N consisting of 0s and 1s: A_0,A_1,\ldots,A_{2^N-1}. Determine whether there exists a closed curve C that satisfies the condition below ... | instruction | 0 | 42,668 | 23 | 85,336 |
No | output | 1 | 42,668 | 23 | 85,337 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given are a positive integer N and a sequence of length 2^N consisting of 0s and 1s: A_0,A_1,\ldots,A_{2^N-1}. Determine whether there exists a closed curve C that satisfies the condition below ... | instruction | 0 | 42,669 | 23 | 85,338 |
No | output | 1 | 42,669 | 23 | 85,339 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given are a positive integer N and a sequence of length 2^N consisting of 0s and 1s: A_0,A_1,\ldots,A_{2^N-1}. Determine whether there exists a closed curve C that satisfies the condition below ... | instruction | 0 | 42,670 | 23 | 85,340 |
No | output | 1 | 42,670 | 23 | 85,341 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Given are a positive integer N and a sequence of length 2^N consisting of 0s and 1s: A_0,A_1,\ldots,A_{2^N-1}. Determine whether there exists a closed curve C that satisfies the condition below ... | instruction | 0 | 42,671 | 23 | 85,342 |
No | output | 1 | 42,671 | 23 | 85,343 |
Provide a correct Python 3 solution for this coding contest problem.
Draw a rectangle which has a height of H cm and a width of W cm. Draw a 1-cm square by single '#'.
Constraints
* 1 ≤ H ≤ 300
* 1 ≤ W ≤ 300
Input
The input consists of multiple datasets. Each dataset consists of two integers H and W separated by a... | instruction | 0 | 42,880 | 23 | 85,760 |
"Correct Solution:
```
while True:
y,x=map(int, input().split())
if x==y==0: break
print(('#'*x+'\n')*y)
``` | output | 1 | 42,880 | 23 | 85,761 |
Provide a correct Python 3 solution for this coding contest problem.
Draw a rectangle which has a height of H cm and a width of W cm. Draw a 1-cm square by single '#'.
Constraints
* 1 ≤ H ≤ 300
* 1 ≤ W ≤ 300
Input
The input consists of multiple datasets. Each dataset consists of two integers H and W separated by a... | instruction | 0 | 42,881 | 23 | 85,762 |
"Correct Solution:
```
while True:
a, b = map(int, input().split())
if a == 0 and b == 0: break
for i in range(0, a):
print("#" * b)
print()
``` | output | 1 | 42,881 | 23 | 85,763 |
Provide a correct Python 3 solution for this coding contest problem.
Draw a rectangle which has a height of H cm and a width of W cm. Draw a 1-cm square by single '#'.
Constraints
* 1 ≤ H ≤ 300
* 1 ≤ W ≤ 300
Input
The input consists of multiple datasets. Each dataset consists of two integers H and W separated by a... | instruction | 0 | 42,882 | 23 | 85,764 |
"Correct Solution:
```
while 1:
h,w=map(int,input().split())
if h==0 and w==0:
break
for i in range(h):
print('#'*w)
print('')
``` | output | 1 | 42,882 | 23 | 85,765 |
Provide a correct Python 3 solution for this coding contest problem.
Draw a rectangle which has a height of H cm and a width of W cm. Draw a 1-cm square by single '#'.
Constraints
* 1 ≤ H ≤ 300
* 1 ≤ W ≤ 300
Input
The input consists of multiple datasets. Each dataset consists of two integers H and W separated by a... | instruction | 0 | 42,883 | 23 | 85,766 |
"Correct Solution:
```
while True:
HW = input()
H, W = map(int, HW.split())
if H == 0 and W == 0:
break
print(('#'*W + '\n')*H)
``` | output | 1 | 42,883 | 23 | 85,767 |
Provide a correct Python 3 solution for this coding contest problem.
Draw a rectangle which has a height of H cm and a width of W cm. Draw a 1-cm square by single '#'.
Constraints
* 1 ≤ H ≤ 300
* 1 ≤ W ≤ 300
Input
The input consists of multiple datasets. Each dataset consists of two integers H and W separated by a... | instruction | 0 | 42,884 | 23 | 85,768 |
"Correct Solution:
```
while True:
h, w = map(int, input().split())
if h + w == 0: break
print(('#' * w + '\n') * h)
``` | output | 1 | 42,884 | 23 | 85,769 |
Provide a correct Python 3 solution for this coding contest problem.
Draw a rectangle which has a height of H cm and a width of W cm. Draw a 1-cm square by single '#'.
Constraints
* 1 ≤ H ≤ 300
* 1 ≤ W ≤ 300
Input
The input consists of multiple datasets. Each dataset consists of two integers H and W separated by a... | instruction | 0 | 42,885 | 23 | 85,770 |
"Correct Solution:
```
while True:
H , W = map(int, input().split())
if H == 0: break
print(("#"*W + "\n") *H)
``` | output | 1 | 42,885 | 23 | 85,771 |
Provide a correct Python 3 solution for this coding contest problem.
Draw a rectangle which has a height of H cm and a width of W cm. Draw a 1-cm square by single '#'.
Constraints
* 1 ≤ H ≤ 300
* 1 ≤ W ≤ 300
Input
The input consists of multiple datasets. Each dataset consists of two integers H and W separated by a... | instruction | 0 | 42,886 | 23 | 85,772 |
"Correct Solution:
```
while True:
a,b = map(int,input().split())
if a | b == 0:break
print(("#"*b+"\n")*a)
``` | output | 1 | 42,886 | 23 | 85,773 |
Provide a correct Python 3 solution for this coding contest problem.
Draw a rectangle which has a height of H cm and a width of W cm. Draw a 1-cm square by single '#'.
Constraints
* 1 ≤ H ≤ 300
* 1 ≤ W ≤ 300
Input
The input consists of multiple datasets. Each dataset consists of two integers H and W separated by a... | instruction | 0 | 42,887 | 23 | 85,774 |
"Correct Solution:
```
while True:
h, w = map(int, input().split())
if h == w == 0:
break
for i in range(h):
print('#'*w)
print()
``` | output | 1 | 42,887 | 23 | 85,775 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Draw a rectangle which has a height of H cm and a width of W cm. Draw a 1-cm square by single '#'.
Constraints
* 1 ≤ H ≤ 300
* 1 ≤ W ≤ 300
Input
The input consists of multiple datasets. Each... | instruction | 0 | 42,888 | 23 | 85,776 |
Yes | output | 1 | 42,888 | 23 | 85,777 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Draw a rectangle which has a height of H cm and a width of W cm. Draw a 1-cm square by single '#'.
Constraints
* 1 ≤ H ≤ 300
* 1 ≤ W ≤ 300
Input
The input consists of multiple datasets. Each... | instruction | 0 | 42,889 | 23 | 85,778 |
Yes | output | 1 | 42,889 | 23 | 85,779 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Draw a rectangle which has a height of H cm and a width of W cm. Draw a 1-cm square by single '#'.
Constraints
* 1 ≤ H ≤ 300
* 1 ≤ W ≤ 300
Input
The input consists of multiple datasets. Each... | instruction | 0 | 42,890 | 23 | 85,780 |
Yes | output | 1 | 42,890 | 23 | 85,781 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Draw a rectangle which has a height of H cm and a width of W cm. Draw a 1-cm square by single '#'.
Constraints
* 1 ≤ H ≤ 300
* 1 ≤ W ≤ 300
Input
The input consists of multiple datasets. Each... | instruction | 0 | 42,891 | 23 | 85,782 |
Yes | output | 1 | 42,891 | 23 | 85,783 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Draw a rectangle which has a height of H cm and a width of W cm. Draw a 1-cm square by single '#'.
Constraints
* 1 ≤ H ≤ 300
* 1 ≤ W ≤ 300
Input
The input consists of multiple datasets. Each... | instruction | 0 | 42,892 | 23 | 85,784 |
No | output | 1 | 42,892 | 23 | 85,785 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Draw a rectangle which has a height of H cm and a width of W cm. Draw a 1-cm square by single '#'.
Constraints
* 1 ≤ H ≤ 300
* 1 ≤ W ≤ 300
Input
The input consists of multiple datasets. Each... | instruction | 0 | 42,893 | 23 | 85,786 |
No | output | 1 | 42,893 | 23 | 85,787 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Draw a rectangle which has a height of H cm and a width of W cm. Draw a 1-cm square by single '#'.
Constraints
* 1 ≤ H ≤ 300
* 1 ≤ W ≤ 300
Input
The input consists of multiple datasets. Each... | instruction | 0 | 42,894 | 23 | 85,788 |
No | output | 1 | 42,894 | 23 | 85,789 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Draw a rectangle which has a height of H cm and a width of W cm. Draw a 1-cm square by single '#'.
Constraints
* 1 ≤ H ≤ 300
* 1 ≤ W ≤ 300
Input
The input consists of multiple datasets. Each... | instruction | 0 | 42,895 | 23 | 85,790 |
No | output | 1 | 42,895 | 23 | 85,791 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The only difference between the easy and hard versions is that tokens of type O do not appear in the input of the easy version.
Errichto gave Monogon the following challenge in order to intimid... | instruction | 0 | 43,180 | 23 | 86,360 |
Yes | output | 1 | 43,180 | 23 | 86,361 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The only difference between the easy and hard versions is that tokens of type O do not appear in the input of the easy version.
Errichto gave Monogon the following challenge in order to intimid... | instruction | 0 | 43,181 | 23 | 86,362 |
Yes | output | 1 | 43,181 | 23 | 86,363 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The only difference between the easy and hard versions is that tokens of type O do not appear in the input of the easy version.
Errichto gave Monogon the following challenge in order to intimid... | instruction | 0 | 43,182 | 23 | 86,364 |
Yes | output | 1 | 43,182 | 23 | 86,365 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The only difference between the easy and hard versions is that tokens of type O do not appear in the input of the easy version.
Errichto gave Monogon the following challenge in order to intimid... | instruction | 0 | 43,183 | 23 | 86,366 |
Yes | output | 1 | 43,183 | 23 | 86,367 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The only difference between the easy and hard versions is that tokens of type O do not appear in the input of the easy version.
Errichto gave Monogon the following challenge in order to intimid... | instruction | 0 | 43,184 | 23 | 86,368 |
No | output | 1 | 43,184 | 23 | 86,369 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The only difference between the easy and hard versions is that tokens of type O do not appear in the input of the easy version.
Errichto gave Monogon the following challenge in order to intimid... | instruction | 0 | 43,185 | 23 | 86,370 |
No | output | 1 | 43,185 | 23 | 86,371 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The only difference between the easy and hard versions is that tokens of type O do not appear in the input of the easy version.
Errichto gave Monogon the following challenge in order to intimid... | instruction | 0 | 43,186 | 23 | 86,372 |
No | output | 1 | 43,186 | 23 | 86,373 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The only difference between the easy and hard versions is that tokens of type O do not appear in the input of the easy version.
Errichto gave Monogon the following challenge in order to intimid... | instruction | 0 | 43,187 | 23 | 86,374 |
No | output | 1 | 43,187 | 23 | 86,375 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You've got an n × m table (n rows and m columns), each cell of the table contains a "0" or a "1".
Your task is to calculate the number of rectangles with the sides that are parallel to the side... | instruction | 0 | 43,320 | 23 | 86,640 |
No | output | 1 | 43,320 | 23 | 86,641 |
Provide a correct Python 3 solution for this coding contest problem.
Numbers of black and white points are placed on a plane. Let's imagine that a straight line of infinite length is drawn on the plane. When the line does not meet any of the points, the line divides these points into two groups. If the division by suc... | instruction | 0 | 43,741 | 23 | 87,482 |
"Correct Solution:
```
def dot(c1, c2):
return c1.real * c2.real + c1.imag * c2.imag
def cross(c1, c2):
return c1.real * c2.imag - c1.imag * c2.real
def on_segment(p, a, b):
# whether p is on segment ab
v1 = a - p
v2 = b - p
return cross(v1, v2) == 0 and dot(v1, v2) < 0
def ccw(p0, p1, p2):
... | output | 1 | 43,741 | 23 | 87,483 |
Provide a correct Python 3 solution for this coding contest problem.
Numbers of black and white points are placed on a plane. Let's imagine that a straight line of infinite length is drawn on the plane. When the line does not meet any of the points, the line divides these points into two groups. If the division by suc... | instruction | 0 | 43,742 | 23 | 87,484 |
"Correct Solution:
```
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**13
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int... | output | 1 | 43,742 | 23 | 87,485 |
Provide a correct Python 3 solution for this coding contest problem.
Numbers of black and white points are placed on a plane. Let's imagine that a straight line of infinite length is drawn on the plane. When the line does not meet any of the points, the line divides these points into two groups. If the division by suc... | instruction | 0 | 43,743 | 23 | 87,486 |
"Correct Solution:
```
from collections import defaultdict
import sys
readline = sys.stdin.readline
write = sys.stdout.write
def dot3(O, A, B):
ox, oy = O; ax, ay = A; bx, by = B
return (ax - ox) * (bx - ox) + (ay - oy) * (by - oy)
def cross3(O, A, B):
ox, oy = O; ax, ay = A; bx, by = B
return (ax - ox... | output | 1 | 43,743 | 23 | 87,487 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider a set of points A, initially it is empty. There are three types of queries:
1. Insert a point (x_i, y_i) to A. It is guaranteed that this point does not belong to A at this moment. ... | instruction | 0 | 43,811 | 23 | 87,622 |
No | output | 1 | 43,811 | 23 | 87,623 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider a set of points A, initially it is empty. There are three types of queries:
1. Insert a point (x_i, y_i) to A. It is guaranteed that this point does not belong to A at this moment. ... | instruction | 0 | 43,812 | 23 | 87,624 |
No | output | 1 | 43,812 | 23 | 87,625 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n points on the plane, (x_1,y_1), (x_2,y_2), …, (x_n,y_n).
You need to place an isosceles triangle with two sides on the coordinate axis to cover all points (a point is covered if it lies inside the triangle or on the side of the ... | instruction | 0 | 43,813 | 23 | 87,626 |
Tags: geometry, math
Correct Solution:
```
sum = 0
for _ in range(int(input())):
x,y = map(int,input().split())
if x+y > sum:
sum = x+y
print(sum)
``` | output | 1 | 43,813 | 23 | 87,627 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n points on the plane, (x_1,y_1), (x_2,y_2), …, (x_n,y_n).
You need to place an isosceles triangle with two sides on the coordinate axis to cover all points (a point is covered if it lies inside the triangle or on the side of the ... | instruction | 0 | 43,814 | 23 | 87,628 |
Tags: geometry, math
Correct Solution:
```
num=int(input())
ma=0
for i in range(num):
k=list(map(int,input().split(" ")))
if(ma<sum(k)):
ma=sum(k)
print(ma)
``` | output | 1 | 43,814 | 23 | 87,629 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n points on the plane, (x_1,y_1), (x_2,y_2), …, (x_n,y_n).
You need to place an isosceles triangle with two sides on the coordinate axis to cover all points (a point is covered if it lies inside the triangle or on the side of the ... | instruction | 0 | 43,815 | 23 | 87,630 |
Tags: geometry, math
Correct Solution:
```
"""
Satwik_Tiwari ;) .
20 june , 2020 - Tuesday
"""
#===============================================================================================
#importing some useful libraries.
from __future__ import division, print_function
from fractions import Fraction
impo... | output | 1 | 43,815 | 23 | 87,631 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n points on the plane, (x_1,y_1), (x_2,y_2), …, (x_n,y_n).
You need to place an isosceles triangle with two sides on the coordinate axis to cover all points (a point is covered if it lies inside the triangle or on the side of the ... | instruction | 0 | 43,816 | 23 | 87,632 |
Tags: geometry, math
Correct Solution:
```
from sys import stdin
a=int(stdin.readline())
MAX=0
for k in range(0,a):
A=stdin.readline().split()
P=int(A[0])
Q=int(A[1])
if P+Q>MAX:
MAX=P+Q
print(MAX)
``` | output | 1 | 43,816 | 23 | 87,633 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n points on the plane, (x_1,y_1), (x_2,y_2), …, (x_n,y_n).
You need to place an isosceles triangle with two sides on the coordinate axis to cover all points (a point is covered if it lies inside the triangle or on the side of the ... | instruction | 0 | 43,817 | 23 | 87,634 |
Tags: geometry, math
Correct Solution:
```
import sys
ip=int(sys.stdin.readline())
x=0
for i in range(ip):
a,b=map(int,sys.stdin.readline().split())
x=max(x,a+b)
print(x)
``` | output | 1 | 43,817 | 23 | 87,635 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n points on the plane, (x_1,y_1), (x_2,y_2), …, (x_n,y_n).
You need to place an isosceles triangle with two sides on the coordinate axis to cover all points (a point is covered if it lies inside the triangle or on the side of the ... | instruction | 0 | 43,818 | 23 | 87,636 |
Tags: geometry, math
Correct Solution:
```
n_points = int(input())
r = 0
for _ in range(n_points):
x, y = map(int, input().split())
r = max(r, x+y)
print(r)
``` | output | 1 | 43,818 | 23 | 87,637 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n points on the plane, (x_1,y_1), (x_2,y_2), …, (x_n,y_n).
You need to place an isosceles triangle with two sides on the coordinate axis to cover all points (a point is covered if it lies inside the triangle or on the side of the ... | instruction | 0 | 43,819 | 23 | 87,638 |
Tags: geometry, math
Correct Solution:
```
import sys
import math
n=int(input())
comba=[]
for _ in range(n):
a,b=map(int,input().split())
suma=a+b
comba.append(suma)
print(max(comba))
``` | output | 1 | 43,819 | 23 | 87,639 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n points on the plane, (x_1,y_1), (x_2,y_2), …, (x_n,y_n).
You need to place an isosceles triangle with two sides on the coordinate axis to cover all points (a point is covered if it lies inside the triangle or on the side of the ... | instruction | 0 | 43,820 | 23 | 87,640 |
Tags: geometry, math
Correct Solution:
```
m=0
for i in range(int(input())):
s = sum(map(int, input().split()))
m = max(s,m)
print(m)
``` | output | 1 | 43,820 | 23 | 87,641 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n points on the plane, (x_1,y_1), (x_2,y_2), …, (x_n,y_n).
You need to place an isosceles triangle with two sides on the coordinate axis to cover all points (a point is covered if it ... | instruction | 0 | 43,821 | 23 | 87,642 |
Yes | output | 1 | 43,821 | 23 | 87,643 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n points on the plane, (x_1,y_1), (x_2,y_2), …, (x_n,y_n).
You need to place an isosceles triangle with two sides on the coordinate axis to cover all points (a point is covered if it ... | instruction | 0 | 43,822 | 23 | 87,644 |
Yes | output | 1 | 43,822 | 23 | 87,645 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n points on the plane, (x_1,y_1), (x_2,y_2), …, (x_n,y_n).
You need to place an isosceles triangle with two sides on the coordinate axis to cover all points (a point is covered if it ... | instruction | 0 | 43,823 | 23 | 87,646 |
Yes | output | 1 | 43,823 | 23 | 87,647 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n points on the plane, (x_1,y_1), (x_2,y_2), …, (x_n,y_n).
You need to place an isosceles triangle with two sides on the coordinate axis to cover all points (a point is covered if it ... | instruction | 0 | 43,824 | 23 | 87,648 |
Yes | output | 1 | 43,824 | 23 | 87,649 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n points on the plane, (x_1,y_1), (x_2,y_2), …, (x_n,y_n).
You need to place an isosceles triangle with two sides on the coordinate axis to cover all points (a point is covered if it ... | instruction | 0 | 43,825 | 23 | 87,650 |
No | output | 1 | 43,825 | 23 | 87,651 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.