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.
Consider some square matrix A with side n consisting of zeros and ones. There are n rows numbered from 1 to n from top to bottom and n columns numbered from 1 to n from left to right in this mat... | instruction | 0 | 7,841 | 23 | 15,682 |
No | output | 1 | 7,841 | 23 | 15,683 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider some square matrix A with side n consisting of zeros and ones. There are n rows numbered from 1 to n from top to bottom and n columns numbered from 1 to n from left to right in this mat... | instruction | 0 | 7,842 | 23 | 15,684 |
No | output | 1 | 7,842 | 23 | 15,685 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given the following points with integer coordinates on the plane: M0, A0, A1, ..., An - 1, where n is odd number. Now we define the following infinite sequence of points Mi: Mi is symmetric to Mi - 1 according <image> (for every natu... | instruction | 0 | 7,853 | 23 | 15,706 |
Tags: geometry, implementation, math
Correct Solution:
```
import sys
def read():
tokens = sys.stdin.readline().strip().split()
return int(tokens[0]), int(tokens[1])
n,m=read()
p,q=read()
x=[]
y=[]
r=1
for i in range(0,n*2):
if (i<n):
tx,ty=read()
x.append(tx)
y.append(ty)
else:
x.append(x[i-n])
... | output | 1 | 7,853 | 23 | 15,707 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given the following points with integer coordinates on the plane: M0, A0, A1, ..., An - 1, where n is odd number. Now we define the following infinite sequence of points Mi: Mi is symmetric to Mi - 1 according <image> (for every natu... | instruction | 0 | 7,854 | 23 | 15,708 |
Tags: geometry, implementation, math
Correct Solution:
```
n, k = map(int, input().split())
ax = []
ay = []
mx, my = map(int, input().split())
for i in range(n):
x, y = map(int, input().split())
ax.append(x)
ay.append(y)
k %= 2*n
for i in range(k):
mx = 2*ax[i % n] - mx
my = 2*ay[i % n] - my
p... | output | 1 | 7,854 | 23 | 15,709 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given the following points with integer coordinates on the plane: M0, A0, A1, ..., An - 1, where n is odd number. Now we define the following infinite sequence of points Mi: Mi is symmetric to Mi - 1 according <image> (for every natu... | instruction | 0 | 7,855 | 23 | 15,710 |
Tags: geometry, implementation, math
Correct Solution:
```
n, j = map(int, input().split())
x, y = map(int, input().split())
dx, dy = n * [ None ], n * [ None ]
for i in range(n):
dx[i], dy[i] = map(lambda s: 2 * int(s), input().split())
j %= 2 * n
pos = 0
if j % 2 == 0:
sign = -1
else:
sign = 1
x, y =... | output | 1 | 7,855 | 23 | 15,711 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given the following points with integer coordinates on the plane: M0, A0, A1, ..., An - 1, where n is odd number. Now we define the following infinite sequence of points Mi: Mi is symmetric to Mi - 1 according <image> (for every natu... | instruction | 0 | 7,856 | 23 | 15,712 |
Tags: geometry, implementation, math
Correct Solution:
```
import sys
def read():
tokens = sys.stdin.readline().strip().split()
return int(tokens[0]), int(tokens[1])
n, j = read()
m0_x, m0_y = read()
ax, ay = [], []
for i in range(n):
ax_, ay_ = read()
ax.append(ax_)
ay.append(ay_)
mult = j // n... | output | 1 | 7,856 | 23 | 15,713 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given the following points with integer coordinates on the plane: M0, A0, A1, ..., An - 1, where n is odd number. Now we define the following infinite sequence of points Mi: Mi is symmetric to Mi - 1 according <image> (for every natu... | instruction | 0 | 7,857 | 23 | 15,714 |
Tags: geometry, implementation, math
Correct Solution:
```
#codeforces 24c sequence of points, math
"""import sys
sys.stdin=open("24c.in",mode='r',encoding='utf-8')
"""
def readGen(transform):
while (True):
n=0
tmp=input().split()
m=len(tmp)
while (n<m):
yield(transform(tmp[n]))
n+=1
readint=readGen(int... | output | 1 | 7,857 | 23 | 15,715 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given the following points with integer coordinates on the plane: M0, A0, A1, ..., An - 1, where n is odd number. Now we define the following infinite sequence of points Mi: Mi is symmetric to Mi - 1 according <image> (for every natu... | instruction | 0 | 7,858 | 23 | 15,716 |
Tags: geometry, implementation, math
Correct Solution:
```
n, j = map(int, input().split())
m = list(map(int, input().split()))
points = []
for _ in range(n):
points += [tuple(map(int, input().split()))]
trans = [0, 0]
points = points + points
for i in range(0, len(points), 2):
trans[0] += - 2 * points[... | output | 1 | 7,858 | 23 | 15,717 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given the following points with integer coordinates on the plane: M0, A0, A1, ..., An - 1, where n is odd number. Now we define the following infinite sequence of points Mi: Mi is symmetric to Mi - 1 according <image> (for every natu... | instruction | 0 | 7,859 | 23 | 15,718 |
Tags: geometry, implementation, math
Correct Solution:
```
# ========= /\ /| |====/|
# | / \ | | / |
# | /____\ | | / |
# | / \ | | / |
# ========= / \ ===== |/====|
# code
# MOD = 998244353
# def pow(base , exp):
# if ... | output | 1 | 7,859 | 23 | 15,719 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given the following points with integer coordinates on the plane: M0, A0, A1, ..., An - 1, where n is odd number. Now we define the following infinite sequence of points Mi: Mi is symmetric to Mi - 1 according <image> (for every natu... | instruction | 0 | 7,860 | 23 | 15,720 |
Tags: geometry, implementation, math
Correct Solution:
```
n, j = map(int, input().split())
x, y = map(int, input().split())
dx, dy = n * [ None ], n * [ None ]
for i in range(n):
dx[i], dy[i] = map(lambda s: 2 * int(s), input().split())
j %= 2 * n
pos = 0
if j % 2 == 0:
sign = -1
else:
sign = 1
x, y =... | output | 1 | 7,860 | 23 | 15,721 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given the following points with integer coordinates on the plane: M0, A0, A1, ..., An - 1, where n is odd number. Now we define the following infinite sequence of points Mi: Mi is symmet... | instruction | 0 | 7,861 | 23 | 15,722 |
Yes | output | 1 | 7,861 | 23 | 15,723 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given the following points with integer coordinates on the plane: M0, A0, A1, ..., An - 1, where n is odd number. Now we define the following infinite sequence of points Mi: Mi is symmet... | instruction | 0 | 7,862 | 23 | 15,724 |
No | output | 1 | 7,862 | 23 | 15,725 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n segments on a line. There are no ends of some segments that coincide. For each segment find the number of segments it contains.
Input
The first line contains a single integer n... | instruction | 0 | 8,001 | 23 | 16,002 |
Yes | output | 1 | 8,001 | 23 | 16,003 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n segments on a line. There are no ends of some segments that coincide. For each segment find the number of segments it contains.
Input
The first line contains a single integer n... | instruction | 0 | 8,002 | 23 | 16,004 |
Yes | output | 1 | 8,002 | 23 | 16,005 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n segments on a line. There are no ends of some segments that coincide. For each segment find the number of segments it contains.
Input
The first line contains a single integer n... | instruction | 0 | 8,003 | 23 | 16,006 |
Yes | output | 1 | 8,003 | 23 | 16,007 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n segments on a line. There are no ends of some segments that coincide. For each segment find the number of segments it contains.
Input
The first line contains a single integer n... | instruction | 0 | 8,004 | 23 | 16,008 |
Yes | output | 1 | 8,004 | 23 | 16,009 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n segments on a line. There are no ends of some segments that coincide. For each segment find the number of segments it contains.
Input
The first line contains a single integer n... | instruction | 0 | 8,005 | 23 | 16,010 |
No | output | 1 | 8,005 | 23 | 16,011 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n segments on a line. There are no ends of some segments that coincide. For each segment find the number of segments it contains.
Input
The first line contains a single integer n... | instruction | 0 | 8,006 | 23 | 16,012 |
No | output | 1 | 8,006 | 23 | 16,013 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n segments on a line. There are no ends of some segments that coincide. For each segment find the number of segments it contains.
Input
The first line contains a single integer n... | instruction | 0 | 8,007 | 23 | 16,014 |
No | output | 1 | 8,007 | 23 | 16,015 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n segments on a line. There are no ends of some segments that coincide. For each segment find the number of segments it contains.
Input
The first line contains a single integer n... | instruction | 0 | 8,008 | 23 | 16,016 |
No | output | 1 | 8,008 | 23 | 16,017 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In his spare time Vladik estimates beauty of the flags.
Every flag could be represented as the matrix n × m which consists of positive integers.
Let's define the beauty of the flag as number o... | instruction | 0 | 8,083 | 23 | 16,166 |
No | output | 1 | 8,083 | 23 | 16,167 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In his spare time Vladik estimates beauty of the flags.
Every flag could be represented as the matrix n × m which consists of positive integers.
Let's define the beauty of the flag as number o... | instruction | 0 | 8,084 | 23 | 16,168 |
No | output | 1 | 8,084 | 23 | 16,169 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In his spare time Vladik estimates beauty of the flags.
Every flag could be represented as the matrix n × m which consists of positive integers.
Let's define the beauty of the flag as number o... | instruction | 0 | 8,085 | 23 | 16,170 |
No | output | 1 | 8,085 | 23 | 16,171 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In his spare time Vladik estimates beauty of the flags.
Every flag could be represented as the matrix n × m which consists of positive integers.
Let's define the beauty of the flag as number o... | instruction | 0 | 8,086 | 23 | 16,172 |
No | output | 1 | 8,086 | 23 | 16,173 |
Provide a correct Python 3 solution for this coding contest problem.
We have a set S of N points in a two-dimensional plane. The coordinates of the i-th point are (x_i, y_i). The N points have distinct x-coordinates and distinct y-coordinates.
For a non-empty subset T of S, let f(T) be the number of points contained ... | instruction | 0 | 8,216 | 23 | 16,432 |
"Correct Solution:
```
import sys
input = lambda : sys.stdin.readline().rstrip()
sys.setrecursionlimit(max(1000, 10**9))
write = lambda x: sys.stdout.write(x+"\n")
### BIT binary
def init(bit, values):
for i,v in enumerate(values):
add(bit,i+1,v)
#a1 ~ aiまでの和 O(logn)
def query(bit,i):
res = 0
whil... | output | 1 | 8,216 | 23 | 16,433 |
Provide a correct Python 3 solution for this coding contest problem.
We have a set S of N points in a two-dimensional plane. The coordinates of the i-th point are (x_i, y_i). The N points have distinct x-coordinates and distinct y-coordinates.
For a non-empty subset T of S, let f(T) be the number of points contained ... | instruction | 0 | 8,217 | 23 | 16,434 |
"Correct Solution:
```
import sys
input = sys.stdin.readline
N=int(input())
POINT=[list(map(int,input().split())) for i in range(N)]
mod=998244353
PX=[p[0] for p in POINT]
PY=[p[1] for p in POINT]
compression_dict_x={a: ind for ind, a in enumerate(sorted(set(PX)))}
compression_dict_y={a: ind for ind, a in enumerate(... | output | 1 | 8,217 | 23 | 16,435 |
Provide a correct Python 3 solution for this coding contest problem.
We have a set S of N points in a two-dimensional plane. The coordinates of the i-th point are (x_i, y_i). The N points have distinct x-coordinates and distinct y-coordinates.
For a non-empty subset T of S, let f(T) be the number of points contained ... | instruction | 0 | 8,218 | 23 | 16,436 |
"Correct Solution:
```
import sys
import array
from operator import itemgetter
def main():
input = sys.stdin.readline
md = 998244353
n = int(input())
tl=n+1
ft=[0]*tl
xy = [[0]*2 for _ in range(n)]
for i in range(n):
xy[i] = [int(item) for item in input().split()]
xy.sort(key=itemgetter(0))
yxi = [... | output | 1 | 8,218 | 23 | 16,437 |
Provide a correct Python 3 solution for this coding contest problem.
We have a set S of N points in a two-dimensional plane. The coordinates of the i-th point are (x_i, y_i). The N points have distinct x-coordinates and distinct y-coordinates.
For a non-empty subset T of S, let f(T) be the number of points contained ... | instruction | 0 | 8,219 | 23 | 16,438 |
"Correct Solution:
```
import sys
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return ... | output | 1 | 8,219 | 23 | 16,439 |
Provide a correct Python 3 solution for this coding contest problem.
We have a set S of N points in a two-dimensional plane. The coordinates of the i-th point are (x_i, y_i). The N points have distinct x-coordinates and distinct y-coordinates.
For a non-empty subset T of S, let f(T) be the number of points contained ... | instruction | 0 | 8,220 | 23 | 16,440 |
"Correct Solution:
```
import sys
input=sys.stdin.readline
N=int(input())
p=[]
for i in range(N):
x,y=map(int,input().split())
p.append([x,y])
mod=998244353
pow=[1]
for i in range(N):
pow.append((pow[-1]*2)%mod)
p.sort(key=lambda x:x[1])
for i in range(N):
p[i][1]=i+1
data=[[0 for i in range(4)] f... | output | 1 | 8,220 | 23 | 16,441 |
Provide a correct Python 3 solution for this coding contest problem.
We have a set S of N points in a two-dimensional plane. The coordinates of the i-th point are (x_i, y_i). The N points have distinct x-coordinates and distinct y-coordinates.
For a non-empty subset T of S, let f(T) be the number of points contained ... | instruction | 0 | 8,221 | 23 | 16,442 |
"Correct Solution:
```
import sys
input = sys.stdin.readline
N=int(input())
POINT=[list(map(int,input().split())) for i in range(N)]
mod=998244353
compression_dict_x={a: ind for ind, a in enumerate(sorted(set([p[0] for p in POINT])))}
POINT=[[compression_dict_x[x]+1,y] for x,y in POINT]
P_Y=sorted(POINT,key=lambda x:... | output | 1 | 8,221 | 23 | 16,443 |
Provide a correct Python 3 solution for this coding contest problem.
We have a set S of N points in a two-dimensional plane. The coordinates of the i-th point are (x_i, y_i). The N points have distinct x-coordinates and distinct y-coordinates.
For a non-empty subset T of S, let f(T) be the number of points contained ... | instruction | 0 | 8,222 | 23 | 16,444 |
"Correct Solution:
```
import sys
input = sys.stdin.readline
mod = 998244353
n = int(input())
XY = sorted(tuple(map(int, input().split())) for _ in range(n))
X, Y = zip(*XY)
L = {y:i+1 for i, y in enumerate(sorted(Y))}
Y = tuple(L[y] for y in Y)
BIT = [0]*(n+1)
def add(i):
while i<=n:
BIT[i] += 1
i += i&-i
de... | output | 1 | 8,222 | 23 | 16,445 |
Provide a correct Python 3 solution for this coding contest problem.
We have a set S of N points in a two-dimensional plane. The coordinates of the i-th point are (x_i, y_i). The N points have distinct x-coordinates and distinct y-coordinates.
For a non-empty subset T of S, let f(T) be the number of points contained ... | instruction | 0 | 8,223 | 23 | 16,446 |
"Correct Solution:
```
from bisect import bisect_right, bisect_left
# instead of AVLTree
class BITbisect():
def __init__(self, InputProbNumbers):
# 座圧
self.ind_to_co = [-10**18]
self.co_to_ind = {}
for ind, num in enumerate(sorted(list(set(InputProbNumbers)))):
self.ind_t... | output | 1 | 8,223 | 23 | 16,447 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a set S of N points in a two-dimensional plane. The coordinates of the i-th point are (x_i, y_i). The N points have distinct x-coordinates and distinct y-coordinates.
For a non-empty su... | instruction | 0 | 8,224 | 23 | 16,448 |
Yes | output | 1 | 8,224 | 23 | 16,449 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a set S of N points in a two-dimensional plane. The coordinates of the i-th point are (x_i, y_i). The N points have distinct x-coordinates and distinct y-coordinates.
For a non-empty su... | instruction | 0 | 8,225 | 23 | 16,450 |
Yes | output | 1 | 8,225 | 23 | 16,451 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a set S of N points in a two-dimensional plane. The coordinates of the i-th point are (x_i, y_i). The N points have distinct x-coordinates and distinct y-coordinates.
For a non-empty su... | instruction | 0 | 8,226 | 23 | 16,452 |
Yes | output | 1 | 8,226 | 23 | 16,453 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a set S of N points in a two-dimensional plane. The coordinates of the i-th point are (x_i, y_i). The N points have distinct x-coordinates and distinct y-coordinates.
For a non-empty su... | instruction | 0 | 8,227 | 23 | 16,454 |
Yes | output | 1 | 8,227 | 23 | 16,455 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a set S of N points in a two-dimensional plane. The coordinates of the i-th point are (x_i, y_i). The N points have distinct x-coordinates and distinct y-coordinates.
For a non-empty su... | instruction | 0 | 8,228 | 23 | 16,456 |
No | output | 1 | 8,228 | 23 | 16,457 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a set S of N points in a two-dimensional plane. The coordinates of the i-th point are (x_i, y_i). The N points have distinct x-coordinates and distinct y-coordinates.
For a non-empty su... | instruction | 0 | 8,229 | 23 | 16,458 |
No | output | 1 | 8,229 | 23 | 16,459 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a set S of N points in a two-dimensional plane. The coordinates of the i-th point are (x_i, y_i). The N points have distinct x-coordinates and distinct y-coordinates.
For a non-empty su... | instruction | 0 | 8,230 | 23 | 16,460 |
No | output | 1 | 8,230 | 23 | 16,461 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a set S of N points in a two-dimensional plane. The coordinates of the i-th point are (x_i, y_i). The N points have distinct x-coordinates and distinct y-coordinates.
For a non-empty su... | instruction | 0 | 8,231 | 23 | 16,462 |
No | output | 1 | 8,231 | 23 | 16,463 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vus the Cossack has a field with dimensions n × m, which consists of "0" and "1". He is building an infinite field from this field. He is doing this in this way:
1. He takes the current field and finds a new inverted field. In other words... | instruction | 0 | 8,435 | 23 | 16,870 |
Tags: divide and conquer, implementation, math
Correct Solution:
```
from sys import stdin,stdout
n,m,q = map(int, stdin.readline().split())
mat = [[0]*m for i in range(n)]
for i in range(n):
row = stdin.readline().strip()
for j,c in enumerate(row):
mat[i][j] = 1 if c == '1' else -1
#print(mat)
def ... | output | 1 | 8,435 | 23 | 16,871 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vus the Cossack has a field with dimensions n × m, which consists of "0" and "1". He is building an infinite field from this field. He is doing this in this way:
1. He takes the current field... | instruction | 0 | 8,436 | 23 | 16,872 |
No | output | 1 | 8,436 | 23 | 16,873 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vus the Cossack has a field with dimensions n × m, which consists of "0" and "1". He is building an infinite field from this field. He is doing this in this way:
1. He takes the current field... | instruction | 0 | 8,437 | 23 | 16,874 |
No | output | 1 | 8,437 | 23 | 16,875 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A star map in Berland is a checked field n × m squares. In each square there is or there is not a star. The favourite constellation of all Berland's astronomers is the constellation of the Cross. This constellation can be formed by any 5 sta... | instruction | 0 | 8,623 | 23 | 17,246 |
Tags: implementation
Correct Solution:
```
import sys
from array import array # noqa: F401
def input():
return sys.stdin.buffer.readline().decode('utf-8')
n, m, k = map(int, input().split())
a = [tuple(map(lambda c: c == '*', input().rstrip())) for _ in range(n)]
cnt = [0] * 400
for i in range(1, n - 1):
... | output | 1 | 8,623 | 23 | 17,247 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A star map in Berland is a checked field n × m squares. In each square there is or there is not a star. The favourite constellation of all Berland's astronomers is the constellation of the Cross. This constellation can be formed by any 5 sta... | instruction | 0 | 8,624 | 23 | 17,248 |
Tags: implementation
Correct Solution:
```
import sys
from array import array # noqa: F401
def input():
return sys.stdin.buffer.readline().decode('utf-8')
n, m, k = map(int, input().split())
a = [tuple(map(lambda c: c == '*', input().rstrip())) for _ in range(n)]
cnt = [0] * 400
for i in range(1, n - 1):
... | output | 1 | 8,624 | 23 | 17,249 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A star map in Berland is a checked field n × m squares. In each square there is or there is not a star. The favourite constellation of all Berland's astronomers is the constellation of the Cross... | instruction | 0 | 8,625 | 23 | 17,250 |
No | output | 1 | 8,625 | 23 | 17,251 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A star map in Berland is a checked field n × m squares. In each square there is or there is not a star. The favourite constellation of all Berland's astronomers is the constellation of the Cross... | instruction | 0 | 8,626 | 23 | 17,252 |
No | output | 1 | 8,626 | 23 | 17,253 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A star map in Berland is a checked field n × m squares. In each square there is or there is not a star. The favourite constellation of all Berland's astronomers is the constellation of the Cross... | instruction | 0 | 8,627 | 23 | 17,254 |
No | output | 1 | 8,627 | 23 | 17,255 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A star map in Berland is a checked field n × m squares. In each square there is or there is not a star. The favourite constellation of all Berland's astronomers is the constellation of the Cross... | instruction | 0 | 8,628 | 23 | 17,256 |
No | output | 1 | 8,628 | 23 | 17,257 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasiliy finally got to work, where there is a huge amount of tasks waiting for him. Vasiliy is given a matrix consisting of n rows and m columns and q tasks. Each task is to swap two submatrices... | instruction | 0 | 8,713 | 23 | 17,426 |
No | output | 1 | 8,713 | 23 | 17,427 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.