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.
There is a frog staying to the left of the string s = s_1 s_2 … s_n consisting of n characters (to be more precise, the frog initially stays at the cell 0). Each character of s is either 'L' or ... | instruction | 0 | 69,082 | 15 | 138,164 |
Yes | output | 1 | 69,082 | 15 | 138,165 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a frog staying to the left of the string s = s_1 s_2 … s_n consisting of n characters (to be more precise, the frog initially stays at the cell 0). Each character of s is either 'L' or ... | instruction | 0 | 69,083 | 15 | 138,166 |
No | output | 1 | 69,083 | 15 | 138,167 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a frog staying to the left of the string s = s_1 s_2 … s_n consisting of n characters (to be more precise, the frog initially stays at the cell 0). Each character of s is either 'L' or ... | instruction | 0 | 69,084 | 15 | 138,168 |
No | output | 1 | 69,084 | 15 | 138,169 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a frog staying to the left of the string s = s_1 s_2 … s_n consisting of n characters (to be more precise, the frog initially stays at the cell 0). Each character of s is either 'L' or ... | instruction | 0 | 69,085 | 15 | 138,170 |
No | output | 1 | 69,085 | 15 | 138,171 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a frog staying to the left of the string s = s_1 s_2 … s_n consisting of n characters (to be more precise, the frog initially stays at the cell 0). Each character of s is either 'L' or ... | instruction | 0 | 69,086 | 15 | 138,172 |
No | output | 1 | 69,086 | 15 | 138,173 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You've got an n × m matrix. The matrix consists of integers. In one move, you can apply a single transformation to the matrix: choose an arbitrary element of the matrix and increase it by 1. Eac... | instruction | 0 | 69,257 | 15 | 138,514 |
Yes | output | 1 | 69,257 | 15 | 138,515 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You've got an n × m matrix. The matrix consists of integers. In one move, you can apply a single transformation to the matrix: choose an arbitrary element of the matrix and increase it by 1. Eac... | instruction | 0 | 69,258 | 15 | 138,516 |
Yes | output | 1 | 69,258 | 15 | 138,517 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You've got an n × m matrix. The matrix consists of integers. In one move, you can apply a single transformation to the matrix: choose an arbitrary element of the matrix and increase it by 1. Eac... | instruction | 0 | 69,263 | 15 | 138,526 |
No | output | 1 | 69,263 | 15 | 138,527 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You've got an n × m matrix. The matrix consists of integers. In one move, you can apply a single transformation to the matrix: choose an arbitrary element of the matrix and increase it by 1. Eac... | instruction | 0 | 69,264 | 15 | 138,528 |
No | output | 1 | 69,264 | 15 | 138,529 |
Provide tags and a correct Python 3 solution for this coding contest problem.
After a wonderful evening in the restaurant the time to go home came. Leha as a true gentlemen suggested Noora to give her a lift. Certainly the girl agreed with pleasure. Suddenly one problem appeared: Leha cannot find his car on a huge par... | instruction | 0 | 69,506 | 15 | 139,012 |
Tags: combinatorics, divide and conquer, dp
Correct Solution:
```
mod = 1000000007
def sum(x, y, k, add) :
if k < add : return 0
up = x + add
if up > k : up = k
add = add + 1
return y * ( ( (add + up) * (up - add + 1) // 2 ) % mod ) % mod
def solve(x, y, k, add = 0) :
if x == 0 or y == 0 : ret... | output | 1 | 69,506 | 15 | 139,013 |
Provide tags and a correct Python 3 solution for this coding contest problem.
After a wonderful evening in the restaurant the time to go home came. Leha as a true gentlemen suggested Noora to give her a lift. Certainly the girl agreed with pleasure. Suddenly one problem appeared: Leha cannot find his car on a huge par... | instruction | 0 | 69,507 | 15 | 139,014 |
Tags: combinatorics, divide and conquer, dp
Correct Solution:
```
mod = 1000000007
def sum(x,y,k,add) :
if k<add:return 0
up=x+add
if up>k:up=k
add=add+1
return y*(((add+up)*(up-add+1)//2)%mod)%mod
def solve(x,y,k,add=0) :
if x==0 or y==0:return 0
if x>y:x,y=y,x
pw = 1
while (pw<<1)<... | output | 1 | 69,507 | 15 | 139,015 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mikhail walks on a 2D plane. He can go either up or right. You are given a sequence of Mikhail's moves. He thinks that this sequence is too long and he wants to make it as short as possible.
In the given sequence moving up is described by c... | instruction | 0 | 69,573 | 15 | 139,146 |
Tags: implementation
Correct Solution:
```
n = int(input())
s = input() + "A"
cnt = 0
i = 0
while i < n:
if s[i] == "U" and s[i + 1] == "R":
cnt += 1
i += 2
elif s[i] == "R" and s[i + 1] == "U":
cnt += 1
i += 2
else:
i += 1
print(n - cnt)
``` | output | 1 | 69,573 | 15 | 139,147 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mikhail walks on a 2D plane. He can go either up or right. You are given a sequence of Mikhail's moves. He thinks that this sequence is too long and he wants to make it as short as possible.
In the given sequence moving up is described by c... | instruction | 0 | 69,574 | 15 | 139,148 |
Tags: implementation
Correct Solution:
```
n = int(input())
s = input()
a = ''
for i in s:
if len(a) == 0 or a[-1] == 'D' or a[-1] == i:
a = a + i
else:
a = a[:-1] + 'D'
print(len(a))
``` | output | 1 | 69,574 | 15 | 139,149 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mikhail walks on a 2D plane. He can go either up or right. You are given a sequence of Mikhail's moves. He thinks that this sequence is too long and he wants to make it as short as possible.
In the given sequence moving up is described by c... | instruction | 0 | 69,575 | 15 | 139,150 |
Tags: implementation
Correct Solution:
```
import re
i=input
i()
print(len(re.sub('UR|RU','D',i())))
``` | output | 1 | 69,575 | 15 | 139,151 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mikhail walks on a 2D plane. He can go either up or right. You are given a sequence of Mikhail's moves. He thinks that this sequence is too long and he wants to make it as short as possible.
In the given sequence moving up is described by c... | instruction | 0 | 69,576 | 15 | 139,152 |
Tags: implementation
Correct Solution:
```
n=int(input())
s=list(input())
for i in range(n-1):
if (s[i]=='U' and s[i+1]=="R") or (s[i]=='R' and s[i+1]=='U'):
s[i+1]="D"
print(len(s)-s.count("D"))
``` | output | 1 | 69,576 | 15 | 139,153 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mikhail walks on a 2D plane. He can go either up or right. You are given a sequence of Mikhail's moves. He thinks that this sequence is too long and he wants to make it as short as possible.
In the given sequence moving up is described by c... | instruction | 0 | 69,577 | 15 | 139,154 |
Tags: implementation
Correct Solution:
```
n=int(input())
S=input()
index = 0
summ=0
while index+1 < n:
if S[index]!=S[index+1]:
summ+=1
index+=1
index +=1
print(n-summ)
``` | output | 1 | 69,577 | 15 | 139,155 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mikhail walks on a 2D plane. He can go either up or right. You are given a sequence of Mikhail's moves. He thinks that this sequence is too long and he wants to make it as short as possible.
In the given sequence moving up is described by c... | instruction | 0 | 69,578 | 15 | 139,156 |
Tags: implementation
Correct Solution:
```
n = int(input())
s = input()
i = 0
cnt = 0
while i < (n-1):
if s[i:i+2] == 'UR' or s[i:i+2] == 'RU':
cnt += 1
i += 2
else:
i += 1
print(n-cnt)
``` | output | 1 | 69,578 | 15 | 139,157 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mikhail walks on a 2D plane. He can go either up or right. You are given a sequence of Mikhail's moves. He thinks that this sequence is too long and he wants to make it as short as possible.
In the given sequence moving up is described by c... | instruction | 0 | 69,579 | 15 | 139,158 |
Tags: implementation
Correct Solution:
```
import sys
import re
def main():
n, s = sys.stdin.read().strip().split()
return int(n) - len(re.findall('UR|RU', s))
print(main())
``` | output | 1 | 69,579 | 15 | 139,159 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mikhail walks on a 2D plane. He can go either up or right. You are given a sequence of Mikhail's moves. He thinks that this sequence is too long and he wants to make it as short as possible.
In the given sequence moving up is described by c... | instruction | 0 | 69,580 | 15 | 139,160 |
Tags: implementation
Correct Solution:
```
n = input()
path = input()
subs = 0
i = 0
while i < len(path) - 1:
if path[i:i+2] in ("RU", "UR"):
subs += 1
i += 1
i += 1
print(len(path) - subs)
``` | output | 1 | 69,580 | 15 | 139,161 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mikhail walks on a 2D plane. He can go either up or right. You are given a sequence of Mikhail's moves. He thinks that this sequence is too long and he wants to make it as short as possible.
In... | instruction | 0 | 69,581 | 15 | 139,162 |
Yes | output | 1 | 69,581 | 15 | 139,163 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mikhail walks on a 2D plane. He can go either up or right. You are given a sequence of Mikhail's moves. He thinks that this sequence is too long and he wants to make it as short as possible.
In... | instruction | 0 | 69,582 | 15 | 139,164 |
Yes | output | 1 | 69,582 | 15 | 139,165 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mikhail walks on a 2D plane. He can go either up or right. You are given a sequence of Mikhail's moves. He thinks that this sequence is too long and he wants to make it as short as possible.
In... | instruction | 0 | 69,583 | 15 | 139,166 |
Yes | output | 1 | 69,583 | 15 | 139,167 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mikhail walks on a 2D plane. He can go either up or right. You are given a sequence of Mikhail's moves. He thinks that this sequence is too long and he wants to make it as short as possible.
In... | instruction | 0 | 69,584 | 15 | 139,168 |
Yes | output | 1 | 69,584 | 15 | 139,169 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mikhail walks on a 2D plane. He can go either up or right. You are given a sequence of Mikhail's moves. He thinks that this sequence is too long and he wants to make it as short as possible.
In... | instruction | 0 | 69,585 | 15 | 139,170 |
No | output | 1 | 69,585 | 15 | 139,171 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mikhail walks on a 2D plane. He can go either up or right. You are given a sequence of Mikhail's moves. He thinks that this sequence is too long and he wants to make it as short as possible.
In... | instruction | 0 | 69,586 | 15 | 139,172 |
No | output | 1 | 69,586 | 15 | 139,173 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mikhail walks on a 2D plane. He can go either up or right. You are given a sequence of Mikhail's moves. He thinks that this sequence is too long and he wants to make it as short as possible.
In... | instruction | 0 | 69,587 | 15 | 139,174 |
No | output | 1 | 69,587 | 15 | 139,175 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mikhail walks on a 2D plane. He can go either up or right. You are given a sequence of Mikhail's moves. He thinks that this sequence is too long and he wants to make it as short as possible.
In... | instruction | 0 | 69,588 | 15 | 139,176 |
No | output | 1 | 69,588 | 15 | 139,177 |
Provide a correct Python 3 solution for this coding contest problem.
Niwango-kun, an employee of Dwango Co., Ltd., likes Niconico TV-chan, so he collected a lot of soft toys of her and spread them on the floor.
Niwango-kun has N black rare soft toys of Niconico TV-chan and they are spread together with ordinary ones.... | instruction | 0 | 69,645 | 15 | 139,290 |
"Correct Solution:
```
n,d = map(int,input().split())
num = [[0]*d for i in range(d)]
a = 0
for i in range(n):
x,y = map(int,input().split())
x %=d
y%=d
num[x][y] += 1
a = max(a,num[x][y])
x=1
while x*x<a:
x += 1
r = (x-1)*d
a = x-1
dai = d-1
syo = 0
anum = [[[0]*d for i in range(d)]for i in range(3)]
rui =... | output | 1 | 69,645 | 15 | 139,291 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a grid with H rows and W columns. The state of the cell at the i-th (1≤i≤H) row and j-th (1≤j≤W) column is represented by a letter a_{ij}, as follows:
* `.` : This cell is empty.
* `o` ... | instruction | 0 | 69,690 | 15 | 139,380 |
No | output | 1 | 69,690 | 15 | 139,381 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a grid with H rows and W columns. The state of the cell at the i-th (1≤i≤H) row and j-th (1≤j≤W) column is represented by a letter a_{ij}, as follows:
* `.` : This cell is empty.
* `o` ... | instruction | 0 | 69,691 | 15 | 139,382 |
No | output | 1 | 69,691 | 15 | 139,383 |
Provide a correct Python 3 solution for this coding contest problem.
One morning when you woke up, it was in a springy labyrinth.
I don't know why I'm in such a strange place. You have the option of waiting for help here, but you know from experience that if you stay in a labyrinth like this for a long time, a gust o... | instruction | 0 | 69,781 | 15 | 139,562 |
"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**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(): return [int... | output | 1 | 69,781 | 15 | 139,563 |
Provide a correct Python 3 solution for this coding contest problem.
One morning when you woke up, it was in a springy labyrinth.
I don't know why I'm in such a strange place. You have the option of waiting for help here, but you know from experience that if you stay in a labyrinth like this for a long time, a gust o... | instruction | 0 | 69,782 | 15 | 139,564 |
"Correct Solution:
```
from collections import deque
w, h = map(int, input().split())
mp = [input() for _ in range(h)]
springs = []
tile_cnt = 0
for y in range(h):
for x in range(w):
if mp[y][x] == "*":
springs.append((x, y))
if mp[y][x] == "g":
gx, gy = x, y
if mp[y][x] == "s":
sx, sy... | output | 1 | 69,782 | 15 | 139,565 |
Provide a correct Python 3 solution for this coding contest problem.
One morning when you woke up, it was in a springy labyrinth.
I don't know why I'm in such a strange place. You have the option of waiting for help here, but you know from experience that if you stay in a labyrinth like this for a long time, a gust o... | instruction | 0 | 69,783 | 15 | 139,566 |
"Correct Solution:
```
from collections import deque
import sys
readline = sys.stdin.readline
write = sys.stdout.write
def solve():
W, H = map(int, readline().split())
S = [readline().strip() for i in range(H)]
R = [[0]*W for i in range(H)]
P = []
cnt = 0
for i in range(H):
Si = S[i]
... | output | 1 | 69,783 | 15 | 139,567 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya has a rectangular Board of size n × m. Initially, k chips are placed on the board, i-th chip is located in the cell at the intersection of sx_i-th row and sy_i-th column.
In one action, Petya can move all the chips to the left, right,... | instruction | 0 | 69,989 | 15 | 139,978 |
Tags: constructive algorithms, implementation
Correct Solution:
```
from sys import stdin
def main():
n, m, k = map(int, stdin.readline().split())
for _ in range (k):
x, y = map(int, stdin.readline().split())
ans = str()
for _ in range (n - 1):
ans += 'U'
for _ in range (m - 1):
... | output | 1 | 69,989 | 15 | 139,979 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya has a rectangular Board of size n × m. Initially, k chips are placed on the board, i-th chip is located in the cell at the intersection of sx_i-th row and sy_i-th column.
In one action, Petya can move all the chips to the left, right,... | instruction | 0 | 69,990 | 15 | 139,980 |
Tags: constructive algorithms, implementation
Correct Solution:
```
n, m, k = map(int,input().split())
l = ""
for a in range(2*k):
input()
for i in range(n-1):
l = l+"U"
for j in range(m-1):
l = l+"L"
for h in range(n*m-1):
if h % m == m-1:
l = l+"D"
else:
if h//m % 2 == 0:
... | output | 1 | 69,990 | 15 | 139,981 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya has a rectangular Board of size n × m. Initially, k chips are placed on the board, i-th chip is located in the cell at the intersection of sx_i-th row and sy_i-th column.
In one action, Petya can move all the chips to the left, right,... | instruction | 0 | 69,991 | 15 | 139,982 |
Tags: constructive algorithms, implementation
Correct Solution:
```
n, m, k = map(int, input().strip().split())
# n = int(n)
# m = int(m)
# k = int(k)
output = "U" * (n-1)
output = output + "L"*(m-1)
letter = "R"
for a in range(n):
output = output + letter*(m-1)
output = output + "D"
letter = "R" if letter... | output | 1 | 69,991 | 15 | 139,983 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya has a rectangular Board of size n × m. Initially, k chips are placed on the board, i-th chip is located in the cell at the intersection of sx_i-th row and sy_i-th column.
In one action, Petya can move all the chips to the left, right,... | instruction | 0 | 69,992 | 15 | 139,984 |
Tags: constructive algorithms, implementation
Correct Solution:
```
n, m, k = map(int, input().split())
for i in range(k):
input()
res = ""
res += 'U' * (n - 1)
res += 'L' * (m - 1)
for i in range(n):
if(i % 2 == 0):
res += 'R' * (m - 1)
else :
res += 'L' * (m - 1)
... | output | 1 | 69,992 | 15 | 139,985 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya has a rectangular Board of size n × m. Initially, k chips are placed on the board, i-th chip is located in the cell at the intersection of sx_i-th row and sy_i-th column.
In one action, Petya can move all the chips to the left, right,... | instruction | 0 | 69,993 | 15 | 139,986 |
Tags: constructive algorithms, implementation
Correct Solution:
```
from sys import stdin
from collections import deque
mod = 10**9 + 7
import sys
import random
# sys.setrecursionlimit(10**6)
from queue import PriorityQueue
# def rl():
# return [int(w) for w in stdin.readline().split()]
from bisect import bisect_ri... | output | 1 | 69,993 | 15 | 139,987 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya has a rectangular Board of size n × m. Initially, k chips are placed on the board, i-th chip is located in the cell at the intersection of sx_i-th row and sy_i-th column.
In one action, Petya can move all the chips to the left, right,... | instruction | 0 | 69,994 | 15 | 139,988 |
Tags: constructive algorithms, implementation
Correct Solution:
```
n, m, k = map(int, input().split())
mass = list()
answer = ''
for i in range(k):
x, y = map(int, input().split())
mass.append([x, y])
for i in range(k):
x, y = map(int, input().split())
answer = answer + ''.join(['R'] * m)
answer = a... | output | 1 | 69,994 | 15 | 139,989 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya has a rectangular Board of size n × m. Initially, k chips are placed on the board, i-th chip is located in the cell at the intersection of sx_i-th row and sy_i-th column.
In one action, Petya can move all the chips to the left, right,... | instruction | 0 | 69,995 | 15 | 139,990 |
Tags: constructive algorithms, implementation
Correct Solution:
```
n,m,k=list(map(int,input().split()))
for i in range(k):
sx,sy=map(int,input().split())
for i in range(k):
fx,fy=map(int,input().split())
ans="L"*(m-1)+"U"*(n-1)
for i in range(n):
if(i!=0):
ans=ans+"D"
if(i%2==0):
ans=an... | output | 1 | 69,995 | 15 | 139,991 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Petya has a rectangular Board of size n × m. Initially, k chips are placed on the board, i-th chip is located in the cell at the intersection of sx_i-th row and sy_i-th column.
In one action, Petya can move all the chips to the left, right,... | instruction | 0 | 69,996 | 15 | 139,992 |
Tags: constructive algorithms, implementation
Correct Solution:
```
def main():
import sys
input=sys.stdin.readline
n,m,k=map(int,input().split())
ans="L"*(m-1)+"U"*(n-1)
flag=1
for i in range(m):
if flag==1:
ans+="D"*(n-1)+"R"
else:
ans+="U"*(n-1)+"R"
... | output | 1 | 69,996 | 15 | 139,993 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petya has a rectangular Board of size n × m. Initially, k chips are placed on the board, i-th chip is located in the cell at the intersection of sx_i-th row and sy_i-th column.
In one action, P... | instruction | 0 | 69,997 | 15 | 139,994 |
Yes | output | 1 | 69,997 | 15 | 139,995 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petya has a rectangular Board of size n × m. Initially, k chips are placed on the board, i-th chip is located in the cell at the intersection of sx_i-th row and sy_i-th column.
In one action, P... | instruction | 0 | 69,998 | 15 | 139,996 |
Yes | output | 1 | 69,998 | 15 | 139,997 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petya has a rectangular Board of size n × m. Initially, k chips are placed on the board, i-th chip is located in the cell at the intersection of sx_i-th row and sy_i-th column.
In one action, P... | instruction | 0 | 69,999 | 15 | 139,998 |
Yes | output | 1 | 69,999 | 15 | 139,999 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petya has a rectangular Board of size n × m. Initially, k chips are placed on the board, i-th chip is located in the cell at the intersection of sx_i-th row and sy_i-th column.
In one action, P... | instruction | 0 | 70,000 | 15 | 140,000 |
Yes | output | 1 | 70,000 | 15 | 140,001 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petya has a rectangular Board of size n × m. Initially, k chips are placed on the board, i-th chip is located in the cell at the intersection of sx_i-th row and sy_i-th column.
In one action, P... | instruction | 0 | 70,001 | 15 | 140,002 |
No | output | 1 | 70,001 | 15 | 140,003 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petya has a rectangular Board of size n × m. Initially, k chips are placed on the board, i-th chip is located in the cell at the intersection of sx_i-th row and sy_i-th column.
In one action, P... | instruction | 0 | 70,002 | 15 | 140,004 |
No | output | 1 | 70,002 | 15 | 140,005 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petya has a rectangular Board of size n × m. Initially, k chips are placed on the board, i-th chip is located in the cell at the intersection of sx_i-th row and sy_i-th column.
In one action, P... | instruction | 0 | 70,003 | 15 | 140,006 |
No | output | 1 | 70,003 | 15 | 140,007 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Petya has a rectangular Board of size n × m. Initially, k chips are placed on the board, i-th chip is located in the cell at the intersection of sx_i-th row and sy_i-th column.
In one action, P... | instruction | 0 | 70,004 | 15 | 140,008 |
No | output | 1 | 70,004 | 15 | 140,009 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The last product of the R2 company in the 2D games' field is a new revolutionary algorithm of searching for the shortest path in a 2 × n maze.
Imagine a maze that looks like a 2 × n rectangle, ... | instruction | 0 | 70,171 | 15 | 140,342 |
No | output | 1 | 70,171 | 15 | 140,343 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.