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 |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane.
You can use the following theorem:
Theorem: an N-sided... | instruction | 0 | 82,423 | 23 | 164,846 |
No | output | 1 | 82,423 | 23 | 164,847 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane.
You can use the following theorem:
Theorem: an N-sided... | instruction | 0 | 82,424 | 23 | 164,848 |
No | output | 1 | 82,424 | 23 | 164,849 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane.
You can use the following theorem:
Theorem: an N-sided... | instruction | 0 | 82,425 | 23 | 164,850 |
No | output | 1 | 82,425 | 23 | 164,851 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Determine if an N-sided polygon (not necessarily convex) with sides of length L_1, L_2, ..., L_N can be drawn in a two-dimensional plane.
You can use the following theorem:
Theorem: an N-sided... | instruction | 0 | 82,426 | 23 | 164,852 |
No | output | 1 | 82,426 | 23 | 164,853 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given 4n sticks, the length of the i-th stick is a_i.
You have to create n rectangles, each rectangle will consist of exactly 4 sticks from the given set. The rectangle consists of four sides, opposite sides should have equal length... | instruction | 0 | 82,676 | 23 | 165,352 |
Tags: greedy, math
Correct Solution:
```
q = int(input())
for _ in range(q):
n = int(input())
array = list(map(int, input().split()))
array.sort()
flag = 1
for i in set(array):
if array.count(i) % 2:
flag = 0
break
if not flag:
print("NO")
contin... | output | 1 | 82,676 | 23 | 165,353 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given 4n sticks, the length of the i-th stick is a_i.
You have to create n rectangles, each rectangle will consist of exactly 4 sticks from the given set. The rectangle consists of four sides, opposite sides should have equal length... | instruction | 0 | 82,677 | 23 | 165,354 |
Tags: greedy, math
Correct Solution:
```
for _ in range(int(input())):
n = int(input())
a = sorted(list(map(int, input().split())))
pr = a[0]*a[1]*a[-1]*a[-2]
for q in range(0, n*2, 2):
if a[q] != a[q+1] or a[4*n-q-1] != a[4*n-q-2] or a[q]*a[q+1]*a[4*n-q-1]*a[4*n-q-2] != pr:
print('N... | output | 1 | 82,677 | 23 | 165,355 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given 4n sticks, the length of the i-th stick is a_i.
You have to create n rectangles, each rectangle will consist of exactly 4 sticks from the given set. The rectangle consists of four sides, opposite sides should have equal length... | instruction | 0 | 82,678 | 23 | 165,356 |
Tags: greedy, math
Correct Solution:
```
q = int(input())
for j in range(q):
n = int(input())
sp = list(map(int, input().split()))
sp.sort()
sqrt = sp[4 * n - 1] * sp[0]
t = True
for i in range(0, 2 * n, 2):
if sp.count(sp[i]) % 2 != 0 or sp.count(sp[4 * n - i - 1]) % 2 != 0:
... | output | 1 | 82,678 | 23 | 165,357 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given 4n sticks, the length of the i-th stick is a_i.
You have to create n rectangles, each rectangle will consist of exactly 4 sticks from the given set. The rectangle consists of four sides, opposite sides should have equal length... | instruction | 0 | 82,679 | 23 | 165,358 |
Tags: greedy, math
Correct Solution:
```
for _ in range(int(input())):
n = int(input())
a = sorted(map(int, input().split()))
p = a[0] * a[-1]
for i in range(0, 4 * n, 2):
if a[i] != a[i + 1] or p != a[i] * a[-i - 1]:
print('NO')
break
else:
print('YES')
``` | output | 1 | 82,679 | 23 | 165,359 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given 4n sticks, the length of the i-th stick is a_i.
You have to create n rectangles, each rectangle will consist of exactly 4 sticks from the given set. The rectangle consists of four sides, opposite sides should have equal length... | instruction | 0 | 82,680 | 23 | 165,360 |
Tags: greedy, math
Correct Solution:
```
def check(n, a):
a.sort()
area = a[0] * a[-1]
i = 0;
while i < 2*n:
if (a[i] != a[i+1]): return False
if (a[-(i+1)] != a[-(i+2)]): return False
if a[i] * a[-(i+1)] != area:
return False
i += 2
return True
q = int(input())
for i in range(q):
n ... | output | 1 | 82,680 | 23 | 165,361 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given 4n sticks, the length of the i-th stick is a_i.
You have to create n rectangles, each rectangle will consist of exactly 4 sticks from the given set. The rectangle consists of four sides, opposite sides should have equal length... | instruction | 0 | 82,681 | 23 | 165,362 |
Tags: greedy, math
Correct Solution:
```
numberOfQueries = int(input())
for _ in range(numberOfQueries):
numberOfRects = int(input())
sides = list(map(int, input().split()))
sides.sort()
area = sides[0] * sides[4 * numberOfRects - 1]
index = 0
canFormRects = True
for _ in range(numberOf... | output | 1 | 82,681 | 23 | 165,363 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given 4n sticks, the length of the i-th stick is a_i.
You have to create n rectangles, each rectangle will consist of exactly 4 sticks from the given set. The rectangle consists of four sides, opposite sides should have equal length... | instruction | 0 | 82,682 | 23 | 165,364 |
Tags: greedy, math
Correct Solution:
```
q=int(input())
for _ in range(q):
n=int(input())
a=list(map(int,input().split()))
a.sort()
base=a[0]*a[-1]
for i in range(0,2*n,2):
if a[i]!=a[i+1]:
print("NO")
break
if a[-i-1]!=a[-i-2]:
print("NO")
... | output | 1 | 82,682 | 23 | 165,365 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given 4n sticks, the length of the i-th stick is a_i.
You have to create n rectangles, each rectangle will consist of exactly 4 sticks from the given set. The rectangle consists of four sides, opposite sides should have equal length... | instruction | 0 | 82,683 | 23 | 165,366 |
Tags: greedy, math
Correct Solution:
```
from sys import stdout
from sys import stdin
def get():
return stdin.readline().strip()
def getf():
return [int(i) for i in get().split()]
def put(a, end = "\n"):
stdout.write(str(a) + end)
def putf(a, sep = " ", end = "\n"):
stdout.write(sep.join([str(i) for i i... | output | 1 | 82,683 | 23 | 165,367 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given 4n sticks, the length of the i-th stick is a_i.
You have to create n rectangles, each rectangle will consist of exactly 4 sticks from the given set. The rectangle consists of four... | instruction | 0 | 82,684 | 23 | 165,368 |
Yes | output | 1 | 82,684 | 23 | 165,369 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given 4n sticks, the length of the i-th stick is a_i.
You have to create n rectangles, each rectangle will consist of exactly 4 sticks from the given set. The rectangle consists of four... | instruction | 0 | 82,685 | 23 | 165,370 |
Yes | output | 1 | 82,685 | 23 | 165,371 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given 4n sticks, the length of the i-th stick is a_i.
You have to create n rectangles, each rectangle will consist of exactly 4 sticks from the given set. The rectangle consists of four... | instruction | 0 | 82,686 | 23 | 165,372 |
Yes | output | 1 | 82,686 | 23 | 165,373 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given 4n sticks, the length of the i-th stick is a_i.
You have to create n rectangles, each rectangle will consist of exactly 4 sticks from the given set. The rectangle consists of four... | instruction | 0 | 82,687 | 23 | 165,374 |
Yes | output | 1 | 82,687 | 23 | 165,375 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given 4n sticks, the length of the i-th stick is a_i.
You have to create n rectangles, each rectangle will consist of exactly 4 sticks from the given set. The rectangle consists of four... | instruction | 0 | 82,688 | 23 | 165,376 |
No | output | 1 | 82,688 | 23 | 165,377 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given 4n sticks, the length of the i-th stick is a_i.
You have to create n rectangles, each rectangle will consist of exactly 4 sticks from the given set. The rectangle consists of four... | instruction | 0 | 82,689 | 23 | 165,378 |
No | output | 1 | 82,689 | 23 | 165,379 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given 4n sticks, the length of the i-th stick is a_i.
You have to create n rectangles, each rectangle will consist of exactly 4 sticks from the given set. The rectangle consists of four... | instruction | 0 | 82,690 | 23 | 165,380 |
No | output | 1 | 82,690 | 23 | 165,381 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given 4n sticks, the length of the i-th stick is a_i.
You have to create n rectangles, each rectangle will consist of exactly 4 sticks from the given set. The rectangle consists of four... | instruction | 0 | 82,691 | 23 | 165,382 |
No | output | 1 | 82,691 | 23 | 165,383 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Based on a peculiar incident at basketball practice, Akari came up with the following competitive programming problem!
You are given n points on the plane, no three of which are collinear. The i-th point initially has a label a_i, in such a... | instruction | 0 | 82,816 | 23 | 165,632 |
Tags: constructive algorithms, geometry, sortings
Correct Solution:
```
import sys,io,os
try:Z=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
except:Z=lambda:sys.stdin.readline().encode()
from math import atan2
from collections import deque
def path(R):
H=deque();H.append(R)
while P[R]>=0:
R=P[R];H... | output | 1 | 82,816 | 23 | 165,633 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Based on a peculiar incident at basketball practice, Akari came up with the following competitive programming problem!
You are given n points on the plane, no three of which are collinear. The i-th point initially has a label a_i, in such a... | instruction | 0 | 82,817 | 23 | 165,634 |
Tags: constructive algorithms, geometry, sortings
Correct Solution:
```
import sys,io,os
try:Z=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
except:Z=lambda:sys.stdin.readline().encode()
from math import atan2;from collections import deque
def path(R):
H=deque();H.append(R)
while P[R]>=0:
R=P[R];H... | output | 1 | 82,817 | 23 | 165,635 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Based on a peculiar incident at basketball practice, Akari came up with the following competitive programming problem!
You are given n points on the plane, no three of which are collinear. The ... | instruction | 0 | 82,818 | 23 | 165,636 |
No | output | 1 | 82,818 | 23 | 165,637 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is an n Γ m rectangular grid, each cell of the grid contains a single integer: zero or one. Let's call the cell on the i-th row and the j-th column as (i, j).
Let's define a "rectangle" a... | instruction | 0 | 82,910 | 23 | 165,820 |
No | output | 1 | 82,910 | 23 | 165,821 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is an n Γ m rectangular grid, each cell of the grid contains a single integer: zero or one. Let's call the cell on the i-th row and the j-th column as (i, j).
Let's define a "rectangle" a... | instruction | 0 | 82,911 | 23 | 165,822 |
No | output | 1 | 82,911 | 23 | 165,823 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given n points on the plane. The polygon formed from all the n points is strictly convex, that is, the polygon is convex, and there are no three collinear points (i.e. lying in the same straight line). The points are numbered from 1 ... | instruction | 0 | 83,392 | 23 | 166,784 |
Tags: dp, geometry
Correct Solution:
```
n=int(input())
tl=tr=bl=br=top=bot=left=right=-200000000
for i in range(n):
a,b=map(int,input().split())
top=max(top,b)
bot=max(bot,-b)
right=max(right,a)
left=max(left,-a)
tr=max(tr,a+b)
tl=max(tl,b-a)
br=max(br,a-b)
bl=max(bl,-a-b)
print(str... | output | 1 | 83,392 | 23 | 166,785 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given n points on the plane. The polygon formed from all the n points is strictly convex, that is, the polygon is convex, and there are no three collinear points (i.e. lying in the same straight line). The points are numbered from 1 ... | instruction | 0 | 83,393 | 23 | 166,786 |
Tags: dp, geometry
Correct Solution:
```
n = int(input())
north = -100000000
south = 100000000
east = -100000000
west = 100000000
ne = -200000000
nw = -200000000
se = -200000000
sw = -200000000
for i in range(n):
x,y = map(int,input().split())
north = max(north,y)
east = max(east,x)
south = min(south,y)... | output | 1 | 83,393 | 23 | 166,787 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given n points on the plane. The polygon formed from all the n points is strictly convex, that is, the polygon is convex, and there are no three collinear points (i.e. lying in the same straight line). The points are numbered from 1 ... | instruction | 0 | 83,394 | 23 | 166,788 |
Tags: dp, geometry
Correct Solution:
```
from collections import namedtuple
import sys
XY = namedtuple('XY', 'x y')
n = int(input())
pg = [XY(*[int(w) for w in input().split()]) for _ in range(n)]
minx = min(p.x for p in pg)
miny = min(p.y for p in pg)
maxx = max(p.x for p in pg)
maxy = max(p.y for p in pg)
p4 = 2 ... | output | 1 | 83,394 | 23 | 166,789 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n points on the plane. The polygon formed from all the n points is strictly convex, that is, the polygon is convex, and there are no three collinear points (i.e. lying in the same ... | instruction | 0 | 83,395 | 23 | 166,790 |
No | output | 1 | 83,395 | 23 | 166,791 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Cybermen and the Daleks have long been the Doctor's main enemies. Everyone knows that both these species enjoy destroying everything they encounter. However, a little-known fact about them is that they both also love taking Turing tests!... | instruction | 0 | 83,440 | 23 | 166,880 |
Tags: implementation
Correct Solution:
```
def find_inside_point(points, maxx, minx, maxy, miny):
# print('inside point')
for x, y in points:
if minx < x < maxx and miny < y < maxy:
print(x, y)
return
def find_outside_point(points, maxx, minx, maxy, miny):
# print('outside ... | output | 1 | 83,440 | 23 | 166,881 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Cybermen and the Daleks have long been the Doctor's main enemies. Everyone knows that both these species enjoy destroying everything they encounter. However, a little-known fact about them is that they both also love taking Turing tests!... | instruction | 0 | 83,441 | 23 | 166,882 |
Tags: implementation
Correct Solution:
```
N = int(input())
#N,B = [int(x) for x in arr.split(' ')]
#arr = input()
#A = [int(x) for x in arr.split(' ')]
x_freq = {}
y_freq = {}
data = []
for i in range(4*N+1):
arr = input()
x,y = [int(x) for x in arr.split(' ')]
data.append([x,y])
if x not in ... | output | 1 | 83,441 | 23 | 166,883 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Cybermen and the Daleks have long been the Doctor's main enemies. Everyone knows that both these species enjoy destroying everything they encounter. However, a little-known fact about them is that they both also love taking Turing tests!... | instruction | 0 | 83,442 | 23 | 166,884 |
Tags: implementation
Correct Solution:
```
import sys
import math as m
def sort(a):
mid = m.ceil(len(a)/2)
if len(a) == 1:
return a
else:
al = sort(a[:mid])
ar = sort(a[mid:])
i = 0
j = 0
sa = []
c = []
while i < len(al) or j < len(ar):
... | output | 1 | 83,442 | 23 | 166,885 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Cybermen and the Daleks have long been the Doctor's main enemies. Everyone knows that both these species enjoy destroying everything they encounter. However, a little-known fact about them is that they both also love taking Turing tests!... | instruction | 0 | 83,443 | 23 | 166,886 |
Tags: implementation
Correct Solution:
```
import math
n = int(input())
arr = []
for i in range(4*n + 1):
arr.append(list(map(int,input().split())))
for g in range(len(arr)):
xMin = math.inf
xMax = -1* math.inf
yMin = math.inf
yMax = -1* math.inf
fl = True
for i in range(4*n + 1):
... | output | 1 | 83,443 | 23 | 166,887 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Cybermen and the Daleks have long been the Doctor's main enemies. Everyone knows that both these species enjoy destroying everything they encounter. However, a little-known fact about them is that they both also love taking Turing tests!... | instruction | 0 | 83,444 | 23 | 166,888 |
Tags: implementation
Correct Solution:
```
n = int(input())
arr = []
for i in range(4*n + 1):
str_ = input()
x, y = str_.split()
arr.append((int(x), int(y)))
arr.sort()
n1 = 4*n+1
i = 1
while arr[i][0] == arr[i-1][0]:
i += 1
if i == 1:
print(str(arr[0][0]) + ' ' + str(arr[0][1]))
exit()
low... | output | 1 | 83,444 | 23 | 166,889 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Cybermen and the Daleks have long been the Doctor's main enemies. Everyone knows that both these species enjoy destroying everything they encounter. However, a little-known fact about them is that they both also love taking Turing tests!... | instruction | 0 | 83,445 | 23 | 166,890 |
Tags: implementation
Correct Solution:
```
# -*- coding: utf-8 -*-
import sys
from operator import itemgetter
from fractions import gcd
from math import ceil, floor
from copy import deepcopy
from itertools import accumulate
from collections import Counter
import math
from functools import reduce
from bisect import bise... | output | 1 | 83,445 | 23 | 166,891 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Cybermen and the Daleks have long been the Doctor's main enemies. Everyone knows that both these species enjoy destroying everything they encounter. However, a little-known fact about them is that they both also love taking Turing tests!... | instruction | 0 | 83,446 | 23 | 166,892 |
Tags: implementation
Correct Solution:
```
import io, os
input = io.StringIO(os.read(0, os.fstat(0).st_size).decode()).readline
ii = lambda: int(input())
mi = lambda: map(int, input().split())
li = lambda: list(mi())
n = ii()
a = [li() for _ in range(4 * n + 1)]
lox = min(p[0] for p in a)
hix = max(p[0] for p in a)
l... | output | 1 | 83,446 | 23 | 166,893 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Cybermen and the Daleks have long been the Doctor's main enemies. Everyone knows that both these species enjoy destroying everything they encounter. However, a little-known fact about them is that they both also love taking Turing tests!... | instruction | 0 | 83,447 | 23 | 166,894 |
Tags: implementation
Correct Solution:
```
#!/usr/bin/env python3
import sys
import math
import cProfile
DEBUG = False
if DEBUG:
sys.stdin = open('input.txt')
pr = cProfile.Profile()
pr.enable()
n = sys.stdin.readline()
n = int(n)
# Init global variables.
points = []
for i in range(4 * n + 1):
... | output | 1 | 83,447 | 23 | 166,895 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Cybermen and the Daleks have long been the Doctor's main enemies. Everyone knows that both these species enjoy destroying everything they encounter. However, a little-known fact about them i... | instruction | 0 | 83,448 | 23 | 166,896 |
Yes | output | 1 | 83,448 | 23 | 166,897 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Cybermen and the Daleks have long been the Doctor's main enemies. Everyone knows that both these species enjoy destroying everything they encounter. However, a little-known fact about them i... | instruction | 0 | 83,449 | 23 | 166,898 |
Yes | output | 1 | 83,449 | 23 | 166,899 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Cybermen and the Daleks have long been the Doctor's main enemies. Everyone knows that both these species enjoy destroying everything they encounter. However, a little-known fact about them i... | instruction | 0 | 83,450 | 23 | 166,900 |
Yes | output | 1 | 83,450 | 23 | 166,901 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Cybermen and the Daleks have long been the Doctor's main enemies. Everyone knows that both these species enjoy destroying everything they encounter. However, a little-known fact about them i... | instruction | 0 | 83,453 | 23 | 166,906 |
No | output | 1 | 83,453 | 23 | 166,907 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Cybermen and the Daleks have long been the Doctor's main enemies. Everyone knows that both these species enjoy destroying everything they encounter. However, a little-known fact about them i... | instruction | 0 | 83,454 | 23 | 166,908 |
No | output | 1 | 83,454 | 23 | 166,909 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Cybermen and the Daleks have long been the Doctor's main enemies. Everyone knows that both these species enjoy destroying everything they encounter. However, a little-known fact about them i... | instruction | 0 | 83,455 | 23 | 166,910 |
No | output | 1 | 83,455 | 23 | 166,911 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A binary matrix is called good if every even length square sub-matrix has an odd number of ones.
Given a binary matrix a consisting of n rows and m columns, determine the minimum number of cel... | instruction | 0 | 83,581 | 23 | 167,162 |
Yes | output | 1 | 83,581 | 23 | 167,163 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A binary matrix is called good if every even length square sub-matrix has an odd number of ones.
Given a binary matrix a consisting of n rows and m columns, determine the minimum number of cel... | instruction | 0 | 83,582 | 23 | 167,164 |
Yes | output | 1 | 83,582 | 23 | 167,165 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A binary matrix is called good if every even length square sub-matrix has an odd number of ones.
Given a binary matrix a consisting of n rows and m columns, determine the minimum number of cel... | instruction | 0 | 83,583 | 23 | 167,166 |
Yes | output | 1 | 83,583 | 23 | 167,167 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A binary matrix is called good if every even length square sub-matrix has an odd number of ones.
Given a binary matrix a consisting of n rows and m columns, determine the minimum number of cel... | instruction | 0 | 83,584 | 23 | 167,168 |
Yes | output | 1 | 83,584 | 23 | 167,169 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A binary matrix is called good if every even length square sub-matrix has an odd number of ones.
Given a binary matrix a consisting of n rows and m columns, determine the minimum number of cel... | instruction | 0 | 83,585 | 23 | 167,170 |
No | output | 1 | 83,585 | 23 | 167,171 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A binary matrix is called good if every even length square sub-matrix has an odd number of ones.
Given a binary matrix a consisting of n rows and m columns, determine the minimum number of cel... | instruction | 0 | 83,586 | 23 | 167,172 |
No | output | 1 | 83,586 | 23 | 167,173 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A binary matrix is called good if every even length square sub-matrix has an odd number of ones.
Given a binary matrix a consisting of n rows and m columns, determine the minimum number of cel... | instruction | 0 | 83,587 | 23 | 167,174 |
No | output | 1 | 83,587 | 23 | 167,175 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.