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 is a grid with H horizontal rows and W vertical columns. Let (i, j) denote the square at the i-th row from the top and the j-th column from the left.
For each i and j (1 \leq i \leq H, 1 \leq j \leq W), Square (i, j) is described by a characte... | instruction | 0 | 47,759 | 15 | 95,518 |
"Correct Solution:
```
h, w = map(int, input().split())
s = []
for _ in range(h):
s.append(input())
dp = [[0] * w] * h
p = 10**9 + 7
for i in range(h):
for j in range(w):
if s[i][j]=="#":
dp[i][j] = 0
elif i==0 and j==0:
dp[i][j] = 1
elif i==0:
dp[i][j] = dp[i][j-1]
elif j==0:
dp[i][j] = dp[i-1][j... | output | 1 | 47,759 | 15 | 95,519 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a grid with H horizontal rows and W vertical columns. Let (i, j) denote the square at the i-th row from the top and the j-th column from the left.
For each i and j (1 \leq i \leq H, 1 ... | instruction | 0 | 47,760 | 15 | 95,520 |
Yes | output | 1 | 47,760 | 15 | 95,521 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a grid with H horizontal rows and W vertical columns. Let (i, j) denote the square at the i-th row from the top and the j-th column from the left.
For each i and j (1 \leq i \leq H, 1 ... | instruction | 0 | 47,761 | 15 | 95,522 |
Yes | output | 1 | 47,761 | 15 | 95,523 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a grid with H horizontal rows and W vertical columns. Let (i, j) denote the square at the i-th row from the top and the j-th column from the left.
For each i and j (1 \leq i \leq H, 1 ... | instruction | 0 | 47,762 | 15 | 95,524 |
Yes | output | 1 | 47,762 | 15 | 95,525 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a grid with H horizontal rows and W vertical columns. Let (i, j) denote the square at the i-th row from the top and the j-th column from the left.
For each i and j (1 \leq i \leq H, 1 ... | instruction | 0 | 47,763 | 15 | 95,526 |
Yes | output | 1 | 47,763 | 15 | 95,527 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a grid with H horizontal rows and W vertical columns. Let (i, j) denote the square at the i-th row from the top and the j-th column from the left.
For each i and j (1 \leq i \leq H, 1 ... | instruction | 0 | 47,764 | 15 | 95,528 |
No | output | 1 | 47,764 | 15 | 95,529 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a grid with H horizontal rows and W vertical columns. Let (i, j) denote the square at the i-th row from the top and the j-th column from the left.
For each i and j (1 \leq i \leq H, 1 ... | instruction | 0 | 47,765 | 15 | 95,530 |
No | output | 1 | 47,765 | 15 | 95,531 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a grid with H horizontal rows and W vertical columns. Let (i, j) denote the square at the i-th row from the top and the j-th column from the left.
For each i and j (1 \leq i \leq H, 1 ... | instruction | 0 | 47,766 | 15 | 95,532 |
No | output | 1 | 47,766 | 15 | 95,533 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a grid with H horizontal rows and W vertical columns. Let (i, j) denote the square at the i-th row from the top and the j-th column from the left.
For each i and j (1 \leq i \leq H, 1 ... | instruction | 0 | 47,767 | 15 | 95,534 |
No | output | 1 | 47,767 | 15 | 95,535 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little penguin Polo adores integer segments, that is, pairs of integers [l; r] (l ≤ r).
He has a set that consists of n integer segments: [l1; r1], [l2; r2], ..., [ln; rn]. We know that no two... | instruction | 0 | 48,234 | 15 | 96,468 |
Yes | output | 1 | 48,234 | 15 | 96,469 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little penguin Polo adores integer segments, that is, pairs of integers [l; r] (l ≤ r).
He has a set that consists of n integer segments: [l1; r1], [l2; r2], ..., [ln; rn]. We know that no two... | instruction | 0 | 48,235 | 15 | 96,470 |
Yes | output | 1 | 48,235 | 15 | 96,471 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little penguin Polo adores integer segments, that is, pairs of integers [l; r] (l ≤ r).
He has a set that consists of n integer segments: [l1; r1], [l2; r2], ..., [ln; rn]. We know that no two... | instruction | 0 | 48,236 | 15 | 96,472 |
Yes | output | 1 | 48,236 | 15 | 96,473 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little penguin Polo adores integer segments, that is, pairs of integers [l; r] (l ≤ r).
He has a set that consists of n integer segments: [l1; r1], [l2; r2], ..., [ln; rn]. We know that no two... | instruction | 0 | 48,237 | 15 | 96,474 |
Yes | output | 1 | 48,237 | 15 | 96,475 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little penguin Polo adores integer segments, that is, pairs of integers [l; r] (l ≤ r).
He has a set that consists of n integer segments: [l1; r1], [l2; r2], ..., [ln; rn]. We know that no two... | instruction | 0 | 48,238 | 15 | 96,476 |
No | output | 1 | 48,238 | 15 | 96,477 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little penguin Polo adores integer segments, that is, pairs of integers [l; r] (l ≤ r).
He has a set that consists of n integer segments: [l1; r1], [l2; r2], ..., [ln; rn]. We know that no two... | instruction | 0 | 48,239 | 15 | 96,478 |
No | output | 1 | 48,239 | 15 | 96,479 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little penguin Polo adores integer segments, that is, pairs of integers [l; r] (l ≤ r).
He has a set that consists of n integer segments: [l1; r1], [l2; r2], ..., [ln; rn]. We know that no two... | instruction | 0 | 48,240 | 15 | 96,480 |
No | output | 1 | 48,240 | 15 | 96,481 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little penguin Polo adores integer segments, that is, pairs of integers [l; r] (l ≤ r).
He has a set that consists of n integer segments: [l1; r1], [l2; r2], ..., [ln; rn]. We know that no two... | instruction | 0 | 48,241 | 15 | 96,482 |
No | output | 1 | 48,241 | 15 | 96,483 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Igor is in the museum and he wants to see as many pictures as possible.
Museum can be represented as a rectangular field of n × m cells. Each cell is either empty or impassable. Empty cells are marked with '.', impassable cells are marked w... | instruction | 0 | 48,350 | 15 | 96,700 |
Tags: dfs and similar, graphs, shortest paths
Correct Solution:
```
import sys,io,os
from atexit import register
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
sys.stdout = io.BytesIO()
register(lambda :os.write(1,sys.stdout.getvalue()))
visited = [[0]*1002 for _ in range(1002)]
out = [[-1]*1002 for _ in ... | output | 1 | 48,350 | 15 | 96,701 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Igor is in the museum and he wants to see as many pictures as possible.
Museum can be represented as a rectangular field of n × m cells. Each cell is either empty or impassable. Empty cells are marked with '.', impassable cells are marked w... | instruction | 0 | 48,351 | 15 | 96,702 |
Tags: dfs and similar, graphs, shortest paths
Correct Solution:
```
from collections import deque
from sys import stdin, stdout
def main():
n, m, k = map(int, stdin.readline().split())
mat = []
for i in range(n):
mat.append(stdin.readline())
check = [[False for _ in range(m)] for _ in range(n)... | output | 1 | 48,351 | 15 | 96,703 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Igor is in the museum and he wants to see as many pictures as possible.
Museum can be represented as a rectangular field of n × m cells. Each cell is either empty or impassable. Empty cells are marked with '.', impassable cells are marked w... | instruction | 0 | 48,352 | 15 | 96,704 |
Tags: dfs and similar, graphs, shortest paths
Correct Solution:
```
#Code by Sounak, IIESTS
#------------------------------warmup----------------------------
import os
import sys
import math
from io import BytesIO, IOBase
from fractions import Fraction
import collections
from itertools import permutations
from collect... | output | 1 | 48,352 | 15 | 96,705 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Igor is in the museum and he wants to see as many pictures as possible.
Museum can be represented as a rectangular field of n × m cells. Each cell is either empty or impassable. Empty cells are marked with '.', impassable cells are marked w... | instruction | 0 | 48,353 | 15 | 96,706 |
Tags: dfs and similar, graphs, shortest paths
Correct Solution:
```
#!/usr/bin/env pypy
import sys
n, m, k = map(int, input().split())
grid = []
for _ in range(n):
grid.append(list(next(sys.stdin)))
def dfs(grid, xs, ys, g):
stack = [(xs,ys)]
grid[xs][ys] = g
cnt = 0
while len(stack):
... | output | 1 | 48,353 | 15 | 96,707 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Igor is in the museum and he wants to see as many pictures as possible.
Museum can be represented as a rectangular field of n × m cells. Each cell is either empty or impassable. Empty cells are marked with '.', impassable cells are marked w... | instruction | 0 | 48,354 | 15 | 96,708 |
Tags: dfs and similar, graphs, shortest paths
Correct Solution:
```
import sys
def get_array(): return list(map(int, sys.stdin.readline().split()))
def get_ints(): return map(int, sys.stdin.readline().split())
def input(): return sys.stdin.readline().strip('\n')
n,m,k=get_ints()
visited=[]
for i in range(n):
... | output | 1 | 48,354 | 15 | 96,709 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Igor is in the museum and he wants to see as many pictures as possible.
Museum can be represented as a rectangular field of n × m cells. Each cell is either empty or impassable. Empty cells are marked with '.', impassable cells are marked w... | instruction | 0 | 48,355 | 15 | 96,710 |
Tags: dfs and similar, graphs, shortest paths
Correct Solution:
```
import sys,io,os
from atexit import register
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
sys.stdout = io.BytesIO()
register(lambda :os.write(1,sys.stdout.getvalue()))
def print(args=[], sep=' ', end='\n', file=sys.stdout):
first = T... | output | 1 | 48,355 | 15 | 96,711 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Igor is in the museum and he wants to see as many pictures as possible.
Museum can be represented as a rectangular field of n × m cells. Each cell is either empty or impassable. Empty cells are marked with '.', impassable cells are marked w... | instruction | 0 | 48,356 | 15 | 96,712 |
Tags: dfs and similar, graphs, shortest paths
Correct Solution:
```
import sys
input = sys.stdin.readline
H, W, N = map(int, input().split())
G = [input().rstrip() for _ in range(H)]
dx = [1, 0, -1, 0]
dy = [0, 1, 0, -1]
visited = [[0 for j in range(W)] for i in range(H)]
picture = [[0 for j in range(W)] for i in ra... | output | 1 | 48,356 | 15 | 96,713 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Igor is in the museum and he wants to see as many pictures as possible.
Museum can be represented as a rectangular field of n × m cells. Each cell is either empty or impassable. Empty cells are marked with '.', impassable cells are marked w... | instruction | 0 | 48,357 | 15 | 96,714 |
Tags: dfs and similar, graphs, shortest paths
Correct Solution:
```
import sys
input = lambda: sys.stdin.readline().rstrip()
from collections import deque
N, M, K = map(int, input().split())
room = [input() for i in range(N)]
memo = [[-1 for __ in range(M)] for _ in range(N)]
for i in range(K):
a, b = map(int, i... | output | 1 | 48,357 | 15 | 96,715 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Igor is in the museum and he wants to see as many pictures as possible.
Museum can be represented as a rectangular field of n × m cells. Each cell is either empty or impassable. Empty cells are... | instruction | 0 | 48,358 | 15 | 96,716 |
Yes | output | 1 | 48,358 | 15 | 96,717 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Igor is in the museum and he wants to see as many pictures as possible.
Museum can be represented as a rectangular field of n × m cells. Each cell is either empty or impassable. Empty cells are... | instruction | 0 | 48,359 | 15 | 96,718 |
Yes | output | 1 | 48,359 | 15 | 96,719 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Igor is in the museum and he wants to see as many pictures as possible.
Museum can be represented as a rectangular field of n × m cells. Each cell is either empty or impassable. Empty cells are... | instruction | 0 | 48,360 | 15 | 96,720 |
Yes | output | 1 | 48,360 | 15 | 96,721 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Igor is in the museum and he wants to see as many pictures as possible.
Museum can be represented as a rectangular field of n × m cells. Each cell is either empty or impassable. Empty cells are... | instruction | 0 | 48,361 | 15 | 96,722 |
Yes | output | 1 | 48,361 | 15 | 96,723 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Igor is in the museum and he wants to see as many pictures as possible.
Museum can be represented as a rectangular field of n × m cells. Each cell is either empty or impassable. Empty cells are... | instruction | 0 | 48,362 | 15 | 96,724 |
No | output | 1 | 48,362 | 15 | 96,725 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Igor is in the museum and he wants to see as many pictures as possible.
Museum can be represented as a rectangular field of n × m cells. Each cell is either empty or impassable. Empty cells are... | instruction | 0 | 48,363 | 15 | 96,726 |
No | output | 1 | 48,363 | 15 | 96,727 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Igor is in the museum and he wants to see as many pictures as possible.
Museum can be represented as a rectangular field of n × m cells. Each cell is either empty or impassable. Empty cells are... | instruction | 0 | 48,364 | 15 | 96,728 |
No | output | 1 | 48,364 | 15 | 96,729 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anton likes to play chess. Also, he likes to do programming. That is why he decided to write the program that plays chess. However, he finds the game on 8 to 8 board to too simple, he uses an infinite one instead.
The first task he faced is... | instruction | 0 | 48,434 | 15 | 96,868 |
Tags: implementation
Correct Solution:
```
def main():
n = int(input())
x, y = list(map(int, input().split()))
a = []
for i in range(n):
a.append(input().split())
for i in range(n):
a[i][1] = int(a[i][1]) - x
a[i][2] = int(a[i][2]) - y
typneedbql = []
typneedbqr = []
... | output | 1 | 48,434 | 15 | 96,869 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anton likes to play chess. Also, he likes to do programming. That is why he decided to write the program that plays chess. However, he finds the game on 8 to 8 board to too simple, he uses an infinite one instead.
The first task he faced is... | instruction | 0 | 48,435 | 15 | 96,870 |
Tags: implementation
Correct Solution:
```
MAX_NUM = 10**9
MIN_NUM = -10**9
from sys import stdin, stdout
n = int(stdin.readline().rstrip())
king_x, king_y = map(int,stdin.readline().rstrip().split())
nomakers = {'Rook': {'right-down':[], 'right-up':[], 'left-down':[], 'left-up':[]}, 'Bishop': {'left':[], 'right':[], '... | output | 1 | 48,435 | 15 | 96,871 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anton likes to play chess. Also, he likes to do programming. That is why he decided to write the program that plays chess. However, he finds the game on 8 to 8 board to too simple, he uses an infinite one instead.
The first task he faced is... | instruction | 0 | 48,436 | 15 | 96,872 |
Tags: implementation
Correct Solution:
```
n = int(input())
x,y = [int(i) for i in input().split()]
MIN_B = -10**9-1
MAX_B = 10**9+1
l_v = [MIN_B,0]
u_v = [MAX_B,0]
l_h = [MIN_B,0]
u_h = [MAX_B,0]
l_v1 = [MIN_B,MIN_B,0]
u_v1 = [MAX_B,MAX_B,0]
l_v2 = [MIN_B,MAX_B,0]
u_v2 = [MAX_B,MIN_B,0]
chess = []
def ok(type1,x1... | output | 1 | 48,436 | 15 | 96,873 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anton likes to play chess. Also, he likes to do programming. That is why he decided to write the program that plays chess. However, he finds the game on 8 to 8 board to too simple, he uses an infinite one instead.
The first task he faced is... | instruction | 0 | 48,437 | 15 | 96,874 |
Tags: implementation
Correct Solution:
```
#!/usr/bin/env python3
def ri():
return map(int, input().split())
"""
u ur r dr d dl l
"""
def direction(x, y):
if x == 0 and y > 0:
return 0
elif x > 0 and x == y:
return 1
elif y == 0 and x > 0:
return 2
elif x > 0 and x == -y... | output | 1 | 48,437 | 15 | 96,875 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anton likes to play chess. Also, he likes to do programming. That is why he decided to write the program that plays chess. However, he finds the game on 8 to 8 board to too simple, he uses an infinite one instead.
The first task he faced is... | instruction | 0 | 48,438 | 15 | 96,876 |
Tags: implementation
Correct Solution:
```
from sys import stdin
n = int(stdin.readline())
x, y = map(int, stdin.readline().split())
uld = 10 ** 10
ul = None
ud = 10 ** 10
u = None
urd = 10 ** 10
ur = None
rd = 10 ** 10
r = None
ld = 10 ** 10
l = None
dd = 10 ** 10
d = None
drd = 10 ** 10
dr = None
dld = 10 ** 10
dl =... | output | 1 | 48,438 | 15 | 96,877 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anton likes to play chess. Also, he likes to do programming. That is why he decided to write the program that plays chess. However, he finds the game on 8 to 8 board to too simple, he uses an infinite one instead.
The first task he faced is... | instruction | 0 | 48,439 | 15 | 96,878 |
Tags: implementation
Correct Solution:
```
from sys import stdin, stdout
n = int(input())
king_x, king_y = map(int,stdin.readline().rstrip().split())
nomakers = {'Rook': {'right-down':[], 'right-up':[], 'left-down':[], 'left-up':[]}, 'Bishop': {'left':[], 'right':[], 'up':[], 'down':[]}}
yes = {'Queen':{'right-down':[]... | output | 1 | 48,439 | 15 | 96,879 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anton likes to play chess. Also, he likes to do programming. That is why he decided to write the program that plays chess. However, he finds the game on 8 to 8 board to too simple, he uses an infinite one instead.
The first task he faced is... | instruction | 0 | 48,440 | 15 | 96,880 |
Tags: implementation
Correct Solution:
```
n = int(input())
x0, y0 = [int(i) for i in input().split()]
max_num = 2*10**9 + 5
N = ["A", max_num]
S = ["A", max_num]
W = ["A", max_num]
E = ["A", max_num]
NE = ["A", max_num]
NW = ["A", max_num]
SW = ["A", max_num]
SE = ["A", max_num]
for i in range(n):
symbol, x, y =... | output | 1 | 48,440 | 15 | 96,881 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Anton likes to play chess. Also, he likes to do programming. That is why he decided to write the program that plays chess. However, he finds the game on 8 to 8 board to too simple, he uses an infinite one instead.
The first task he faced is... | instruction | 0 | 48,441 | 15 | 96,882 |
Tags: implementation
Correct Solution:
```
MAX_NUM = 10**9
n = int(input())
king_x, king_y = [int(x) for x in input().split()]
nomakers = {'Rook': {'right-down':[], 'right-up':[], 'left-down':[], 'left-up':[]}, 'Bishop': {'left':[], 'right':[], 'up':[], 'down':[]}}
yes = {'Queen':{'right-down':[], 'right-up':[], 'left-... | output | 1 | 48,441 | 15 | 96,883 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Anton likes to play chess. Also, he likes to do programming. That is why he decided to write the program that plays chess. However, he finds the game on 8 to 8 board to too simple, he uses an in... | instruction | 0 | 48,442 | 15 | 96,884 |
Yes | output | 1 | 48,442 | 15 | 96,885 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Anton likes to play chess. Also, he likes to do programming. That is why he decided to write the program that plays chess. However, he finds the game on 8 to 8 board to too simple, he uses an in... | instruction | 0 | 48,443 | 15 | 96,886 |
Yes | output | 1 | 48,443 | 15 | 96,887 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Anton likes to play chess. Also, he likes to do programming. That is why he decided to write the program that plays chess. However, he finds the game on 8 to 8 board to too simple, he uses an in... | instruction | 0 | 48,444 | 15 | 96,888 |
Yes | output | 1 | 48,444 | 15 | 96,889 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Anton likes to play chess. Also, he likes to do programming. That is why he decided to write the program that plays chess. However, he finds the game on 8 to 8 board to too simple, he uses an in... | instruction | 0 | 48,445 | 15 | 96,890 |
Yes | output | 1 | 48,445 | 15 | 96,891 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Anton likes to play chess. Also, he likes to do programming. That is why he decided to write the program that plays chess. However, he finds the game on 8 to 8 board to too simple, he uses an in... | instruction | 0 | 48,446 | 15 | 96,892 |
No | output | 1 | 48,446 | 15 | 96,893 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Anton likes to play chess. Also, he likes to do programming. That is why he decided to write the program that plays chess. However, he finds the game on 8 to 8 board to too simple, he uses an in... | instruction | 0 | 48,447 | 15 | 96,894 |
No | output | 1 | 48,447 | 15 | 96,895 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Anton likes to play chess. Also, he likes to do programming. That is why he decided to write the program that plays chess. However, he finds the game on 8 to 8 board to too simple, he uses an in... | instruction | 0 | 48,448 | 15 | 96,896 |
No | output | 1 | 48,448 | 15 | 96,897 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Anton likes to play chess. Also, he likes to do programming. That is why he decided to write the program that plays chess. However, he finds the game on 8 to 8 board to too simple, he uses an in... | instruction | 0 | 48,449 | 15 | 96,898 |
No | output | 1 | 48,449 | 15 | 96,899 |
Provide a correct Python 3 solution for this coding contest problem.
Nobuo-kun and Shizuo-kun are playing a game of competing for territories on a rectangular island. As shown in Fig. 1 below, the entire island is made up of square compartments divided in a grid pattern, and the profits and losses resulting from these... | instruction | 0 | 48,724 | 15 | 97,448 |
"Correct Solution:
```
import sys
sys.setrecursionlimit(10**7)
w, h = map(int, input().split())
S = [list(map(int, input().split())) for i in range(h)]
SW = [[0]*w for i in range(h)]
SH = [[0]*w for i in range(h)]
for i in range(h):
cnt = 0
for j in range(w-1, -1, -1):
cnt += S[i][j]
SW[i][j] = ... | output | 1 | 48,724 | 15 | 97,449 |
Provide a correct Python 3 solution for this coding contest problem.
Nobuo-kun and Shizuo-kun are playing a game of competing for territories on a rectangular island. As shown in Fig. 1 below, the entire island is made up of square compartments divided in a grid pattern, and the profits and losses resulting from these... | instruction | 0 | 48,725 | 15 | 97,450 |
"Correct Solution:
```
from itertools import accumulate
import sys
sys.setrecursionlimit(1000000)
def main():
w, h = map(int, input().split())
mp = [list(map(int, input().split())) for _ in range(h)]
acc_mp = list(map(lambda line:[0] + list(accumulate(line)), mp))
mem = {}
def score(x, y, turn):... | output | 1 | 48,725 | 15 | 97,451 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.