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 |
|---|---|---|---|---|---|
Provide a correct Python 3 solution for this coding contest problem.
There are N rabbits on a number line. The rabbits are conveniently numbered 1 through N. The coordinate of the initial position of rabbit i is x_i.
The rabbits will now take exercise on the number line, by performing sets described below. A set cons... | instruction | 0 | 41,959 | 15 | 83,918 |
"Correct Solution:
```
import sys
readline = sys.stdin.readline
def merge(A, B):
N = len(A)
res = [B[A[i]] for i in range(N)]
return res
N = int(readline())
X = list(map(int, readline().split()))
M, K = map(int, readline().split())
A = list(map(lambda x:int(x)-1, readline().split()))
Y = [x2 - x1 for x1,... | output | 1 | 41,959 | 15 | 83,919 |
Provide a correct Python 3 solution for this coding contest problem.
There are N rabbits on a number line. The rabbits are conveniently numbered 1 through N. The coordinate of the initial position of rabbit i is x_i.
The rabbits will now take exercise on the number line, by performing sets described below. A set cons... | instruction | 0 | 41,960 | 15 | 83,920 |
"Correct Solution:
```
N=int(input())
X=[int(i) for i in input().split()]
dX=[]
for i in range(N-1):
dX.append(X[i+1]-X[i])
M,K=map(int,input().split())
A=[int(i)-2 for i in input().split()]
Swap=[list(range(N-1)) for i in range(61)]
for a in A:
Swap[0][a],Swap[0][a+1]=Swap[0][a+1],Swap[0][a]
for k in range(60):
... | output | 1 | 41,960 | 15 | 83,921 |
Provide a correct Python 3 solution for this coding contest problem.
jfen
There is a one-person game to play on the H × W board. This game is a game to move 0 or 1 balls in each cell. You were playing this game and found it difficult to move the ball accurately from cell to cell because the ball is so round. So you d... | instruction | 0 | 42,044 | 15 | 84,088 |
"Correct Solution:
```
#!/usr/bin/env python3
while True:
s = input()
if s == '#':
break
a, b, c, d = map(lambda x: int(x) - 1, input().split())
tb = []
for i, x in enumerate(s.split('/')):
tb.append([])
for ch in x:
if ch == 'b':
tb[i].append('b')... | output | 1 | 42,044 | 15 | 84,089 |
Provide a correct Python 3 solution for this coding contest problem.
jfen
There is a one-person game to play on the H × W board. This game is a game to move 0 or 1 balls in each cell. You were playing this game and found it difficult to move the ball accurately from cell to cell because the ball is so round. So you d... | instruction | 0 | 42,045 | 15 | 84,090 |
"Correct Solution:
```
def j2b(S):
rows = S.split("/")
for i, row in enumerate(rows):
cand = []
for s in row:
if s == "b":
cand.append(s)
else:
cand.extend(["."] * int(s))
rows[i] = cand
return rows
def b2j(rows):
ret = []... | output | 1 | 42,045 | 15 | 84,091 |
Provide a correct Python 3 solution for this coding contest problem.
jfen
There is a one-person game to play on the H × W board. This game is a game to move 0 or 1 balls in each cell. You were playing this game and found it difficult to move the ball accurately from cell to cell because the ball is so round. So you d... | instruction | 0 | 42,046 | 15 | 84,092 |
"Correct Solution:
```
def main():
S = input().split("/")
if S[0] == "#":
return
for s in range(len(S)):
for i in range(10):
S[s]= S[s].replace(str(i),"."*i)
a,b,c,d = map(int,input().split())
S[a-1] = S[a-1][:b-1]+"."+S[a-1][b:]
S[c-1] = S[c-1][:d-1]+"b"+S[c-1][d:]
for s in range(len(S)):
ref = ""
te... | output | 1 | 42,046 | 15 | 84,093 |
Provide a correct Python 3 solution for this coding contest problem.
jfen
There is a one-person game to play on the H × W board. This game is a game to move 0 or 1 balls in each cell. You were playing this game and found it difficult to move the ball accurately from cell to cell because the ball is so round. So you d... | instruction | 0 | 42,047 | 15 | 84,094 |
"Correct Solution:
```
while True:
S = input()
if S == "#":
break
a, b, c, d = map(int, input().split())
hasBall = [[False for _ in range(10)] for _ in range(10)]
rows = S.split('/')
H = len(rows)
for h, row in enumerate(rows, start=1):
cur = 1
colsize = 0
... | output | 1 | 42,047 | 15 | 84,095 |
Provide a correct Python 3 solution for this coding contest problem.
jfen
There is a one-person game to play on the H × W board. This game is a game to move 0 or 1 balls in each cell. You were playing this game and found it difficult to move the ball accurately from cell to cell because the ball is so round. So you d... | instruction | 0 | 42,048 | 15 | 84,096 |
"Correct Solution:
```
while 1:
s = input()
if s == '#':
break
M = []
for l in s.split('/'):
num = 0
tmp = []
for c in l:
if c == 'b':
if num > 0:
tmp.extend([0]*num)
tmp.append(1)
num = 0
... | output | 1 | 42,048 | 15 | 84,097 |
Provide a correct Python 3 solution for this coding contest problem.
jfen
There is a one-person game to play on the H × W board. This game is a game to move 0 or 1 balls in each cell. You were playing this game and found it difficult to move the ball accurately from cell to cell because the ball is so round. So you d... | instruction | 0 | 42,049 | 15 | 84,098 |
"Correct Solution:
```
now=input()
while now!="#":
order_raw = input()
order = [int(s)-1 for s in order_raw.split(' ')]
box = [[]]
for n in now:
if n=='/':
box.append([])
elif n=='b':
box[-1].append('b')
else:
for _ in range(int(n)):
... | output | 1 | 42,049 | 15 | 84,099 |
Provide a correct Python 3 solution for this coding contest problem.
jfen
There is a one-person game to play on the H × W board. This game is a game to move 0 or 1 balls in each cell. You were playing this game and found it difficult to move the ball accurately from cell to cell because the ball is so round. So you d... | instruction | 0 | 42,050 | 15 | 84,100 |
"Correct Solution:
```
while True:
st = list(input().split("/"))
if st == ["#"]:
break
a, b, c, d = map(int, input().split())
s=[]
for i in range(len(st)):
str=[]
for ele in st[i]:
if ele=="b":
str.append("b")
else:
for... | output | 1 | 42,050 | 15 | 84,101 |
Provide a correct Python 3 solution for this coding contest problem.
jfen
There is a one-person game to play on the H × W board. This game is a game to move 0 or 1 balls in each cell. You were playing this game and found it difficult to move the ball accurately from cell to cell because the ball is so round. So you d... | instruction | 0 | 42,051 | 15 | 84,102 |
"Correct Solution:
```
while 1:
s=input()
if '#' in s:break
p=0
e=[[]*2 for _ in range(10)]
for x in s:
if x=='b':e[p]+=['b']
elif x=='/':p+=1
else:e[p]+='.'*int(x)
ans=''
a,b,c,d=map(int,input().split())
e[a-1][b-1],e[c-1][d-1]=e[c-1][d-1],e[a-1][b-1]
for i i... | output | 1 | 42,051 | 15 | 84,103 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
jfen
There is a one-person game to play on the H × W board. This game is a game to move 0 or 1 balls in each cell. You were playing this game and found it difficult to move the ball accurately ... | instruction | 0 | 42,052 | 15 | 84,104 |
Yes | output | 1 | 42,052 | 15 | 84,105 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
jfen
There is a one-person game to play on the H × W board. This game is a game to move 0 or 1 balls in each cell. You were playing this game and found it difficult to move the ball accurately ... | instruction | 0 | 42,053 | 15 | 84,106 |
Yes | output | 1 | 42,053 | 15 | 84,107 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
jfen
There is a one-person game to play on the H × W board. This game is a game to move 0 or 1 balls in each cell. You were playing this game and found it difficult to move the ball accurately ... | instruction | 0 | 42,054 | 15 | 84,108 |
Yes | output | 1 | 42,054 | 15 | 84,109 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
jfen
There is a one-person game to play on the H × W board. This game is a game to move 0 or 1 balls in each cell. You were playing this game and found it difficult to move the ball accurately ... | instruction | 0 | 42,055 | 15 | 84,110 |
Yes | output | 1 | 42,055 | 15 | 84,111 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
jfen
There is a one-person game to play on the H × W board. This game is a game to move 0 or 1 balls in each cell. You were playing this game and found it difficult to move the ball accurately ... | instruction | 0 | 42,056 | 15 | 84,112 |
No | output | 1 | 42,056 | 15 | 84,113 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
jfen
There is a one-person game to play on the H × W board. This game is a game to move 0 or 1 balls in each cell. You were playing this game and found it difficult to move the ball accurately ... | instruction | 0 | 42,057 | 15 | 84,114 |
No | output | 1 | 42,057 | 15 | 84,115 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
jfen
There is a one-person game to play on the H × W board. This game is a game to move 0 or 1 balls in each cell. You were playing this game and found it difficult to move the ball accurately ... | instruction | 0 | 42,058 | 15 | 84,116 |
No | output | 1 | 42,058 | 15 | 84,117 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Egor wants to achieve a rating of 1600 points on the well-known chess portal ChessForces and he needs your help!
Before you start solving the problem, Egor wants to remind you how the chess pieces move. Chess rook moves along straight lines... | instruction | 0 | 42,221 | 15 | 84,442 |
Tags: brute force, constructive algorithms
Correct Solution:
```
ls = [
[6,3,8],
[1,2,7],
[9,4,5]
]
n = int(input())
if n <= 2:
print(-1)
exit()
ans = [[0 for i in range(n)] for j in range(n)]
for i in range(3):
for j in range(3):
ans[i][j] = ls[i][j]+n**2-9
x,y = 2,0
d = "D"
for i in range(1,n**2-8)[::... | output | 1 | 42,221 | 15 | 84,443 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Egor wants to achieve a rating of 1600 points on the well-known chess portal ChessForces and he needs your help!
Before you start solving the problem, Egor wants to remind you how the chess pieces move. Chess rook moves along straight lines... | instruction | 0 | 42,222 | 15 | 84,444 |
Tags: brute force, constructive algorithms
Correct Solution:
```
import sys
input = sys.stdin.buffer.readline
N = int(input())
if N < 3:
print(-1)
exit(0)
board = [[0 for j in range(N)] for i in range(N)]
base = [ [7,4,8] , [9,2,3] , [1,5,6] ]
i = 3 + (N-2)//2 ; j = (N-1)//2 + 2
val = N*N - 8
for x in range(-... | output | 1 | 42,222 | 15 | 84,445 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Egor wants to achieve a rating of 1600 points on the well-known chess portal ChessForces and he needs your help!
Before you start solving the problem, Egor wants to remind you how the chess pieces move. Chess rook moves along straight lines... | instruction | 0 | 42,223 | 15 | 84,446 |
Tags: brute force, constructive algorithms
Correct Solution:
```
def main():
n = int(input())
if n < 3:
print(-1)
return
ans = [[0]*n for _ in range(n)]
st = n*n-9
ans[0][0:3] = [st+6,st+5,st+8]
ans[1][0:3] = [st+7,st+3,st+4]
ans[2][0:3] = [st+1,st+2,st+9]
cur = 1
... | output | 1 | 42,223 | 15 | 84,447 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Egor wants to achieve a rating of 1600 points on the well-known chess portal ChessForces and he needs your help!
Before you start solving the problem, Egor wants to remind you how the chess pieces move. Chess rook moves along straight lines... | instruction | 0 | 42,224 | 15 | 84,448 |
Tags: brute force, constructive algorithms
Correct Solution:
```
n = int(input())
if n < 3:
print(-1)
else:
ans = [[-1 for _ in range(n)] for _ in range(n)]
ans[0][0] = n*n-9+9
ans[0][1] = n*n-9+6
ans[0][2] = n*n-9+7
ans[1][0] = n*n-9+5
ans[1][1] = n*n-9+3
ans[1][2] = n*n-9+8
ans[2][0] = n*n-9+1
ans[2][1] = n... | output | 1 | 42,224 | 15 | 84,449 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Egor wants to achieve a rating of 1600 points on the well-known chess portal ChessForces and he needs your help!
Before you start solving the problem, Egor wants to remind you how the chess pieces move. Chess rook moves along straight lines... | instruction | 0 | 42,225 | 15 | 84,450 |
Tags: brute force, constructive algorithms
Correct Solution:
```
import sys
n = int(input())
if n <= 2:
print(-1)
sys.exit(0)
elif n == 3:
board = [[4, 5, 8], [3, 2, 6], [1, 9, 7]]
else:
board = [[0 for _ in range(n)] for _ in range(n)]
curr = 1
# Do a J-walk
for i in range(1, n ... | output | 1 | 42,225 | 15 | 84,451 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Egor wants to achieve a rating of 1600 points on the well-known chess portal ChessForces and he needs your help!
Before you start solving the problem, Egor wants to remind you how the chess pieces move. Chess rook moves along straight lines... | instruction | 0 | 42,226 | 15 | 84,452 |
Tags: brute force, constructive algorithms
Correct Solution:
```
def solve(n):
arr = [[0] * n for _ in range(n)]
arr[0][1] = n*n
arr[n-1][n-1] = n*n-1
arr[n-1][1] = n*n-2
arr[0][n-1] = n*n - (n+1)
cur = 1
r = n - 2
row_ = None
for i in range(n):
if arr[0][i] !... | output | 1 | 42,226 | 15 | 84,453 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Egor wants to achieve a rating of 1600 points on the well-known chess portal ChessForces and he needs your help!
Before you start solving the problem, Egor wants to remind you how the chess pieces move. Chess rook moves along straight lines... | instruction | 0 | 42,227 | 15 | 84,454 |
Tags: brute force, constructive algorithms
Correct Solution:
```
n = input()
n = int(n)
if n <=2:
print(-1)
elif n%2 ==0:
for row in range(n):
if row ==0:
for i in range(n):
if i ==0:
print(i+1,end = " ")
elif i==n-1:
... | output | 1 | 42,227 | 15 | 84,455 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Egor wants to achieve a rating of 1600 points on the well-known chess portal ChessForces and he needs your help!
Before you start solving the problem, Egor wants to remind you how the chess pieces move. Chess rook moves along straight lines... | instruction | 0 | 42,228 | 15 | 84,456 |
Tags: brute force, constructive algorithms
Correct Solution:
```
from bisect import bisect_left as bl
from bisect import bisect_right as br
from heapq import heappush,heappop
import math
from collections import *
from functools import reduce,cmp_to_key
import sys
input = sys.stdin.readline
M = mod = 998244353
def fact... | output | 1 | 42,228 | 15 | 84,457 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Egor wants to achieve a rating of 1600 points on the well-known chess portal ChessForces and he needs your help!
Before you start solving the problem, Egor wants to remind you how the chess pie... | instruction | 0 | 42,229 | 15 | 84,458 |
Yes | output | 1 | 42,229 | 15 | 84,459 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Egor wants to achieve a rating of 1600 points on the well-known chess portal ChessForces and he needs your help!
Before you start solving the problem, Egor wants to remind you how the chess pie... | instruction | 0 | 42,230 | 15 | 84,460 |
Yes | output | 1 | 42,230 | 15 | 84,461 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Egor wants to achieve a rating of 1600 points on the well-known chess portal ChessForces and he needs your help!
Before you start solving the problem, Egor wants to remind you how the chess pie... | instruction | 0 | 42,231 | 15 | 84,462 |
Yes | output | 1 | 42,231 | 15 | 84,463 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Egor wants to achieve a rating of 1600 points on the well-known chess portal ChessForces and he needs your help!
Before you start solving the problem, Egor wants to remind you how the chess pie... | instruction | 0 | 42,232 | 15 | 84,464 |
Yes | output | 1 | 42,232 | 15 | 84,465 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Egor wants to achieve a rating of 1600 points on the well-known chess portal ChessForces and he needs your help!
Before you start solving the problem, Egor wants to remind you how the chess pie... | instruction | 0 | 42,233 | 15 | 84,466 |
No | output | 1 | 42,233 | 15 | 84,467 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Egor wants to achieve a rating of 1600 points on the well-known chess portal ChessForces and he needs your help!
Before you start solving the problem, Egor wants to remind you how the chess pie... | instruction | 0 | 42,234 | 15 | 84,468 |
No | output | 1 | 42,234 | 15 | 84,469 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Egor wants to achieve a rating of 1600 points on the well-known chess portal ChessForces and he needs your help!
Before you start solving the problem, Egor wants to remind you how the chess pie... | instruction | 0 | 42,235 | 15 | 84,470 |
No | output | 1 | 42,235 | 15 | 84,471 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Egor wants to achieve a rating of 1600 points on the well-known chess portal ChessForces and he needs your help!
Before you start solving the problem, Egor wants to remind you how the chess pie... | instruction | 0 | 42,236 | 15 | 84,472 |
No | output | 1 | 42,236 | 15 | 84,473 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a chessboard consisting of n rows and n columns. Rows are numbered from bottom to top from 1 to n. Columns are numbered from left to right from 1 to n. The cell at the intersection of the x-th column and the y-th row is denoted... | instruction | 0 | 42,254 | 15 | 84,508 |
Tags: data structures, divide and conquer, greedy
Correct Solution:
```
import collections
import math
n, k, m = [int(i) for i in input().split()]
l = math.ceil((math.log(2*n) / math.log(2)))
p = 2 ** l
# print(p)
memo = [0] * (2 * p)
allres = [0] * (2 * p)
exist = set()
for _i in range(m):
x, y = [int(i) for i in... | output | 1 | 42,254 | 15 | 84,509 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a chessboard consisting of n rows and n columns. Rows are numbered from bottom to top from 1 to n. Columns are numbered from left to right from 1 to n. The cell at the intersection of the x-th column and the y-th row is denoted... | instruction | 0 | 42,255 | 15 | 84,510 |
Tags: data structures, divide and conquer, greedy
Correct Solution:
```
import collections
import math
n, k, m = [int(i) for i in input().split()]
l = math.ceil((math.log(2*n) / math.log(2)))
p = 2 ** l
memo = [0] * (2 * p)
allres = [0] * (2 * p)
exist = set()
for _i in range(m):
x, y = [int(i) for i in input().s... | output | 1 | 42,255 | 15 | 84,511 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a chessboard consisting of n rows and n columns. Rows are numbered from bottom to top from 1 to n. Columns are numbered from left to right from 1 to n. The cell at the intersection of the x-th column and the y-th row is denoted... | instruction | 0 | 42,256 | 15 | 84,512 |
Tags: data structures, divide and conquer, greedy
Correct Solution:
```
import math
n, k, m = [int(i) for i in input().split()]
l = math.ceil((math.log(2*n) / math.log(2)))
p = 2 ** l;memo = [0] * (2 * p);allres = [0] * (2 * p);exist = set()
for _i in range(m):
x, y = [int(i) for i in input().split()];l = abs(x - k... | output | 1 | 42,256 | 15 | 84,513 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a chessboard consisting of n rows and n columns. Rows are numbered from bottom to top from 1 to n. Columns are numbered from left to right from 1 to n. The cell at the intersection... | instruction | 0 | 42,257 | 15 | 84,514 |
No | output | 1 | 42,257 | 15 | 84,515 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a chessboard consisting of n rows and n columns. Rows are numbered from bottom to top from 1 to n. Columns are numbered from left to right from 1 to n. The cell at the intersection... | instruction | 0 | 42,258 | 15 | 84,516 |
No | output | 1 | 42,258 | 15 | 84,517 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a chessboard consisting of n rows and n columns. Rows are numbered from bottom to top from 1 to n. Columns are numbered from left to right from 1 to n. The cell at the intersection... | instruction | 0 | 42,259 | 15 | 84,518 |
No | output | 1 | 42,259 | 15 | 84,519 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a chessboard consisting of n rows and n columns. Rows are numbered from bottom to top from 1 to n. Columns are numbered from left to right from 1 to n. The cell at the intersection... | instruction | 0 | 42,260 | 15 | 84,520 |
No | output | 1 | 42,260 | 15 | 84,521 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya decided to learn to play chess. Classic chess doesn't seem interesting to him, so he plays his own sort of chess.
The queen is the piece that captures all squares on its vertical, horizontal and diagonal lines. If the cell is located ... | instruction | 0 | 42,454 | 15 | 84,908 |
Tags: constructive algorithms, games, math
Correct Solution:
```
n=int(input())
if n%2:
print("black")
else:
print("white")
print("1 2")
``` | output | 1 | 42,454 | 15 | 84,909 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya decided to learn to play chess. Classic chess doesn't seem interesting to him, so he plays his own sort of chess.
The queen is the piece that captures all squares on its vertical, horizontal and diagonal lines. If the cell is located ... | instruction | 0 | 42,455 | 15 | 84,910 |
Tags: constructive algorithms, games, math
Correct Solution:
```
n=int(input());
if n % 2 == 1:
print("black")
else :
print("white")
print("1 2")
``` | output | 1 | 42,455 | 15 | 84,911 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya decided to learn to play chess. Classic chess doesn't seem interesting to him, so he plays his own sort of chess.
The queen is the piece that captures all squares on its vertical, horizontal and diagonal lines. If the cell is located ... | instruction | 0 | 42,456 | 15 | 84,912 |
Tags: constructive algorithms, games, math
Correct Solution:
```
import sys
import os
# import numpy as np
from math import sqrt, gcd, ceil, log, floor, sin, pi
from math import factorial as fact
from bisect import bisect, bisect_left
from collections import defaultdict, Counter, deque
from heapq import heapify, heappu... | output | 1 | 42,456 | 15 | 84,913 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya decided to learn to play chess. Classic chess doesn't seem interesting to him, so he plays his own sort of chess.
The queen is the piece that captures all squares on its vertical, horizontal and diagonal lines. If the cell is located ... | instruction | 0 | 42,457 | 15 | 84,914 |
Tags: constructive algorithms, games, math
Correct Solution:
```
#!/usr/bin/env python3
# created : 2020. 12. 31. 23:59
import os
from sys import stdin, stdout
def solve(tc):
n = int(stdin.readline().strip())
if n%2:
print("black")
else:
print("white")
print("1 2")
tcs = 1
tc = ... | output | 1 | 42,457 | 15 | 84,915 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya decided to learn to play chess. Classic chess doesn't seem interesting to him, so he plays his own sort of chess.
The queen is the piece that captures all squares on its vertical, horizontal and diagonal lines. If the cell is located ... | instruction | 0 | 42,458 | 15 | 84,916 |
Tags: constructive algorithms, games, math
Correct Solution:
```
n=int(input())
if n%2: print('black')
else:
print('white')
print('1 2')
``` | output | 1 | 42,458 | 15 | 84,917 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya decided to learn to play chess. Classic chess doesn't seem interesting to him, so he plays his own sort of chess.
The queen is the piece that captures all squares on its vertical, horizontal and diagonal lines. If the cell is located ... | instruction | 0 | 42,459 | 15 | 84,918 |
Tags: constructive algorithms, games, math
Correct Solution:
```
n = int(input())
if n%2==1:
print("black")
else:
print("white")
print(1,2)
``` | output | 1 | 42,459 | 15 | 84,919 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya decided to learn to play chess. Classic chess doesn't seem interesting to him, so he plays his own sort of chess.
The queen is the piece that captures all squares on its vertical, horizontal and diagonal lines. If the cell is located ... | instruction | 0 | 42,460 | 15 | 84,920 |
Tags: constructive algorithms, games, math
Correct Solution:
```
import sys
input=sys.stdin.buffer.readline
import os
n=int(input())
if n%2==0:
print("white")
print("1 2")
else:
print("black")
``` | output | 1 | 42,460 | 15 | 84,921 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vasya decided to learn to play chess. Classic chess doesn't seem interesting to him, so he plays his own sort of chess.
The queen is the piece that captures all squares on its vertical, horizontal and diagonal lines. If the cell is located ... | instruction | 0 | 42,461 | 15 | 84,922 |
Tags: constructive algorithms, games, math
Correct Solution:
```
n = int(input())
if n % 2 == 0:
print("white\n1 2")
else:
print("black")
#######
``` | output | 1 | 42,461 | 15 | 84,923 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya decided to learn to play chess. Classic chess doesn't seem interesting to him, so he plays his own sort of chess.
The queen is the piece that captures all squares on its vertical, horizon... | instruction | 0 | 42,462 | 15 | 84,924 |
Yes | output | 1 | 42,462 | 15 | 84,925 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vasya decided to learn to play chess. Classic chess doesn't seem interesting to him, so he plays his own sort of chess.
The queen is the piece that captures all squares on its vertical, horizon... | instruction | 0 | 42,463 | 15 | 84,926 |
Yes | output | 1 | 42,463 | 15 | 84,927 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.