message stringlengths 2 19.9k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 322 108k | cluster float64 15 15 | __index_level_0__ int64 644 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have a garden consisting entirely of grass and weeds. Your garden is described by an n × m grid, with rows numbered 1 to n from top to bottom, and columns 1 to m from left to right. Each cel... | instruction | 0 | 43,887 | 15 | 87,774 |
Yes | output | 1 | 43,887 | 15 | 87,775 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have a garden consisting entirely of grass and weeds. Your garden is described by an n × m grid, with rows numbered 1 to n from top to bottom, and columns 1 to m from left to right. Each cel... | instruction | 0 | 43,888 | 15 | 87,776 |
Yes | output | 1 | 43,888 | 15 | 87,777 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have a garden consisting entirely of grass and weeds. Your garden is described by an n × m grid, with rows numbered 1 to n from top to bottom, and columns 1 to m from left to right. Each cel... | instruction | 0 | 43,889 | 15 | 87,778 |
Yes | output | 1 | 43,889 | 15 | 87,779 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have a garden consisting entirely of grass and weeds. Your garden is described by an n × m grid, with rows numbered 1 to n from top to bottom, and columns 1 to m from left to right. Each cel... | instruction | 0 | 43,890 | 15 | 87,780 |
Yes | output | 1 | 43,890 | 15 | 87,781 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have a garden consisting entirely of grass and weeds. Your garden is described by an n × m grid, with rows numbered 1 to n from top to bottom, and columns 1 to m from left to right. Each cel... | instruction | 0 | 43,891 | 15 | 87,782 |
No | output | 1 | 43,891 | 15 | 87,783 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have a garden consisting entirely of grass and weeds. Your garden is described by an n × m grid, with rows numbered 1 to n from top to bottom, and columns 1 to m from left to right. Each cel... | instruction | 0 | 43,892 | 15 | 87,784 |
No | output | 1 | 43,892 | 15 | 87,785 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have a garden consisting entirely of grass and weeds. Your garden is described by an n × m grid, with rows numbered 1 to n from top to bottom, and columns 1 to m from left to right. Each cel... | instruction | 0 | 43,893 | 15 | 87,786 |
No | output | 1 | 43,893 | 15 | 87,787 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have a garden consisting entirely of grass and weeds. Your garden is described by an n × m grid, with rows numbered 1 to n from top to bottom, and columns 1 to m from left to right. Each cel... | instruction | 0 | 43,894 | 15 | 87,788 |
No | output | 1 | 43,894 | 15 | 87,789 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Jack is working on his jumping skills recently. Currently he's located at point zero of the number line. He would like to get to the point x. In order to train, he has decided that he'll first jump by only one unit, and each subsequent jump ... | instruction | 0 | 43,912 | 15 | 87,824 |
Tags: math
Correct Solution:
```
"""
Jack is working on his jumping skills recently. Currently he's located at point zero of the number line. He would like to get to the point x. In order to train, he has decided that he'll first jump by only one unit, and each subsequent jump will be exactly one longer than the previo... | output | 1 | 43,912 | 15 | 87,825 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Jack is working on his jumping skills recently. Currently he's located at point zero of the number line. He would like to get to the point x. In order to train, he has decided that he'll first jump by only one unit, and each subsequent jump ... | instruction | 0 | 43,913 | 15 | 87,826 |
Tags: math
Correct Solution:
```
x, s, v = abs(int(input())), 0, 0
while s < x or (x ^ s) & 1:
v += 1
s += v
print(v)
``` | output | 1 | 43,913 | 15 | 87,827 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Jack is working on his jumping skills recently. Currently he's located at point zero of the number line. He would like to get to the point x. In order to train, he has decided that he'll first jump by only one unit, and each subsequent jump ... | instruction | 0 | 43,915 | 15 | 87,830 |
Tags: math
Correct Solution:
```
x=abs(int(input()));lis=[];sq=0;i=1
while sq<x or (sq-x)%2==1:
sq=sq+i
lis.append(i)
i+=1
print(len(lis))
``` | output | 1 | 43,915 | 15 | 87,831 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Jack is working on his jumping skills recently. Currently he's located at point zero of the number line. He would like to get to the point x. In order to train, he has decided that he'll first jump by only one unit, and each subsequent jump ... | instruction | 0 | 43,916 | 15 | 87,832 |
Tags: math
Correct Solution:
```
def getsum(x):
return int((x * (x + 1)) / 2)
def countJumps(n):
n = abs(n)
ans = 0
while (getsum(ans) < n or
(getsum(ans) - n) & 1):
ans += 1
return ans
if __name__ == '__main__':
n = int(input())
print(countJumps(n))
``` | output | 1 | 43,916 | 15 | 87,833 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Jack is working on his jumping skills recently. Currently he's located at point zero of the number line. He would like to get to the point x. In order to train, he has decided that he'll first jump by only one unit, and each subsequent jump ... | instruction | 0 | 43,917 | 15 | 87,834 |
Tags: math
Correct Solution:
```
__author__ = 'Darren'
def solve():
from math import ceil
x = abs(int(input()))
k = ceil(((8 * x + 1) ** 0.5 - 1) / 2)
location = k * (k + 1) // 2
if location == x or (location - x) % 2 == 0:
print(k)
elif ((location - x) + (k + 1)) % 2 == 0:
pri... | output | 1 | 43,917 | 15 | 87,835 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Jack is working on his jumping skills recently. Currently he's located at point zero of the number line. He would like to get to the point x. In order to train, he has decided that he'll first jump by only one unit, and each subsequent jump ... | instruction | 0 | 43,918 | 15 | 87,836 |
Tags: math
Correct Solution:
```
def main():
x = int(input())
print(jumps(x))
def jumps(n):
n = abs(n)
i = 0
while True:
product = i * (i + 1) // 2
if product >= n and product % 2 == n % 2:
return i
i += 1
#print(jumps(6))
main()
``` | output | 1 | 43,918 | 15 | 87,837 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Jack is working on his jumping skills recently. Currently he's located at point zero of the number line. He would like to get to the point x. In order to train, he has decided that he'll first j... | instruction | 0 | 43,920 | 15 | 87,840 |
Yes | output | 1 | 43,920 | 15 | 87,841 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Amr lives in Lala Land. Lala Land is a very beautiful country that is located on a coordinate line. Lala Land is famous with its apple trees growing everywhere.
Lala Land has exactly n apple trees. Tree number i is located in a position xi ... | instruction | 0 | 44,239 | 15 | 88,478 |
Tags: brute force, implementation, sortings
Correct Solution:
```
n=int(input())
a=dict()
b=dict()
c=0
for i in range(n):
x,y=map(int,input().split())
if(x<0):
a.update({x:y})
else:
b.update({x:y})
if(len(a)>len(b)):
for i in range(len(b)+1):
c+=a[max(a.keys())]
del a[max... | output | 1 | 44,239 | 15 | 88,479 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Amr lives in Lala Land. Lala Land is a very beautiful country that is located on a coordinate line. Lala Land is famous with its apple trees growing everywhere.
Lala Land has exactly n apple trees. Tree number i is located in a position xi ... | instruction | 0 | 44,240 | 15 | 88,480 |
Tags: brute force, implementation, sortings
Correct Solution:
```
n = int(input())
trees = list()
for i in range(n):
x, a = map(int, input().split())
trees.append((x, a))
trees.sort()
from bisect import bisect
i = bisect(trees, (0, 0))
cnt = min(i, n - i)
l1, r1 = max(0, i - cnt - 1), min(n, i + cnt)
l2, r2 = m... | output | 1 | 44,240 | 15 | 88,481 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Amr lives in Lala Land. Lala Land is a very beautiful country that is located on a coordinate line. Lala Land is famous with its apple trees growing everywhere.
Lala Land has exactly n apple trees. Tree number i is located in a position xi ... | instruction | 0 | 44,241 | 15 | 88,482 |
Tags: brute force, implementation, sortings
Correct Solution:
```
def main():
n = int(input())
l = list(tuple(map(int, input().split())) for _ in range(n))
l.append((0, 0))
l.sort()
start = l.index((0, 0)) * 2
lo, hi = 0, n + 1
if start > n:
lo = start - n - 1
elif start < n - 1:... | output | 1 | 44,241 | 15 | 88,483 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Amr lives in Lala Land. Lala Land is a very beautiful country that is located on a coordinate line. Lala Land is famous with its apple trees growing everywhere.
Lala Land has exactly n apple trees. Tree number i is located in a position xi ... | instruction | 0 | 44,242 | 15 | 88,484 |
Tags: brute force, implementation, sortings
Correct Solution:
```
def nsum(a):
res = 0
for i in range(len(a)):
res += a[i][1]
return res
n = int(input())
l, r = [], []
for i in range(n):
x, t = [int(x) for x in input().split()]
if x < 0:
l.append([-x, t])
else:
r.append(... | output | 1 | 44,242 | 15 | 88,485 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Amr lives in Lala Land. Lala Land is a very beautiful country that is located on a coordinate line. Lala Land is famous with its apple trees growing everywhere.
Lala Land has exactly n apple trees. Tree number i is located in a position xi ... | instruction | 0 | 44,243 | 15 | 88,486 |
Tags: brute force, implementation, sortings
Correct Solution:
```
n = int(input())
lefts = {}
rights = {}
for i in range(n):
xi, ai = map(int, input().split())
if xi < 0:
lefts[xi] = ai
else:
rights[xi] = ai
lefts = [v[1] for v in sorted(lefts.items(), reverse=True)]
rights = [v[1] for v... | output | 1 | 44,243 | 15 | 88,487 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Amr lives in Lala Land. Lala Land is a very beautiful country that is located on a coordinate line. Lala Land is famous with its apple trees growing everywhere.
Lala Land has exactly n apple trees. Tree number i is located in a position xi ... | instruction | 0 | 44,244 | 15 | 88,488 |
Tags: brute force, implementation, sortings
Correct Solution:
```
def show_direction(num:int) -> str:
if num>= 0:
return 'right'
else:
return 'left'
def reverse(_str:str) -> str:
if _str == 'right':
return 'left'
else:
return 'right'
number = int(input())
coord... | output | 1 | 44,244 | 15 | 88,489 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Amr lives in Lala Land. Lala Land is a very beautiful country that is located on a coordinate line. Lala Land is famous with its apple trees growing everywhere.
Lala Land has exactly n apple trees. Tree number i is located in a position xi ... | instruction | 0 | 44,245 | 15 | 88,490 |
Tags: brute force, implementation, sortings
Correct Solution:
```
n = int(input())
l = []
r = []
u = []
for i in range(n):
x, a = map(int,input().split())
u += [(x, a)]
u.sort()
for e in u:
if e[0] < 0:
l += [e[1]]
else:
r += [e[1]]
l.reverse()
if len(l) == len(r):
print(sum(l) + sum... | output | 1 | 44,245 | 15 | 88,491 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Amr lives in Lala Land. Lala Land is a very beautiful country that is located on a coordinate line. Lala Land is famous with its apple trees growing everywhere.
Lala Land has exactly n apple trees. Tree number i is located in a position xi ... | instruction | 0 | 44,246 | 15 | 88,492 |
Tags: brute force, implementation, sortings
Correct Solution:
```
n = int(input())
a = []
for i in range(n):
a.append(tuple(map(int, input().split())))
a.sort()
ans = 0
ind = 0
while (ind < n and a[ind][0] < 0):
ind += 1
k = 1
sign = -1
while (0 <= ind < n):
ans += a[ind][1]
ind += sign * k
k += 1
... | output | 1 | 44,246 | 15 | 88,493 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A breakthrough among computer games, "Civilization XIII", is striking in its scale and elaborate details. Let's take a closer look at one of them.
The playing area in the game is split into congruent cells that are regular hexagons. The sid... | instruction | 0 | 44,323 | 15 | 88,646 |
Tags: binary search, geometry, math, two pointers
Correct Solution:
```
from math import sqrt
# t = int(input())
t = 1
rList = [int(i) for i in input().split(' ')]
for i in range(t):
r = rList[i]
r2 = r * r
sums = 0
b = 1
sig = True
while(b <= r):
a = b - 0.5
n1 = sqrt((r2 - a ... | output | 1 | 44,323 | 15 | 88,647 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A breakthrough among computer games, "Civilization XIII", is striking in its scale and elaborate details. Let's take a closer look at one of them.
The playing area in the game is split into congruent cells that are regular hexagons. The sid... | instruction | 0 | 44,324 | 15 | 88,648 |
Tags: binary search, geometry, math, two pointers
Correct Solution:
```
import sys
from array import array # noqa: F401
def input():
return sys.stdin.buffer.readline().decode('utf-8')
k = int(input())
R = 4 * k**2
def judge(x, y, c):
if x & 1:
return (
c >= 12 * y**2 + 24 * y + 12
... | output | 1 | 44,324 | 15 | 88,649 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A breakthrough among computer games, "Civilization XIII", is striking in its scale and elaborate details. Let's take a closer look at one of them.
The playing area in the game is split into congruent cells that are regular hexagons. The sid... | instruction | 0 | 44,325 | 15 | 88,650 |
Tags: binary search, geometry, math, two pointers
Correct Solution:
```
n = int(input())
if n < 3:
print(1)
else:
fail = []
x = 0
y = (n // 3 + 1) * 2
while y >= x:
while 4*n*n >= (3*y+2)*(3*y+2)+3*x*x:
x += 2
fail.append((x, y))
if x:
x -= 1
... | output | 1 | 44,325 | 15 | 88,651 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A breakthrough among computer games, "Civilization XIII", is striking in its scale and elaborate details. Let's take a closer look at one of them.
The playing area in the game is split into congruent cells that are regular hexagons. The sid... | instruction | 0 | 44,326 | 15 | 88,652 |
Tags: binary search, geometry, math, two pointers
Correct Solution:
```
import math
k = int(input())
n = int(k/3)*2 + 1
# print('n', n)
ans = 0
last = 0
while True:
point_to_check = (n+2)//2
# print('p', point_to_check)
x = 0.0
y = n# *math.sqrt(3)
# print('r', math.sqrt((x**2+y**2)))
# ... | output | 1 | 44,326 | 15 | 88,653 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A breakthrough among computer games, "Civilization XIII", is striking in its scale and elaborate details. Let's take a closer look at one of them.
The playing area in the game is split into congruent cells that are regular hexagons. The sid... | instruction | 0 | 44,327 | 15 | 88,654 |
Tags: binary search, geometry, math, two pointers
Correct Solution:
```
import math
k = int(input())
n = int(k/3)*2 + 1
# print('n', n)
ans = 0
last = 0
while True:
point_to_check = (n+2)//2
# print('p', point_to_check)
x = 0.0
y = n# *math.sqrt(3)
# print('r', math.sqrt((x**2+y**2)))
# ... | output | 1 | 44,327 | 15 | 88,655 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A breakthrough among computer games, "Civilization XIII", is striking in its scale and elaborate details. Let's take a closer look at one of them.
The playing area in the game is split into con... | instruction | 0 | 44,328 | 15 | 88,656 |
No | output | 1 | 44,328 | 15 | 88,657 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A breakthrough among computer games, "Civilization XIII", is striking in its scale and elaborate details. Let's take a closer look at one of them.
The playing area in the game is split into con... | instruction | 0 | 44,330 | 15 | 88,660 |
No | output | 1 | 44,330 | 15 | 88,661 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A breakthrough among computer games, "Civilization XIII", is striking in its scale and elaborate details. Let's take a closer look at one of them.
The playing area in the game is split into con... | instruction | 0 | 44,331 | 15 | 88,662 |
No | output | 1 | 44,331 | 15 | 88,663 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a chess board with n rows and n columns. Initially all cells of the board are empty, and you have to put a white or a black knight into each cell of the board.
A knight is a chess piece that can attack a piece in cell (x_2, y_... | instruction | 0 | 44,693 | 15 | 89,386 |
Tags: constructive algorithms, greedy
Correct Solution:
```
n = int(input())
t = ['WB', 'BW']
for i in range(n):
print(t[i & 1] * (n // 2) + t[i & 1][:n % 2])
``` | output | 1 | 44,693 | 15 | 89,387 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a chess board with n rows and n columns. Initially all cells of the board are empty, and you have to put a white or a black knight into each cell of the board.
A knight is a chess piece that can attack a piece in cell (x_2, y_... | instruction | 0 | 44,694 | 15 | 89,388 |
Tags: constructive algorithms, greedy
Correct Solution:
```
import math
n=int(input())
a=[[0 for i in range (n)]for j in range(n)]
for i in range(n):
if i%2:
ch='B'
else:
ch='W'
for j in range(n):
print(ch,end="")
if ch=="W":
ch='B'
else:
ch="... | output | 1 | 44,694 | 15 | 89,389 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a chess board with n rows and n columns. Initially all cells of the board are empty, and you have to put a white or a black knight into each cell of the board.
A knight is a chess piece that can attack a piece in cell (x_2, y_... | instruction | 0 | 44,695 | 15 | 89,390 |
Tags: constructive algorithms, greedy
Correct Solution:
```
a=int(input())
t=''
r=''
for i in range(a):
if(i%2==0):
t=t+'W'
r=r+'B'
else:
t=t+'B'
r=r+'W'
for i in range(a):
if(i%2==0):
print(r)
else:
print(t)
``` | output | 1 | 44,695 | 15 | 89,391 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a chess board with n rows and n columns. Initially all cells of the board are empty, and you have to put a white or a black knight into each cell of the board.
A knight is a chess piece that can attack a piece in cell (x_2, y_... | instruction | 0 | 44,696 | 15 | 89,392 |
Tags: constructive algorithms, greedy
Correct Solution:
```
t = int(input())
s = 'WB' * ((t + 3) // 2)
for i in range (t):
if i % 2 == 0:
print(s[:t])
else:
print(s[1:t + 1])
``` | output | 1 | 44,696 | 15 | 89,393 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a chess board with n rows and n columns. Initially all cells of the board are empty, and you have to put a white or a black knight into each cell of the board.
A knight is a chess piece that can attack a piece in cell (x_2, y_... | instruction | 0 | 44,697 | 15 | 89,394 |
Tags: constructive algorithms, greedy
Correct Solution:
```
n= int(input())
for i in range(n):
for j in range(n):
if (i+j)%2==1:
print('W',end='')
else:
print('B',end='')
print()
``` | output | 1 | 44,697 | 15 | 89,395 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a chess board with n rows and n columns. Initially all cells of the board are empty, and you have to put a white or a black knight into each cell of the board.
A knight is a chess piece that can attack a piece in cell (x_2, y_... | instruction | 0 | 44,698 | 15 | 89,396 |
Tags: constructive algorithms, greedy
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
def main():
n = int(input())
if n % 2 != 0:
for i in range(n * n):
if i % 2 == 0:
print("W", end = "")
else:
print("B", end = "")
... | output | 1 | 44,698 | 15 | 89,397 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a chess board with n rows and n columns. Initially all cells of the board are empty, and you have to put a white or a black knight into each cell of the board.
A knight is a chess piece that can attack a piece in cell (x_2, y_... | instruction | 0 | 44,699 | 15 | 89,398 |
Tags: constructive algorithms, greedy
Correct Solution:
```
n=int(input())
for i in range(n):print(('WB'*n)[i:][:n])
``` | output | 1 | 44,699 | 15 | 89,399 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a chess board with n rows and n columns. Initially all cells of the board are empty, and you have to put a white or a black knight into each cell of the board.
A knight is a chess piece that can attack a piece in cell (x_2, y_... | instruction | 0 | 44,700 | 15 | 89,400 |
Tags: constructive algorithms, greedy
Correct Solution:
```
num = int(input())
even = "WB" * (num//2) + "W" * (num%2)
odd = "BW" * (num//2) + "B" * (num%2)
for i in range(num):
if(i%2==0): print(even)
else: print(odd)
``` | output | 1 | 44,700 | 15 | 89,401 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a chess board with n rows and n columns. Initially all cells of the board are empty, and you have to put a white or a black knight into each cell of the board.
A knight is a chess... | instruction | 0 | 44,701 | 15 | 89,402 |
Yes | output | 1 | 44,701 | 15 | 89,403 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a chess board with n rows and n columns. Initially all cells of the board are empty, and you have to put a white or a black knight into each cell of the board.
A knight is a chess... | instruction | 0 | 44,702 | 15 | 89,404 |
Yes | output | 1 | 44,702 | 15 | 89,405 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a chess board with n rows and n columns. Initially all cells of the board are empty, and you have to put a white or a black knight into each cell of the board.
A knight is a chess... | instruction | 0 | 44,703 | 15 | 89,406 |
Yes | output | 1 | 44,703 | 15 | 89,407 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a chess board with n rows and n columns. Initially all cells of the board are empty, and you have to put a white or a black knight into each cell of the board.
A knight is a chess... | instruction | 0 | 44,704 | 15 | 89,408 |
Yes | output | 1 | 44,704 | 15 | 89,409 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a chess board with n rows and n columns. Initially all cells of the board are empty, and you have to put a white or a black knight into each cell of the board.
A knight is a chess... | instruction | 0 | 44,705 | 15 | 89,410 |
No | output | 1 | 44,705 | 15 | 89,411 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a chess board with n rows and n columns. Initially all cells of the board are empty, and you have to put a white or a black knight into each cell of the board.
A knight is a chess... | instruction | 0 | 44,706 | 15 | 89,412 |
No | output | 1 | 44,706 | 15 | 89,413 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a chess board with n rows and n columns. Initially all cells of the board are empty, and you have to put a white or a black knight into each cell of the board.
A knight is a chess... | instruction | 0 | 44,707 | 15 | 89,414 |
No | output | 1 | 44,707 | 15 | 89,415 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a chess board with n rows and n columns. Initially all cells of the board are empty, and you have to put a white or a black knight into each cell of the board.
A knight is a chess... | instruction | 0 | 44,708 | 15 | 89,416 |
No | output | 1 | 44,708 | 15 | 89,417 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ivan places knights on infinite chessboard. Initially there are n knights. If there is free cell which is under attack of at least 4 knights then he places new knight in this cell. Ivan repeats this until there are no such free cells. One ca... | instruction | 0 | 45,406 | 15 | 90,812 |
Tags: constructive algorithms
Correct Solution:
```
gcd = lambda a, b: gcd(b, a % b) if b else a
def main():
n = int(input())
if n == 1:
print(0, 0)
return
x = 2 * n // 3
if 2 * n % 2:
x += 1
s = 0
for i in range(x):
print(i, 0)
s += 1
for j in rang... | output | 1 | 45,406 | 15 | 90,813 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ivan places knights on infinite chessboard. Initially there are n knights. If there is free cell which is under attack of at least 4 knights then he places new knight in this cell. Ivan repeats this until there are no such free cells. One ca... | instruction | 0 | 45,407 | 15 | 90,814 |
Tags: constructive algorithms
Correct Solution:
```
n = int(input())
ans = [(0, 0)]
for i in range(1, n):
ans.append((0, i))
ans.append((i, 0))
ans.append((0, -i))
ans.append((-i, 0))
for i in range(n):
print(str(ans[i][0]) + ' ' + str(ans[i][1]))
``` | output | 1 | 45,407 | 15 | 90,815 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ivan places knights on infinite chessboard. Initially there are n knights. If there is free cell which is under attack of at least 4 knights then he places new knight in this cell. Ivan repeats this until there are no such free cells. One ca... | instruction | 0 | 45,408 | 15 | 90,816 |
Tags: constructive algorithms
Correct Solution:
```
n = int(input())
top = n // 3
for i in range(top):
x = 1 + 2 * i
print(str(x) + ' 3')
bot = n - top
for i in range(bot):
print(str(i) + ' 0')
``` | output | 1 | 45,408 | 15 | 90,817 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.