message stringlengths 2 16.2k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 575 109k | cluster float64 16 16 | __index_level_0__ int64 1.15k 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke stands on a number line. He has L ears, and he will walk along the line continuously under the following conditions:
* He never visits a point with coordinate less than 0, or a point with... | instruction | 0 | 80,669 | 16 | 161,338 |
No | output | 1 | 80,669 | 16 | 161,339 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke's mother gave Snuke an undirected graph consisting of N vertices numbered 0 to N-1 and M edges. This graph was connected and contained no parallel edges or self-loops.
One day, Snuke broke this graph. Fortunately, he remembered Q clues about t... | instruction | 0 | 81,474 | 16 | 162,948 |
"Correct Solution:
```
import sys
class UnionFind:
def __init__(self, n):
self.table = [-1] * n
def _root(self, x):
if self.table[x] < 0:
return x
else:
self.table[x] = self._root(self.table[x])
return self.table[x]
def find(self, x, y):
... | output | 1 | 81,474 | 16 | 162,949 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke's mother gave Snuke an undirected graph consisting of N vertices numbered 0 to N-1 and M edges. This graph was connected and contained no parallel edges or self-loops.
One day, Snuke broke this graph. Fortunately, he remembered Q clues about t... | instruction | 0 | 81,475 | 16 | 162,950 |
"Correct Solution:
```
class UnionFind:
def __init__(self, n):
self.par = [-1 for i in range(n+1)]
self.rank = [0] * (n+1)
# 検索
def find(self, x):
if self.par[x] < 0:
return x
else:
self.par[x] = self.find(self.par[x])
return self.par[x]
... | output | 1 | 81,475 | 16 | 162,951 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke's mother gave Snuke an undirected graph consisting of N vertices numbered 0 to N-1 and M edges. This graph was connected and contained no parallel edges or self-loops.
One day, Snuke broke this graph. Fortunately, he remembered Q clues about t... | instruction | 0 | 81,476 | 16 | 162,952 |
"Correct Solution:
```
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): retu... | output | 1 | 81,476 | 16 | 162,953 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke's mother gave Snuke an undirected graph consisting of N vertices numbered 0 to N-1 and M edges. This graph was connected and contained no parallel edges or self-loops.
One day, Snuke broke this graph. Fortunately, he remembered Q clues about t... | instruction | 0 | 81,477 | 16 | 162,954 |
"Correct Solution:
```
import sys
input=sys.stdin.readline
class UnionFind:
def __init__(self,n):
self.par=[i for i in range(n)]
self.rank=[0]*n
def find(self,x):
if self.par[x]==x:
return x
else:
self.par[x]=self.find(self.par[x])
return self... | output | 1 | 81,477 | 16 | 162,955 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke's mother gave Snuke an undirected graph consisting of N vertices numbered 0 to N-1 and M edges. This graph was connected and contained no parallel edges or self-loops.
One day, Snuke broke this graph. Fortunately, he remembered Q clues about t... | instruction | 0 | 81,478 | 16 | 162,956 |
"Correct Solution:
```
class UnionFindNode:
def __init__(self, group_id, parent=None, value=None):
self.group_id_ = group_id
self.parent_ = parent
self.value = value
self.rank_ = 1
self.member_num_ = 1
def is_root(self):
return not self.parent_
def root(self... | output | 1 | 81,478 | 16 | 162,957 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke's mother gave Snuke an undirected graph consisting of N vertices numbered 0 to N-1 and M edges. This graph was connected and contained no parallel edges or self-loops.
One day, Snuke broke this graph. Fortunately, he remembered Q clues about t... | instruction | 0 | 81,479 | 16 | 162,958 |
"Correct Solution:
```
import sys
input = sys.stdin.readline
N, M, Q = map(int, input().split())
E = [list(map(int, input().split())) for i in range(Q)]
f = [i for i in range(N)]
def find(x):
if x != f[x]:
f[x] = find(f[x])
return f[x]
def union(x, y):
fx, fy = find(x), find(y)
if fx == fy: ... | output | 1 | 81,479 | 16 | 162,959 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke's mother gave Snuke an undirected graph consisting of N vertices numbered 0 to N-1 and M edges. This graph was connected and contained no parallel edges or self-loops.
One day, Snuke broke this graph. Fortunately, he remembered Q clues about t... | instruction | 0 | 81,480 | 16 | 162,960 |
"Correct Solution:
```
import sys
input = sys.stdin.readline
N,M,Q=map(int,input().split())
E=[list(map(int,input().split())) for i in range(Q)]
# UnionFind
Group=[i for i in range(N)]# グループ分け.Group[i]=jのときiとjは同じグループ
def find(x):# find(a)=find(b)のとき同じグループ
while Group[x] != x:
x=Group[x]
return x
de... | output | 1 | 81,480 | 16 | 162,961 |
Provide a correct Python 3 solution for this coding contest problem.
Snuke's mother gave Snuke an undirected graph consisting of N vertices numbered 0 to N-1 and M edges. This graph was connected and contained no parallel edges or self-loops.
One day, Snuke broke this graph. Fortunately, he remembered Q clues about t... | instruction | 0 | 81,481 | 16 | 162,962 |
"Correct Solution:
```
class UnionFind:
def __init__(self, n):
self.par = [i for i in range(n+1)]
self.rank = [0] * (n+1)
# search
def find(self, x):
if self.par[x] == x:
return x
else:
self.par[x] = self.find(self.par[x])
return self.par[... | output | 1 | 81,481 | 16 | 162,963 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke's mother gave Snuke an undirected graph consisting of N vertices numbered 0 to N-1 and M edges. This graph was connected and contained no parallel edges or self-loops.
One day, Snuke brok... | instruction | 0 | 81,482 | 16 | 162,964 |
Yes | output | 1 | 81,482 | 16 | 162,965 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke's mother gave Snuke an undirected graph consisting of N vertices numbered 0 to N-1 and M edges. This graph was connected and contained no parallel edges or self-loops.
One day, Snuke brok... | instruction | 0 | 81,483 | 16 | 162,966 |
Yes | output | 1 | 81,483 | 16 | 162,967 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke's mother gave Snuke an undirected graph consisting of N vertices numbered 0 to N-1 and M edges. This graph was connected and contained no parallel edges or self-loops.
One day, Snuke brok... | instruction | 0 | 81,484 | 16 | 162,968 |
Yes | output | 1 | 81,484 | 16 | 162,969 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke's mother gave Snuke an undirected graph consisting of N vertices numbered 0 to N-1 and M edges. This graph was connected and contained no parallel edges or self-loops.
One day, Snuke brok... | instruction | 0 | 81,485 | 16 | 162,970 |
Yes | output | 1 | 81,485 | 16 | 162,971 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke's mother gave Snuke an undirected graph consisting of N vertices numbered 0 to N-1 and M edges. This graph was connected and contained no parallel edges or self-loops.
One day, Snuke brok... | instruction | 0 | 81,486 | 16 | 162,972 |
No | output | 1 | 81,486 | 16 | 162,973 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke's mother gave Snuke an undirected graph consisting of N vertices numbered 0 to N-1 and M edges. This graph was connected and contained no parallel edges or self-loops.
One day, Snuke brok... | instruction | 0 | 81,487 | 16 | 162,974 |
No | output | 1 | 81,487 | 16 | 162,975 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke's mother gave Snuke an undirected graph consisting of N vertices numbered 0 to N-1 and M edges. This graph was connected and contained no parallel edges or self-loops.
One day, Snuke brok... | instruction | 0 | 81,488 | 16 | 162,976 |
No | output | 1 | 81,488 | 16 | 162,977 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Snuke's mother gave Snuke an undirected graph consisting of N vertices numbered 0 to N-1 and M edges. This graph was connected and contained no parallel edges or self-loops.
One day, Snuke brok... | instruction | 0 | 81,489 | 16 | 162,978 |
No | output | 1 | 81,489 | 16 | 162,979 |
Provide a correct Python 3 solution for this coding contest problem.
There is a box containing N balls. The i-th ball has the integer A_i written on it. Snuke can perform the following operation any number of times:
* Take out two balls from the box. Then, return them to the box along with a new ball, on which the ab... | instruction | 0 | 81,554 | 16 | 163,108 |
"Correct Solution:
```
from fractions import gcd
n, k = map(int, input().split())
a = list(map(int, input().split()))
n = a[0]
max_num = max(a)
for num in a[1:]:
n = gcd(n, num)
if k % n == 0 and k <= max_num:
print("POSSIBLE")
else:
print("IMPOSSIBLE")
``` | output | 1 | 81,554 | 16 | 163,109 |
Provide a correct Python 3 solution for this coding contest problem.
There is a box containing N balls. The i-th ball has the integer A_i written on it. Snuke can perform the following operation any number of times:
* Take out two balls from the box. Then, return them to the box along with a new ball, on which the ab... | instruction | 0 | 81,555 | 16 | 163,110 |
"Correct Solution:
```
from fractions import gcd
N,K=map(int,input().split())
A=list(map(int,input().split()))
maxi=max(A)
if K>maxi:
ans="IMPOSSIBLE"
else:
t=A[0]
for i in range(1,N):
t = gcd(t,A[i])
if K%t==0:
ans="POSSIBLE"
else:
ans="IMPOSSIBLE"
print(ans)
``` | output | 1 | 81,555 | 16 | 163,111 |
Provide a correct Python 3 solution for this coding contest problem.
There is a box containing N balls. The i-th ball has the integer A_i written on it. Snuke can perform the following operation any number of times:
* Take out two balls from the box. Then, return them to the box along with a new ball, on which the ab... | instruction | 0 | 81,556 | 16 | 163,112 |
"Correct Solution:
```
from fractions import gcd
n, k = map(int, input().split())
a = sorted(list(map(int, input().split())))
if max(a) < k:
print("IMPOSSIBLE")
exit()
x = a[0]
for i in range(1,n):
x = gcd(x, a[i])
print("IMPOSSIBLE" if k % x else "POSSIBLE")
``` | output | 1 | 81,556 | 16 | 163,113 |
Provide a correct Python 3 solution for this coding contest problem.
There is a box containing N balls. The i-th ball has the integer A_i written on it. Snuke can perform the following operation any number of times:
* Take out two balls from the box. Then, return them to the box along with a new ball, on which the ab... | instruction | 0 | 81,557 | 16 | 163,114 |
"Correct Solution:
```
import fractions
n,k = map(int,input().split())
a = sorted(list(map(int,input().split())))
a_max = max(a)
a_gcd = a[0]
for i in range(n):
a_gcd = fractions.gcd(a_gcd,a[i])
if k <= a_max and k % a_gcd == 0:
print("POSSIBLE")
else:
print("IMPOSSIBLE")
``` | output | 1 | 81,557 | 16 | 163,115 |
Provide a correct Python 3 solution for this coding contest problem.
There is a box containing N balls. The i-th ball has the integer A_i written on it. Snuke can perform the following operation any number of times:
* Take out two balls from the box. Then, return them to the box along with a new ball, on which the ab... | instruction | 0 | 81,558 | 16 | 163,116 |
"Correct Solution:
```
from math import gcd
n,k = map(int,input().split())
A = list(map(int,input().split()))
g = A[0]
m = max(A)
for x in A:
g = gcd(g,x)
print("POSSIBLE" if k%g == 0 and m >= k else "IMPOSSIBLE")
``` | output | 1 | 81,558 | 16 | 163,117 |
Provide a correct Python 3 solution for this coding contest problem.
There is a box containing N balls. The i-th ball has the integer A_i written on it. Snuke can perform the following operation any number of times:
* Take out two balls from the box. Then, return them to the box along with a new ball, on which the ab... | instruction | 0 | 81,559 | 16 | 163,118 |
"Correct Solution:
```
from fractions import gcd
N, K = map(int, input().split())
A = list(map(int,input().split()))
g = A[0]
for i in range(1, N):
g = gcd(g, A[i])
if K > max(A):
print("IMPOSSIBLE")
elif K % g != 0:
print("IMPOSSIBLE")
else:
print("POSSIBLE")
``` | output | 1 | 81,559 | 16 | 163,119 |
Provide a correct Python 3 solution for this coding contest problem.
There is a box containing N balls. The i-th ball has the integer A_i written on it. Snuke can perform the following operation any number of times:
* Take out two balls from the box. Then, return them to the box along with a new ball, on which the ab... | instruction | 0 | 81,560 | 16 | 163,120 |
"Correct Solution:
```
import fractions
n, k = map(int, input().split())
a = list(map(int, input().split()))
if max(a)<k:
print("IMPOSSIBLE")
exit()
g = a[0]
for i in range(1, n):
g = fractions.gcd(g, a[i])
if k % g == 0:
print("POSSIBLE")
else:
print("IMPOSSIBLE")
``` | output | 1 | 81,560 | 16 | 163,121 |
Provide a correct Python 3 solution for this coding contest problem.
There is a box containing N balls. The i-th ball has the integer A_i written on it. Snuke can perform the following operation any number of times:
* Take out two balls from the box. Then, return them to the box along with a new ball, on which the ab... | instruction | 0 | 81,561 | 16 | 163,122 |
"Correct Solution:
```
import fractions as fr
from functools import reduce
def gcd(a):
return reduce(fr.gcd, a)
n, k = map(int, input().split())
a = list(map(int, input().split()))
g = gcd(a)
print("POSSIBLE" if (k in a) or (max(a) >= k and (g == 1 or k%g == 0)) else "IMPOSSIBLE")
``` | output | 1 | 81,561 | 16 | 163,123 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a box containing N balls. The i-th ball has the integer A_i written on it. Snuke can perform the following operation any number of times:
* Take out two balls from the box. Then, retur... | instruction | 0 | 81,562 | 16 | 163,124 |
Yes | output | 1 | 81,562 | 16 | 163,125 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a box containing N balls. The i-th ball has the integer A_i written on it. Snuke can perform the following operation any number of times:
* Take out two balls from the box. Then, retur... | instruction | 0 | 81,563 | 16 | 163,126 |
Yes | output | 1 | 81,563 | 16 | 163,127 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a box containing N balls. The i-th ball has the integer A_i written on it. Snuke can perform the following operation any number of times:
* Take out two balls from the box. Then, retur... | instruction | 0 | 81,564 | 16 | 163,128 |
Yes | output | 1 | 81,564 | 16 | 163,129 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a box containing N balls. The i-th ball has the integer A_i written on it. Snuke can perform the following operation any number of times:
* Take out two balls from the box. Then, retur... | instruction | 0 | 81,565 | 16 | 163,130 |
Yes | output | 1 | 81,565 | 16 | 163,131 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a box containing N balls. The i-th ball has the integer A_i written on it. Snuke can perform the following operation any number of times:
* Take out two balls from the box. Then, retur... | instruction | 0 | 81,566 | 16 | 163,132 |
No | output | 1 | 81,566 | 16 | 163,133 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a box containing N balls. The i-th ball has the integer A_i written on it. Snuke can perform the following operation any number of times:
* Take out two balls from the box. Then, retur... | instruction | 0 | 81,567 | 16 | 163,134 |
No | output | 1 | 81,567 | 16 | 163,135 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a box containing N balls. The i-th ball has the integer A_i written on it. Snuke can perform the following operation any number of times:
* Take out two balls from the box. Then, retur... | instruction | 0 | 81,568 | 16 | 163,136 |
No | output | 1 | 81,568 | 16 | 163,137 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a box containing N balls. The i-th ball has the integer A_i written on it. Snuke can perform the following operation any number of times:
* Take out two balls from the box. Then, retur... | instruction | 0 | 81,569 | 16 | 163,138 |
No | output | 1 | 81,569 | 16 | 163,139 |
Provide a correct Python 3 solution for this coding contest problem.
Constraints
* H is an integer between 2 and 50 (inclusive).
* W is an integer between 2 and 50 (inclusive).
* s_{i, j} is `.` or `#` (1 \leq i \leq H, 1 \leq j \leq W).
* s_{1, 1} and s_{H, W} are `.`.
Input
Input is given from Standard Input in t... | instruction | 0 | 82,443 | 16 | 164,886 |
"Correct Solution:
```
from collections import deque;h,w=map(int,input().split());m=[input()for _ in[0]*h];v=[[-1]*w for _ in[0]*h];q=deque([[0,0]]);v[0][0]=0;c=sum(t.count('#')for t in m)
while q:
y,x=q.popleft()
for i,j in([1,0],[-1,0],[0,1],[0,-1]):
t,u=y+i,x+j
if t+1and t<h and u+1and u<w and m[t][u]=='.'and ... | output | 1 | 82,443 | 16 | 164,887 |
Provide a correct Python 3 solution for this coding contest problem.
Constraints
* H is an integer between 2 and 50 (inclusive).
* W is an integer between 2 and 50 (inclusive).
* s_{i, j} is `.` or `#` (1 \leq i \leq H, 1 \leq j \leq W).
* s_{1, 1} and s_{H, W} are `.`.
Input
Input is given from Standard Input in t... | instruction | 0 | 82,444 | 16 | 164,888 |
"Correct Solution:
```
h, w = map(int, input().split())
s = [[0 if c == '#' else 1 for c in input()] for _ in range(h)]
directions = [(0, -1), (-1, 0), (0, 1), (1, 0)]
dist = [[-1 for _ in range(w)] for _ in range(h)]
dist[0][0] = 0
q = [(0, 0)]
for y, x in q:
for dy, dx in directions:
ny, nx = y + dy, x +... | output | 1 | 82,444 | 16 | 164,889 |
Provide a correct Python 3 solution for this coding contest problem.
Constraints
* H is an integer between 2 and 50 (inclusive).
* W is an integer between 2 and 50 (inclusive).
* s_{i, j} is `.` or `#` (1 \leq i \leq H, 1 \leq j \leq W).
* s_{1, 1} and s_{H, W} are `.`.
Input
Input is given from Standard Input in t... | instruction | 0 | 82,445 | 16 | 164,890 |
"Correct Solution:
```
from collections import deque
H,W = map(int,input().split())
s = list(input() for i in range(H))
board = [[1]*(W+2) for i in range(H+2)]
white = 0
for i in range(H):
for j in range(W):
if s[i][j] == '.':
white += 1
board[i+1][j+1] = 0
queue = deque([[1,1]])
v =... | output | 1 | 82,445 | 16 | 164,891 |
Provide a correct Python 3 solution for this coding contest problem.
Constraints
* H is an integer between 2 and 50 (inclusive).
* W is an integer between 2 and 50 (inclusive).
* s_{i, j} is `.` or `#` (1 \leq i \leq H, 1 \leq j \leq W).
* s_{1, 1} and s_{H, W} are `.`.
Input
Input is given from Standard Input in t... | instruction | 0 | 82,446 | 16 | 164,892 |
"Correct Solution:
```
H, W = map(int, input().split())
l = [list(input()) for _ in range(H)]
from collections import deque
q = deque([(0, 0)])
d = [(1, 0), (-1, 0), (0, 1), (0, -1)]
l[0][0] = 0
while q:
y, x = q.popleft()
for dy, dx in d:
if 0 <= y+dy < H and 0 <= x+dx < W and l[y+dy][x+dx] == '.':
... | output | 1 | 82,446 | 16 | 164,893 |
Provide a correct Python 3 solution for this coding contest problem.
Constraints
* H is an integer between 2 and 50 (inclusive).
* W is an integer between 2 and 50 (inclusive).
* s_{i, j} is `.` or `#` (1 \leq i \leq H, 1 \leq j \leq W).
* s_{1, 1} and s_{H, W} are `.`.
Input
Input is given from Standard Input in t... | instruction | 0 | 82,447 | 16 | 164,894 |
"Correct Solution:
```
from collections import deque
h, w = map(int, input().split())
maze = {(i,j):c for i in range(h) for j, c in enumerate(input())}
blacks = sum(c == '#' for c in maze.values())
def bfs(i, j):
dq = deque()
dq.appendleft((1, (i, j)))
while dq:
steps, (i, j) = dq.pop()
i... | output | 1 | 82,447 | 16 | 164,895 |
Provide a correct Python 3 solution for this coding contest problem.
Constraints
* H is an integer between 2 and 50 (inclusive).
* W is an integer between 2 and 50 (inclusive).
* s_{i, j} is `.` or `#` (1 \leq i \leq H, 1 \leq j \leq W).
* s_{1, 1} and s_{H, W} are `.`.
Input
Input is given from Standard Input in t... | instruction | 0 | 82,448 | 16 | 164,896 |
"Correct Solution:
```
h,w=map(int,input().split())
l=[[1]*(w+2)]+[[1]+[1 if i=="#" else 0 for i in input()]+[1] for i in range(h)]+[[1]*(w+2)]
c=[[0]*(w+2) for i in range(h+2)]
q=[(1,1)]
e=[(0,1),(0,-1),(1,0),(-1,0)]
kyori=1
while len(q)>0 and c[h][w]==0:
tl=q
q=[]
for x,y in tl:
for X,Y in e:
... | output | 1 | 82,448 | 16 | 164,897 |
Provide a correct Python 3 solution for this coding contest problem.
Constraints
* H is an integer between 2 and 50 (inclusive).
* W is an integer between 2 and 50 (inclusive).
* s_{i, j} is `.` or `#` (1 \leq i \leq H, 1 \leq j \leq W).
* s_{1, 1} and s_{H, W} are `.`.
Input
Input is given from Standard Input in t... | instruction | 0 | 82,449 | 16 | 164,898 |
"Correct Solution:
```
H, W = map(int, input().split())
G = [list(input()) for _ in range(H)]
que = [[0,0]]
dist = [[-1]*W for _ in range(H)]
direction = [[0,1], [0,-1], [1,0], [-1,0]]
dist[0][0] = 0
while que:
h, w = que.pop(0)
for dh, dw in direction:
if h+dh <0 or h+dh >= H or w+dw <0 or w+dw >= W:
c... | output | 1 | 82,449 | 16 | 164,899 |
Provide a correct Python 3 solution for this coding contest problem.
Constraints
* H is an integer between 2 and 50 (inclusive).
* W is an integer between 2 and 50 (inclusive).
* s_{i, j} is `.` or `#` (1 \leq i \leq H, 1 \leq j \leq W).
* s_{1, 1} and s_{H, W} are `.`.
Input
Input is given from Standard Input in t... | instruction | 0 | 82,450 | 16 | 164,900 |
"Correct Solution:
```
# /usr/bin/python
# -*- coding: utf-8 -*-
#
import sys
H,W = map(int, input().split())
num_w = -1
srch = []
for i in range(H):
h = list(str(sys.stdin.readline().rstrip()))
for j in range(W):
if h[j] == ".":
srch.append([i+1,j+1])
num_w += 1
Cn = [[sys.maxsize for j in range... | output | 1 | 82,450 | 16 | 164,901 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Constraints
* H is an integer between 2 and 50 (inclusive).
* W is an integer between 2 and 50 (inclusive).
* s_{i, j} is `.` or `#` (1 \leq i \leq H, 1 \leq j \leq W).
* s_{1, 1} and s_{H, W} ... | instruction | 0 | 82,451 | 16 | 164,902 |
Yes | output | 1 | 82,451 | 16 | 164,903 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Constraints
* H is an integer between 2 and 50 (inclusive).
* W is an integer between 2 and 50 (inclusive).
* s_{i, j} is `.` or `#` (1 \leq i \leq H, 1 \leq j \leq W).
* s_{1, 1} and s_{H, W} ... | instruction | 0 | 82,452 | 16 | 164,904 |
Yes | output | 1 | 82,452 | 16 | 164,905 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Constraints
* H is an integer between 2 and 50 (inclusive).
* W is an integer between 2 and 50 (inclusive).
* s_{i, j} is `.` or `#` (1 \leq i \leq H, 1 \leq j \leq W).
* s_{1, 1} and s_{H, W} ... | instruction | 0 | 82,453 | 16 | 164,906 |
Yes | output | 1 | 82,453 | 16 | 164,907 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Constraints
* H is an integer between 2 and 50 (inclusive).
* W is an integer between 2 and 50 (inclusive).
* s_{i, j} is `.` or `#` (1 \leq i \leq H, 1 \leq j \leq W).
* s_{1, 1} and s_{H, W} ... | instruction | 0 | 82,454 | 16 | 164,908 |
Yes | output | 1 | 82,454 | 16 | 164,909 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Constraints
* H is an integer between 2 and 50 (inclusive).
* W is an integer between 2 and 50 (inclusive).
* s_{i, j} is `.` or `#` (1 \leq i \leq H, 1 \leq j \leq W).
* s_{1, 1} and s_{H, W} ... | instruction | 0 | 82,455 | 16 | 164,910 |
No | output | 1 | 82,455 | 16 | 164,911 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Constraints
* H is an integer between 2 and 50 (inclusive).
* W is an integer between 2 and 50 (inclusive).
* s_{i, j} is `.` or `#` (1 \leq i \leq H, 1 \leq j \leq W).
* s_{1, 1} and s_{H, W} ... | instruction | 0 | 82,456 | 16 | 164,912 |
No | output | 1 | 82,456 | 16 | 164,913 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Constraints
* H is an integer between 2 and 50 (inclusive).
* W is an integer between 2 and 50 (inclusive).
* s_{i, j} is `.` or `#` (1 \leq i \leq H, 1 \leq j \leq W).
* s_{1, 1} and s_{H, W} ... | instruction | 0 | 82,457 | 16 | 164,914 |
No | output | 1 | 82,457 | 16 | 164,915 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Constraints
* H is an integer between 2 and 50 (inclusive).
* W is an integer between 2 and 50 (inclusive).
* s_{i, j} is `.` or `#` (1 \leq i \leq H, 1 \leq j \leq W).
* s_{1, 1} and s_{H, W} ... | instruction | 0 | 82,458 | 16 | 164,916 |
No | output | 1 | 82,458 | 16 | 164,917 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N squares in a row, numbered 1 through N from left to right. Snuke and Rng are playing a board game using these squares, described below:
1. First, Snuke writes an integer into each s... | instruction | 0 | 82,479 | 16 | 164,958 |
No | output | 1 | 82,479 | 16 | 164,959 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.