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.
Cirno gave AquaMoon a chessboard of size 1 × n. Its cells are numbered with integers from 1 to n from left to right. In the beginning, some of the cells are occupied with at most one pawn, and o... | instruction | 0 | 17,930 | 15 | 35,860 |
No | output | 1 | 17,930 | 15 | 35,861 |
Provide a correct Python 3 solution for this coding contest problem.
The full exploration sister is a very talented woman. Your sister can easily count the number of routes in a grid pattern if it is in the thousands. You and your exploration sister are now in a room lined with hexagonal tiles. The older sister seems ... | instruction | 0 | 19,362 | 15 | 38,724 |
"Correct Solution:
```
from heapq import heappush, heappop
sx, sy, gx, gy = map(int, input().split())
n = int(input())
outs = {tuple(map(int, input().split())) for _ in range(n)}
lx, ly = map(int, input().split())
for x in range(-lx - 1, lx + 2):
outs.add((x, -ly - 1))
outs.add((x, ly + 1))
for y in range(-ly - 1,... | output | 1 | 19,362 | 15 | 38,725 |
Provide a correct Python 3 solution for this coding contest problem.
The full exploration sister is a very talented woman. Your sister can easily count the number of routes in a grid pattern if it is in the thousands. You and your exploration sister are now in a room lined with hexagonal tiles. The older sister seems ... | instruction | 0 | 19,363 | 15 | 38,726 |
"Correct Solution:
```
from collections import deque
import sys
sys.setrecursionlimit(10000000)
input=lambda : sys.stdin.readline().rstrip()
sx,sy,gx,gy=map(int,input().split())
n=int(input())
que=deque()
field=[[[0 for k in range(6)] for j in range(201)]for i in range(201)]
for i in range(n):
x,y=map(int,input()... | output | 1 | 19,363 | 15 | 38,727 |
Provide a correct Python 3 solution for this coding contest problem.
The full exploration sister is a very talented woman. Your sister can easily count the number of routes in a grid pattern if it is in the thousands. You and your exploration sister are now in a room lined with hexagonal tiles. The older sister seems ... | instruction | 0 | 19,364 | 15 | 38,728 |
"Correct Solution:
```
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**13
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(): return [int... | output | 1 | 19,364 | 15 | 38,729 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an interactive problem.
Now Serval is a senior high school student in Japari Middle School. However, on the way to the school, he must go across a pond, in which there is a dangerous snake. The pond can be represented as a n × n gri... | instruction | 0 | 19,501 | 15 | 39,002 |
Tags: binary search, brute force, interactive
Correct Solution:
```
# AC
import sys
class Main:
def __init__(self):
self.buff = None
self.index = 0
def next(self):
if self.buff is None or self.index == len(self.buff):
self.buff = sys.stdin.readline().split()
se... | output | 1 | 19,501 | 15 | 39,003 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an interactive problem.
Now Serval is a senior high school student in Japari Middle School. However, on the way to the school, he must go across a pond, in which there is a dangerous sn... | instruction | 0 | 19,502 | 15 | 39,004 |
No | output | 1 | 19,502 | 15 | 39,005 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an interactive problem.
Now Serval is a senior high school student in Japari Middle School. However, on the way to the school, he must go across a pond, in which there is a dangerous sn... | instruction | 0 | 19,503 | 15 | 39,006 |
No | output | 1 | 19,503 | 15 | 39,007 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an interactive problem.
Now Serval is a senior high school student in Japari Middle School. However, on the way to the school, he must go across a pond, in which there is a dangerous sn... | instruction | 0 | 19,504 | 15 | 39,008 |
No | output | 1 | 19,504 | 15 | 39,009 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is an interactive problem.
Now Serval is a senior high school student in Japari Middle School. However, on the way to the school, he must go across a pond, in which there is a dangerous sn... | instruction | 0 | 19,505 | 15 | 39,010 |
No | output | 1 | 19,505 | 15 | 39,011 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are many sunflowers in the Garden of the Sun.
Garden of the Sun is a rectangular table with n rows and m columns, where the cells of the table are farmlands. All of the cells grow a sunflower on it. Unfortunately, one night, the light... | instruction | 0 | 19,673 | 15 | 39,346 |
Tags: constructive algorithms, graphs
Correct Solution:
```
# Problem 1495C - Garden of the Sun
def main():
T = int(input())
for c in range(T):
inp = input().rstrip().split(" ")
n, m = int(inp[0]), int(inp[1])
mat = []
for _ in range(n):
mat.append(list(input().rstri... | output | 1 | 19,673 | 15 | 39,347 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are many sunflowers in the Garden of the Sun.
Garden of the Sun is a rectangular table with n rows and m columns, where the cells of the table are farmlands. All of the cells grow a sunflower on it. Unfortunately, one night, the light... | instruction | 0 | 19,674 | 15 | 39,348 |
Tags: constructive algorithms, graphs
Correct Solution:
```
#!/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase
def main():
for _ in range(int(input())):
n,m = map(int,input().split())
board = []
newBoard = []
for _ in range(n):
board.append(input(... | output | 1 | 19,674 | 15 | 39,349 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are many sunflowers in the Garden of the Sun.
Garden of the Sun is a rectangular table with n rows and m columns, where the cells of the table are farmlands. All of the cells grow a sunflower on it. Unfortunately, one night, the light... | instruction | 0 | 19,675 | 15 | 39,350 |
Tags: constructive algorithms, graphs
Correct Solution:
```
mod = 1000000007
eps = 10**-9
def main():
import sys
input = sys.stdin.readline
def print_(grid):
for line in grid:
print("".join(line))
for _ in range(int(input())):
H, W = map(int, input().split())
grid... | output | 1 | 19,675 | 15 | 39,351 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are many sunflowers in the Garden of the Sun.
Garden of the Sun is a rectangular table with n rows and m columns, where the cells of the table are farmlands. All of the cells grow a sunflower on it. Unfortunately, one night, the light... | instruction | 0 | 19,676 | 15 | 39,352 |
Tags: constructive algorithms, graphs
Correct Solution:
```
for _ in range(int(input())):
n, m = map(int, input().split())
grid = []
for _ in range(n):
grid.append(list(input()))
if n % 3 != 0:
for i in range(0, n, 3):
for j in range(m):
grid[i][j] = "X"
... | output | 1 | 19,676 | 15 | 39,353 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are many sunflowers in the Garden of the Sun.
Garden of the Sun is a rectangular table with n rows and m columns, where the cells of the table are farmlands. All of the cells grow a sunflower on it. Unfortunately, one night, the light... | instruction | 0 | 19,677 | 15 | 39,354 |
Tags: constructive algorithms, graphs
Correct Solution:
```
import sys,io,os
try:Z=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
except:Z=lambda:sys.stdin.readline().encode()
O=[]
for _ in range(int(Z())):
N,M=map(int,Z().split());b=[];w=[['']*M for i in range(N)];s=M%3==0;t=2-s-s
for i in range(N):b.appe... | output | 1 | 19,677 | 15 | 39,355 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are many sunflowers in the Garden of the Sun.
Garden of the Sun is a rectangular table with n rows and m columns, where the cells of the table are farmlands. All of the cells grow a sunflower on it. Unfortunately, one night, the light... | instruction | 0 | 19,678 | 15 | 39,356 |
Tags: constructive algorithms, graphs
Correct Solution:
```
import sys
input = sys.stdin.readline
t=int(input())
for tests in range(t):
n,m=map(int,input().split())
MAP=[list(input().strip()) for i in range(n)]
if m<=1:
for i in range(n):
MAP[i][0]="X"
for j in range(1,m,3):
... | output | 1 | 19,678 | 15 | 39,357 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are many sunflowers in the Garden of the Sun.
Garden of the Sun is a rectangular table with n rows and m columns, where the cells of the table are farmlands. All of the cells grow a sunflower on it. Unfortunately, one night, the light... | instruction | 0 | 19,679 | 15 | 39,358 |
Tags: constructive algorithms, graphs
Correct Solution:
```
for _ in range(int(input())):
m,n = map(int,input().split())
s = [['' for _ in range(n)] for _ in range(m)]
t = ["" for _ in range(m)]
for i in range(m):
t[i] = input()
for j in range(n):
s[i][j] = t[i][j]
if m %... | output | 1 | 19,679 | 15 | 39,359 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are many sunflowers in the Garden of the Sun.
Garden of the Sun is a rectangular table with n rows and m columns, where the cells of the table are farmlands. All of the cells grow a sunflower on it. Unfortunately, one night, the light... | instruction | 0 | 19,680 | 15 | 39,360 |
Tags: constructive algorithms, graphs
Correct Solution:
```
#!/usr/bin/env python3
import sys, getpass
import math, random
import functools, itertools, collections, heapq, bisect
from collections import Counter, defaultdict, deque
input = sys.stdin.readline # to read input quickly
# available on Google, AtCoder Pytho... | output | 1 | 19,680 | 15 | 39,361 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are many sunflowers in the Garden of the Sun.
Garden of the Sun is a rectangular table with n rows and m columns, where the cells of the table are farmlands. All of the cells grow a sunfl... | instruction | 0 | 19,681 | 15 | 39,362 |
Yes | output | 1 | 19,681 | 15 | 39,363 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are many sunflowers in the Garden of the Sun.
Garden of the Sun is a rectangular table with n rows and m columns, where the cells of the table are farmlands. All of the cells grow a sunfl... | instruction | 0 | 19,682 | 15 | 39,364 |
Yes | output | 1 | 19,682 | 15 | 39,365 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are many sunflowers in the Garden of the Sun.
Garden of the Sun is a rectangular table with n rows and m columns, where the cells of the table are farmlands. All of the cells grow a sunfl... | instruction | 0 | 19,683 | 15 | 39,366 |
Yes | output | 1 | 19,683 | 15 | 39,367 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are many sunflowers in the Garden of the Sun.
Garden of the Sun is a rectangular table with n rows and m columns, where the cells of the table are farmlands. All of the cells grow a sunfl... | instruction | 0 | 19,684 | 15 | 39,368 |
Yes | output | 1 | 19,684 | 15 | 39,369 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are many sunflowers in the Garden of the Sun.
Garden of the Sun is a rectangular table with n rows and m columns, where the cells of the table are farmlands. All of the cells grow a sunfl... | instruction | 0 | 19,685 | 15 | 39,370 |
No | output | 1 | 19,685 | 15 | 39,371 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are many sunflowers in the Garden of the Sun.
Garden of the Sun is a rectangular table with n rows and m columns, where the cells of the table are farmlands. All of the cells grow a sunfl... | instruction | 0 | 19,686 | 15 | 39,372 |
No | output | 1 | 19,686 | 15 | 39,373 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are many sunflowers in the Garden of the Sun.
Garden of the Sun is a rectangular table with n rows and m columns, where the cells of the table are farmlands. All of the cells grow a sunfl... | instruction | 0 | 19,687 | 15 | 39,374 |
No | output | 1 | 19,687 | 15 | 39,375 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are many sunflowers in the Garden of the Sun.
Garden of the Sun is a rectangular table with n rows and m columns, where the cells of the table are farmlands. All of the cells grow a sunfl... | instruction | 0 | 19,688 | 15 | 39,376 |
No | output | 1 | 19,688 | 15 | 39,377 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Professor GukiZ makes a new robot. The robot are in the point with coordinates (x1, y1) and should go to the point (x2, y2). In a single step the robot can change any of its coordinates (maybe both of them) by one (decrease or increase). So ... | instruction | 0 | 19,856 | 15 | 39,712 |
Tags: implementation, math
Correct Solution:
```
a,b=map(int,input().split())
c,d=map(int,input().split())
t1=abs(a-c)
t2=abs(b-d)
print(max(t1,t2))
``` | output | 1 | 19,856 | 15 | 39,713 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Professor GukiZ makes a new robot. The robot are in the point with coordinates (x1, y1) and should go to the point (x2, y2). In a single step the robot can change any of its coordinates (maybe both of them) by one (decrease or increase). So ... | instruction | 0 | 19,857 | 15 | 39,714 |
Tags: implementation, math
Correct Solution:
```
x1,y1 = map(int,input().split())
x2,y2 = map(int,input().split())
print(int(max(abs(x1-x2),abs(y1-y2))))
``` | output | 1 | 19,857 | 15 | 39,715 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Professor GukiZ makes a new robot. The robot are in the point with coordinates (x1, y1) and should go to the point (x2, y2). In a single step the robot can change any of its coordinates (maybe both of them) by one (decrease or increase). So ... | instruction | 0 | 19,858 | 15 | 39,716 |
Tags: implementation, math
Correct Solution:
```
x1,y1=map(int,(input().split()))
x2,y2=map(int,(input().split()))
b=abs(x2-x1)
c=abs(y2-y1)
a=min(abs(x1-x2),abs(y2-y1))
print(a+abs(a-b)+abs(a-c))
``` | output | 1 | 19,858 | 15 | 39,717 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Professor GukiZ makes a new robot. The robot are in the point with coordinates (x1, y1) and should go to the point (x2, y2). In a single step the robot can change any of its coordinates (maybe both of them) by one (decrease or increase). So ... | instruction | 0 | 19,859 | 15 | 39,718 |
Tags: implementation, math
Correct Solution:
```
[x_1,y_1] = [int(i) for i in input().split()]
[x_2,y_2] = [int(i) for i in input().split()]
print(max(abs(x_1-x_2),abs(y_1-y_2)))
``` | output | 1 | 19,859 | 15 | 39,719 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Professor GukiZ makes a new robot. The robot are in the point with coordinates (x1, y1) and should go to the point (x2, y2). In a single step the robot can change any of its coordinates (maybe both of them) by one (decrease or increase). So ... | instruction | 0 | 19,861 | 15 | 39,722 |
Tags: implementation, math
Correct Solution:
```
#!/usr/bin/env python3
x1, y1 = list([int(x) for x in input().split()])
x2, y2 = list([int(x) for x in input().split()])
x = abs(x2 - x1)
y = abs(y2 - y1)
print(max(x,y))
``` | output | 1 | 19,861 | 15 | 39,723 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Professor GukiZ makes a new robot. The robot are in the point with coordinates (x1, y1) and should go to the point (x2, y2). In a single step the robot can change any of its coordinates (maybe both of them) by one (decrease or increase). So ... | instruction | 0 | 19,862 | 15 | 39,724 |
Tags: implementation, math
Correct Solution:
```
def robot_move(x, y, a, b):
return max(abs(x - a), abs(y - b))
x, y = map(int, input().split())
a, b = map(int, input().split())
print(robot_move(x, y, a, b))
``` | output | 1 | 19,862 | 15 | 39,725 |
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.
In the grid, N Squares (r_1, c_1), (r_2, c_2), \ldots, (r_N, c_N) are wall squares, and the o... | instruction | 0 | 20,082 | 15 | 40,164 |
"Correct Solution:
```
# coding: utf-8
# Your code here!
SIZE=300000; MOD=10**9+7 #ここを変更する
inv = [0]*(SIZE+1)# inv[j] = j^{-1} mod MOD
fac = [0]*(SIZE+1)# fac[j] = j! mod MOD
finv = [0]*(SIZE+1)# finv[j] = (j!)^{-1} mod MOD
inv[1] = 1
fac[0] = fac[1] = 1
finv[0] = finv[1] = 1
for i in range(2,SIZE+1):
inv[i] = MOD... | output | 1 | 20,082 | 15 | 40,165 |
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.
In the grid, N Squares (r_1, c_1), (r_2, c_2), \ldots, (r_N, c_N) are wall squares, and the o... | instruction | 0 | 20,083 | 15 | 40,166 |
"Correct Solution:
```
def main():
import sys
from operator import itemgetter
input = sys.stdin.readline
mod = 1000000007
# comb init
nmax = 3 * 10 ** 5 + 1 # change here
fac = [0] * (nmax + 1)
finv = [0] * (nmax + 1)
inv = [0] * (nmax + 1)
fac[0] = 1
fac[1] = 1
finv[0]... | output | 1 | 20,083 | 15 | 40,167 |
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.
In the grid, N Squares (r_1, c_1), (r_2, c_2), \ldots, (r_N, c_N) are wall squares, and the o... | instruction | 0 | 20,084 | 15 | 40,168 |
"Correct Solution:
```
class Combination:
def __init__(self, n, MOD):
self.fact = [1] * (n + 1)
for i in range(1, n + 1):
self.fact[i] = self.fact[i-1] * i % MOD
self.inv_fact = [pow(self.fact[i], MOD - 2, MOD) for i in range(n + 1)]
self.MOD = MOD
def factorial(self... | output | 1 | 20,084 | 15 | 40,169 |
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.
In the grid, N Squares (r_1, c_1), (r_2, c_2), \ldots, (r_N, c_N) are wall squares, and the o... | instruction | 0 | 20,085 | 15 | 40,170 |
"Correct Solution:
```
mod = 10**9+7
frac = [1]*200001
for i in range(2,200001):
frac[i] = i * frac[i-1]%mod
fraci = [None]*200001
fraci[-1] = pow(frac[-1], mod -2, mod)
for i in range(-2, -200001-1, -1):
fraci[i] = fraci[i+1] * (200001 + i + 1) % mod
def comb(a, b):
if not a >= b >= 0:
return 0
... | output | 1 | 20,085 | 15 | 40,171 |
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.
In the grid, N Squares (r_1, c_1), (r_2, c_2), \ldots, (r_N, c_N) are wall squares, and the o... | instruction | 0 | 20,086 | 15 | 40,172 |
"Correct Solution:
```
import sys
def prepare(n):
fact = [1] * (n + 1)
for i in range(1, n + 1):
fact[i] = fact[i - 1] * i % MOD
inv = [1] * (n + 1)
inv[n] = pow(fact[n], MOD - 2, MOD)
for i in range(n - 1, 0, -1):
inv[i] = inv[i + 1] * (i + 1) % MOD
return fact, inv
MOD = 10... | output | 1 | 20,086 | 15 | 40,173 |
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.
In the grid, N Squares (r_1, c_1), (r_2, c_2), \ldots, (r_N, c_N) are wall squares, and the o... | instruction | 0 | 20,087 | 15 | 40,174 |
"Correct Solution:
```
import sys
input = sys.stdin.readline
mod=10**9+7
H,W,N=map(int,input().split())
B=[tuple(map(int,input().split())) for i in range(N)]
B.append((H,W))
B.sort()
FACT=[1]
INVFACT=[1]
for i in range(1,H+W):
FACT.append(FACT[-1]*i%mod)
INVFACT.append(INVFACT[-1]*pow(i,mod-2,mod)%mod)
def ... | output | 1 | 20,087 | 15 | 40,175 |
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.
In the grid, N Squares (r_1, c_1), (r_2, c_2), \ldots, (r_N, c_N) are wall squares, and the o... | instruction | 0 | 20,088 | 15 | 40,176 |
"Correct Solution:
```
H, W, N = map(int, input().split())
P = [list(map(int, input().split())) for i in range(N)]
P.sort(reverse=1)
MOD = 10**9 + 7
fact = [1]*(H+W+1)
rfact = [1]*(H+W+1)
for i in range(H+W):
fact[i+1] = r = fact[i] * (i+1) % MOD
rfact[i+1] = pow(r, MOD-2, MOD)
def comb(n, k):
return fact... | output | 1 | 20,088 | 15 | 40,177 |
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.
In the grid, N Squares (r_1, c_1), (r_2, c_2), \ldots, (r_N, c_N) are wall squares, and the o... | instruction | 0 | 20,089 | 15 | 40,178 |
"Correct Solution:
```
mod = 10**9+7
frac = [1]*200001
for i in range(2,200001):
frac[i] = i * frac[i-1]%mod
fraci = [None]*200001
fraci[-1] = pow(frac[-1], mod -2, mod)
for i in range(-2, -200001-1, -1):
fraci[i] = fraci[i+1] * (200001 + i + 1) % mod
def comb(a, b):
if not a >= b >= 0:
return 0
... | output | 1 | 20,089 | 15 | 40,179 |
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.
In the grid, N Squares (r_1, c_1), (r... | instruction | 0 | 20,090 | 15 | 40,180 |
Yes | output | 1 | 20,090 | 15 | 40,181 |
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.
In the grid, N Squares (r_1, c_1), (r... | instruction | 0 | 20,091 | 15 | 40,182 |
Yes | output | 1 | 20,091 | 15 | 40,183 |
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.
In the grid, N Squares (r_1, c_1), (r... | instruction | 0 | 20,092 | 15 | 40,184 |
Yes | output | 1 | 20,092 | 15 | 40,185 |
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.
In the grid, N Squares (r_1, c_1), (r... | instruction | 0 | 20,093 | 15 | 40,186 |
Yes | output | 1 | 20,093 | 15 | 40,187 |
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.
In the grid, N Squares (r_1, c_1), (r... | instruction | 0 | 20,094 | 15 | 40,188 |
No | output | 1 | 20,094 | 15 | 40,189 |
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.
In the grid, N Squares (r_1, c_1), (r... | instruction | 0 | 20,095 | 15 | 40,190 |
No | output | 1 | 20,095 | 15 | 40,191 |
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.
In the grid, N Squares (r_1, c_1), (r... | instruction | 0 | 20,096 | 15 | 40,192 |
No | output | 1 | 20,096 | 15 | 40,193 |
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.
In the grid, N Squares (r_1, c_1), (r... | instruction | 0 | 20,097 | 15 | 40,194 |
No | output | 1 | 20,097 | 15 | 40,195 |
Provide a correct Python 3 solution for this coding contest problem.
A robot is put at the origin in a two-dimensional plane. Initially, the robot is facing in the positive x-axis direction.
This robot will be given an instruction sequence s. s consists of the following two kinds of letters, and will be executed in o... | instruction | 0 | 20,114 | 15 | 40,228 |
"Correct Solution:
```
def f(m,l):
tmpm=set()
for x in m:
tmpm.add(x+l);tmpm.add(x-l)
return tmpm
s=input()+"T"
x,y=map(int,input().split())
while s and s[0]=="F":
x-=1
s=s[1:]
ss=[{0},{0}]
mode=0
l=0
for i in range(len(s)):
if s[i]=="F": l+=1
else:
ss[mode]=f(ss[mode],l) ... | output | 1 | 20,114 | 15 | 40,229 |
Provide a correct Python 3 solution for this coding contest problem.
A robot is put at the origin in a two-dimensional plane. Initially, the robot is facing in the positive x-axis direction.
This robot will be given an instruction sequence s. s consists of the following two kinds of letters, and will be executed in o... | instruction | 0 | 20,116 | 15 | 40,232 |
"Correct Solution:
```
S=str(input())
s=list(S)
x,y=map(int,input().split())
fora=0
side=[]
updw=[]
while s[0]=="F":
fora+=1
s.pop(0)
if len(s)==0:break
flag=1#1のとき横向き、-1のときたて向き
step=0
while s:
if s[0]=="T":
s.pop(0)
if step:
if flag==-1: updw+=[step]
else: side+=[step]
flag=flag*(-1)
... | output | 1 | 20,116 | 15 | 40,233 |
Provide a correct Python 3 solution for this coding contest problem.
A robot is put at the origin in a two-dimensional plane. Initially, the robot is facing in the positive x-axis direction.
This robot will be given an instruction sequence s. s consists of the following two kinds of letters, and will be executed in o... | instruction | 0 | 20,117 | 15 | 40,234 |
"Correct Solution:
```
import sys
s=input()
A,B =map(int,input().split())
table=[[] for i in range(2)]#0が横1が縦
t = 0
k=0
for i in range(len(s)):
if s[i]=='F':
k+=1
else:
table[t].append(k)
t=(t+1)%2
k=0
table[t].append(k)
L=len(s)
Lx=[set() for i in range(len(table[0]) +1)]
Ly=[se... | output | 1 | 20,117 | 15 | 40,235 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.