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.
Fox Ciel is playing a game. In this game there is an infinite long tape with cells indexed by integers (positive, negative and zero). At the beginning she is standing at the cell 0.
There are a... | instruction | 0 | 11,170 | 15 | 22,340 |
Yes | output | 1 | 11,170 | 15 | 22,341 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Fox Ciel is playing a game. In this game there is an infinite long tape with cells indexed by integers (positive, negative and zero). At the beginning she is standing at the cell 0.
There are a... | instruction | 0 | 11,171 | 15 | 22,342 |
Yes | output | 1 | 11,171 | 15 | 22,343 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Fox Ciel is playing a game. In this game there is an infinite long tape with cells indexed by integers (positive, negative and zero). At the beginning she is standing at the cell 0.
There are a... | instruction | 0 | 11,172 | 15 | 22,344 |
No | output | 1 | 11,172 | 15 | 22,345 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Fox Ciel is playing a game. In this game there is an infinite long tape with cells indexed by integers (positive, negative and zero). At the beginning she is standing at the cell 0.
There are a... | instruction | 0 | 11,173 | 15 | 22,346 |
No | output | 1 | 11,173 | 15 | 22,347 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Fox Ciel is playing a game. In this game there is an infinite long tape with cells indexed by integers (positive, negative and zero). At the beginning she is standing at the cell 0.
There are a... | instruction | 0 | 11,174 | 15 | 22,348 |
No | output | 1 | 11,174 | 15 | 22,349 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Robot is in a rectangular maze of size n × m. Each cell of the maze is either empty or occupied by an obstacle. The Robot can move between neighboring cells on the side left (the symbol "L"), right (the symbol "R"), up (the symbol "U") o... | instruction | 0 | 11,289 | 15 | 22,578 |
Tags: *special, dfs and similar, graphs, greedy, shortest paths
Correct Solution:
```
from collections import deque
n, m, k =map(int, input().split())
grid = []
for i in range(n):
grid.append(input())
for j in range(m):
if grid[i][j] == "X":
pos_i, pos_j = i, j
if k & 1:
print('IMPOS... | output | 1 | 11,289 | 15 | 22,579 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Robot is in a rectangular maze of size n × m. Each cell of the maze is either empty or occupied by an obstacle. The Robot can move between neighboring cells on the side left (the symbol "L"), right (the symbol "R"), up (the symbol "U") o... | instruction | 0 | 11,290 | 15 | 22,580 |
Tags: *special, dfs and similar, graphs, greedy, shortest paths
Correct Solution:
```
import math
from collections import deque
def main():
n, m, k = list(map(int, input().split()))
grid = ["" for _ in range(n)]
x, y = 0, 0
for i in range(n):
grid[i] = input()
if 'X' in grid[i]:
x, y = i, grid[i].index('X'... | output | 1 | 11,290 | 15 | 22,581 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Robot is in a rectangular maze of size n × m. Each cell of the maze is either empty or occupied by an obstacle. The Robot can move between neighboring cells on the side left (the symbol "L"), right (the symbol "R"), up (the symbol "U") o... | instruction | 0 | 11,291 | 15 | 22,582 |
Tags: *special, dfs and similar, graphs, greedy, shortest paths
Correct Solution:
```
import math
from collections import deque
def main():
n, m, k = list(map(int, input().split()))
grid = ["" for _ in range(n)]
x, y = 0, 0
for i in range(n):
grid[i] = input()
if 'X' in grid[i]:
x, y = i, grid[i].index('X'... | output | 1 | 11,291 | 15 | 22,583 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Robot is in a rectangular maze of size n × m. Each cell of the maze is either empty or occupied by an obstacle. The Robot can move between neighboring cells on the side left (the symbol "L"), right (the symbol "R"), up (the symbol "U") o... | instruction | 0 | 11,292 | 15 | 22,584 |
Tags: *special, dfs and similar, graphs, greedy, shortest paths
Correct Solution:
```
from queue import Queue
import sys
#sys.stdin = open('input.txt')
n, m, k = map(lambda x: int(x), input().split(' '))
if k&1:
print('IMPOSSIBLE')
sys.exit()
s = [None]*n
for i in range(n):
s[i] = [None]*m
t = input()
for ... | output | 1 | 11,292 | 15 | 22,585 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Robot is in a rectangular maze of size n × m. Each cell of the maze is either empty or occupied by an obstacle. The Robot can move between neighboring cells on the side left (the symbol "L"), right (the symbol "R"), up (the symbol "U") o... | instruction | 0 | 11,293 | 15 | 22,586 |
Tags: *special, dfs and similar, graphs, greedy, shortest paths
Correct Solution:
```
#https://codeforces.com/contest/769/problem/C
import collections
lis = input().split()
n,m,k = int(lis[0]),int(lis[1]),int(lis[2])
empty = [[False for i in range(m)] for j in range(n)]
mainrow,maincol = 0,0
for i in range(n):
s = inp... | output | 1 | 11,293 | 15 | 22,587 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Robot is in a rectangular maze of size n × m. Each cell of the maze is either empty or occupied by an obstacle. The Robot can move between neighboring cells on the side left (the symbol "L")... | instruction | 0 | 11,294 | 15 | 22,588 |
No | output | 1 | 11,294 | 15 | 22,589 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Robot is in a rectangular maze of size n × m. Each cell of the maze is either empty or occupied by an obstacle. The Robot can move between neighboring cells on the side left (the symbol "L")... | instruction | 0 | 11,295 | 15 | 22,590 |
No | output | 1 | 11,295 | 15 | 22,591 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Robot is in a rectangular maze of size n × m. Each cell of the maze is either empty or occupied by an obstacle. The Robot can move between neighboring cells on the side left (the symbol "L")... | instruction | 0 | 11,296 | 15 | 22,592 |
No | output | 1 | 11,296 | 15 | 22,593 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Robot is in a rectangular maze of size n × m. Each cell of the maze is either empty or occupied by an obstacle. The Robot can move between neighboring cells on the side left (the symbol "L")... | instruction | 0 | 11,297 | 15 | 22,594 |
No | output | 1 | 11,297 | 15 | 22,595 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We have a square grid with N rows and M columns. Takahashi will write an integer in each of the squares, as follows:
* First, write 0 in every square.
* For each i=1,2,...,N, choose an integer ... | instruction | 0 | 12,332 | 15 | 24,664 |
No | output | 1 | 12,332 | 15 | 24,665 |
Provide a correct Python 3 solution for this coding contest problem.
There is a grid of square cells with H horizontal rows and W vertical columns. The cell at the i-th row and the j-th column will be denoted as Cell (i, j).
In Cell (i, j), a_{ij} coins are placed.
You can perform the following operation any number ... | instruction | 0 | 12,333 | 15 | 24,666 |
"Correct Solution:
```
h,w = map(int,input().split())
lst = [list(map(int,input().split())) for _ in range(h)]
cnt = 0
ans = []
for i in range(h):
for j in range(w-1):
if lst[i][j] %2 == 1:
lst[i][j] -= 1
lst[i][j+1] += 1
ans.append([i+1,j+1,i+1,j+2])
for i in range(h-... | output | 1 | 12,333 | 15 | 24,667 |
Provide a correct Python 3 solution for this coding contest problem.
There is a grid of square cells with H horizontal rows and W vertical columns. The cell at the i-th row and the j-th column will be denoted as Cell (i, j).
In Cell (i, j), a_{ij} coins are placed.
You can perform the following operation any number ... | instruction | 0 | 12,334 | 15 | 24,668 |
"Correct Solution:
```
h, w = map(int, input().split())
A = [[int(i) for i in input().split()] for i in range(h)]
B = []
count = 0
for i in range(h):
for j in range(w-1):
if A[i][j] % 2 == 1:
count += 1
A[i][j+1] += 1
B.append([i+1, j+1, i+1, j+2])
for i in ... | output | 1 | 12,334 | 15 | 24,669 |
Provide a correct Python 3 solution for this coding contest problem.
There is a grid of square cells with H horizontal rows and W vertical columns. The cell at the i-th row and the j-th column will be denoted as Cell (i, j).
In Cell (i, j), a_{ij} coins are placed.
You can perform the following operation any number ... | instruction | 0 | 12,335 | 15 | 24,670 |
"Correct Solution:
```
def f(i,w):
p = i%w
q = i//w
if q%2 == 1:
p = w-1-p
return [q,p]
h,w = map(int,input().split())
a = [[]]*h
for i in range(h):
a[i] = list(map(int,input().split()))
k = 0
s = []
for i in range(h*w-1):
if a[f(i,w)[0]][f(i,w)[1]]%2 == 1:
k = 1-k
if k == 1:
s += [f(i,w)[0... | output | 1 | 12,335 | 15 | 24,671 |
Provide a correct Python 3 solution for this coding contest problem.
There is a grid of square cells with H horizontal rows and W vertical columns. The cell at the i-th row and the j-th column will be denoted as Cell (i, j).
In Cell (i, j), a_{ij} coins are placed.
You can perform the following operation any number ... | instruction | 0 | 12,336 | 15 | 24,672 |
"Correct Solution:
```
H,W = (int(i) for i in input().split())
a = [[int(i) for i in input().split()] for i in range(H)]
ans = []
ans_list = []
for h in range(H):
for w in range(W):
if w!=W-1:
if a[h][w]%2==1:
a[h][w+1]+=1
ans.append([h+1,w+1,h+1,w+2])
else:
if a[h][w]%2==1 and h!=H-1:
a[h+1... | output | 1 | 12,336 | 15 | 24,673 |
Provide a correct Python 3 solution for this coding contest problem.
There is a grid of square cells with H horizontal rows and W vertical columns. The cell at the i-th row and the j-th column will be denoted as Cell (i, j).
In Cell (i, j), a_{ij} coins are placed.
You can perform the following operation any number ... | instruction | 0 | 12,337 | 15 | 24,674 |
"Correct Solution:
```
H,W=[int(i) for i in input().split()]
a = [[int(i) for i in input().split()] for j in range(H)]
res = []
for h in range(H):
for w in range(W-1):
if a[h][w] % 2 is not 0:
res += ["{0} {1} {2} {3}".format(h+1,w+1,h+1,w+2)]
a[h][w+1] += 1
for h in range(H-1):
... | output | 1 | 12,337 | 15 | 24,675 |
Provide a correct Python 3 solution for this coding contest problem.
There is a grid of square cells with H horizontal rows and W vertical columns. The cell at the i-th row and the j-th column will be denoted as Cell (i, j).
In Cell (i, j), a_{ij} coins are placed.
You can perform the following operation any number ... | instruction | 0 | 12,338 | 15 | 24,676 |
"Correct Solution:
```
H,W=map(int,input().split())
a=[list(map(int,input().split())) for i in range(H)]
A=[]
for y in range(H):
for x in range(W):
if y%2==0:
A.append([y,x,a[y][x]])
else:
A.append([y,W-1-x,a[y][W-1-x]])
OUTPUT=[]
for i in range(H*W-1):
if A[i][2]%2==1:
OUTPUT.append((A[i][0]+1,A[i][1]+1,... | output | 1 | 12,338 | 15 | 24,677 |
Provide a correct Python 3 solution for this coding contest problem.
There is a grid of square cells with H horizontal rows and W vertical columns. The cell at the i-th row and the j-th column will be denoted as Cell (i, j).
In Cell (i, j), a_{ij} coins are placed.
You can perform the following operation any number ... | instruction | 0 | 12,339 | 15 | 24,678 |
"Correct Solution:
```
h, w = list(map(int, input().split()))
a = [list(map(int, input().split())) for i in range(h)]
ans = []
for i in range(h):
for j in range(w):
if i==h-1 and j==w-1:
pass
elif j==w-1 and a[i][j]%2==1:
a[i+1][j] += 1
ans.append((i+1, j+1, i+2, j+1))
elif a[i][j]%2==1:... | output | 1 | 12,339 | 15 | 24,679 |
Provide a correct Python 3 solution for this coding contest problem.
There is a grid of square cells with H horizontal rows and W vertical columns. The cell at the i-th row and the j-th column will be denoted as Cell (i, j).
In Cell (i, j), a_{ij} coins are placed.
You can perform the following operation any number ... | instruction | 0 | 12,340 | 15 | 24,680 |
"Correct Solution:
```
H, W = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(H)]
cnt = 0
path = []
for h in range(H):
for w in range(W-1):
if A[h][w]%2:
A[h][w+1] += 1
cnt += 1
path.append((h+1, w+1, h+1, w+2))
for h in range(H-1):
i... | output | 1 | 12,340 | 15 | 24,681 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a grid of square cells with H horizontal rows and W vertical columns. The cell at the i-th row and the j-th column will be denoted as Cell (i, j).
In Cell (i, j), a_{ij} coins are plac... | instruction | 0 | 12,341 | 15 | 24,682 |
Yes | output | 1 | 12,341 | 15 | 24,683 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a grid of square cells with H horizontal rows and W vertical columns. The cell at the i-th row and the j-th column will be denoted as Cell (i, j).
In Cell (i, j), a_{ij} coins are plac... | instruction | 0 | 12,342 | 15 | 24,684 |
Yes | output | 1 | 12,342 | 15 | 24,685 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a grid of square cells with H horizontal rows and W vertical columns. The cell at the i-th row and the j-th column will be denoted as Cell (i, j).
In Cell (i, j), a_{ij} coins are plac... | instruction | 0 | 12,343 | 15 | 24,686 |
Yes | output | 1 | 12,343 | 15 | 24,687 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a grid of square cells with H horizontal rows and W vertical columns. The cell at the i-th row and the j-th column will be denoted as Cell (i, j).
In Cell (i, j), a_{ij} coins are plac... | instruction | 0 | 12,344 | 15 | 24,688 |
Yes | output | 1 | 12,344 | 15 | 24,689 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a grid of square cells with H horizontal rows and W vertical columns. The cell at the i-th row and the j-th column will be denoted as Cell (i, j).
In Cell (i, j), a_{ij} coins are plac... | instruction | 0 | 12,345 | 15 | 24,690 |
No | output | 1 | 12,345 | 15 | 24,691 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a grid of square cells with H horizontal rows and W vertical columns. The cell at the i-th row and the j-th column will be denoted as Cell (i, j).
In Cell (i, j), a_{ij} coins are plac... | instruction | 0 | 12,346 | 15 | 24,692 |
No | output | 1 | 12,346 | 15 | 24,693 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a grid of square cells with H horizontal rows and W vertical columns. The cell at the i-th row and the j-th column will be denoted as Cell (i, j).
In Cell (i, j), a_{ij} coins are plac... | instruction | 0 | 12,347 | 15 | 24,694 |
No | output | 1 | 12,347 | 15 | 24,695 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a grid of square cells with H horizontal rows and W vertical columns. The cell at the i-th row and the j-th column will be denoted as Cell (i, j).
In Cell (i, j), a_{ij} coins are plac... | instruction | 0 | 12,348 | 15 | 24,696 |
No | output | 1 | 12,348 | 15 | 24,697 |
Provide a correct Python 3 solution for this coding contest problem.
There are N squares in a row. The squares are numbered 1, 2, ..., N from left to right.
You have two pieces, initially placed on square A and B, respectively. You will be asked to process Q queries of the following kind, in the order received:
* Gi... | instruction | 0 | 12,381 | 15 | 24,762 |
"Correct Solution:
```
import sys
read = sys.stdin.buffer.read
INF = 10**12
class Rmin():
def __init__(self, size):
#the number of nodes is 2n-1
self.n = 1 << (size.bit_length())
self.node = [INF] * (2*self.n-1)
def Access(self, x):
return self.node[x+self.n-1]
def Update(self, x, val):
x += self.n-1
... | output | 1 | 12,381 | 15 | 24,763 |
Provide a correct Python 3 solution for this coding contest problem.
There are N squares in a row. The squares are numbered 1, 2, ..., N from left to right.
You have two pieces, initially placed on square A and B, respectively. You will be asked to process Q queries of the following kind, in the order received:
* Gi... | instruction | 0 | 12,382 | 15 | 24,764 |
"Correct Solution:
```
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N,Q,A,B,*X = map(int,read().split())
class MinSegTree():
def __init__(self,N):
self.Nelem = N
self.size = 1<<(N.bit_length()) # 葉の要素数
def build(se... | output | 1 | 12,382 | 15 | 24,765 |
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. The squares are numbered 1, 2, ..., N from left to right.
You have two pieces, initially placed on square A and B, respectively. You will be asked to process Q que... | instruction | 0 | 12,383 | 15 | 24,766 |
No | output | 1 | 12,383 | 15 | 24,767 |
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. The squares are numbered 1, 2, ..., N from left to right.
You have two pieces, initially placed on square A and B, respectively. You will be asked to process Q que... | instruction | 0 | 12,384 | 15 | 24,768 |
No | output | 1 | 12,384 | 15 | 24,769 |
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. The squares are numbered 1, 2, ..., N from left to right.
You have two pieces, initially placed on square A and B, respectively. You will be asked to process Q que... | instruction | 0 | 12,385 | 15 | 24,770 |
No | output | 1 | 12,385 | 15 | 24,771 |
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. The squares are numbered 1, 2, ..., N from left to right.
You have two pieces, initially placed on square A and B, respectively. You will be asked to process Q que... | instruction | 0 | 12,386 | 15 | 24,772 |
No | output | 1 | 12,386 | 15 | 24,773 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We've got a rectangular n × m-cell maze. Each cell is either passable, or is a wall (impassable). A little boy found the maze and cyclically tiled a plane with it so that the plane became an inf... | instruction | 0 | 12,728 | 15 | 25,456 |
No | output | 1 | 12,728 | 15 | 25,457 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We've got a rectangular n × m-cell maze. Each cell is either passable, or is a wall (impassable). A little boy found the maze and cyclically tiled a plane with it so that the plane became an inf... | instruction | 0 | 12,729 | 15 | 25,458 |
No | output | 1 | 12,729 | 15 | 25,459 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We've got a rectangular n × m-cell maze. Each cell is either passable, or is a wall (impassable). A little boy found the maze and cyclically tiled a plane with it so that the plane became an inf... | instruction | 0 | 12,730 | 15 | 25,460 |
No | output | 1 | 12,730 | 15 | 25,461 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
We've got a rectangular n × m-cell maze. Each cell is either passable, or is a wall (impassable). A little boy found the maze and cyclically tiled a plane with it so that the plane became an inf... | instruction | 0 | 12,731 | 15 | 25,462 |
No | output | 1 | 12,731 | 15 | 25,463 |
Provide a correct Python 3 solution for this coding contest problem.
There are N squares arranged in a row from left to right.
The height of the i-th square from the left is H_i.
You will land on a square of your choice, then repeat moving to the adjacent square on the right as long as the height of the next square ... | instruction | 0 | 13,140 | 15 | 26,280 |
"Correct Solution:
```
n=int(input())
h=list(map(int,input().split()))
res=[]
t=0
for i in range(1,n):
if h[i]<=h[i-1]:
t+=1
else:
res.append(t)
t=0
res.append(t)
print(max(res))
``` | output | 1 | 13,140 | 15 | 26,281 |
Provide a correct Python 3 solution for this coding contest problem.
There are N squares arranged in a row from left to right.
The height of the i-th square from the left is H_i.
You will land on a square of your choice, then repeat moving to the adjacent square on the right as long as the height of the next square ... | instruction | 0 | 13,141 | 15 | 26,282 |
"Correct Solution:
```
n = int(input())
a = list(map(int,input().split()))
b=[]
x=0
for i in range(n-1):
if a[i]>=a[i+1]:
x+=1
else:
b.append(x)
x=0
b.append(x)
print(max(b))
``` | output | 1 | 13,141 | 15 | 26,283 |
Provide a correct Python 3 solution for this coding contest problem.
There are N squares arranged in a row from left to right.
The height of the i-th square from the left is H_i.
You will land on a square of your choice, then repeat moving to the adjacent square on the right as long as the height of the next square ... | instruction | 0 | 13,142 | 15 | 26,284 |
"Correct Solution:
```
n=int(input())
h=list(map(int,input().split()))
l=[0]*n
for i in range(1,n):
if h[i]<=h[i-1]:
l[i]=1+l[i-1]
print(max(l))
``` | output | 1 | 13,142 | 15 | 26,285 |
Provide a correct Python 3 solution for this coding contest problem.
There are N squares arranged in a row from left to right.
The height of the i-th square from the left is H_i.
You will land on a square of your choice, then repeat moving to the adjacent square on the right as long as the height of the next square ... | instruction | 0 | 13,143 | 15 | 26,286 |
"Correct Solution:
```
N = int(input())
H = [int(_) for _ in input().split()]
num = [0] * N
for i in range(N-2, -1, -1):
if H[i] >= H[i+1]:
num[i] = num[i+1]+1
print(max(num))
``` | output | 1 | 13,143 | 15 | 26,287 |
Provide a correct Python 3 solution for this coding contest problem.
There are N squares arranged in a row from left to right.
The height of the i-th square from the left is H_i.
You will land on a square of your choice, then repeat moving to the adjacent square on the right as long as the height of the next square ... | instruction | 0 | 13,144 | 15 | 26,288 |
"Correct Solution:
```
N = int(input())
H = list(map(int,input().split()))
a =[0]*(N+1)
for i in range(N-1,0,-1):
if H[i]<=H[i-1]:
a[i] = a[i+1]+1
print(max(a))
``` | output | 1 | 13,144 | 15 | 26,289 |
Provide a correct Python 3 solution for this coding contest problem.
There are N squares arranged in a row from left to right.
The height of the i-th square from the left is H_i.
You will land on a square of your choice, then repeat moving to the adjacent square on the right as long as the height of the next square ... | instruction | 0 | 13,145 | 15 | 26,290 |
"Correct Solution:
```
n,a=input(),list(map(int,input().split()))
ans,now,cnt=0,10**20,0
for i in a:
if i>now:
cnt=0
cnt+=1
now=i
ans=max(ans,cnt)
print(ans-1)
``` | output | 1 | 13,145 | 15 | 26,291 |
Provide a correct Python 3 solution for this coding contest problem.
There are N squares arranged in a row from left to right.
The height of the i-th square from the left is H_i.
You will land on a square of your choice, then repeat moving to the adjacent square on the right as long as the height of the next square ... | instruction | 0 | 13,146 | 15 | 26,292 |
"Correct Solution:
```
n=int(input())
a=[int(i) for i in input().split()]
m=0
c=0
for i in range(n-1):
if a[i]>=a[i+1]:
c+=1
else:
c=0
if c>m:
m=c
print(m)
``` | output | 1 | 13,146 | 15 | 26,293 |
Provide a correct Python 3 solution for this coding contest problem.
There are N squares arranged in a row from left to right.
The height of the i-th square from the left is H_i.
You will land on a square of your choice, then repeat moving to the adjacent square on the right as long as the height of the next square ... | instruction | 0 | 13,147 | 15 | 26,294 |
"Correct Solution:
```
N=int(input())
H=list(map(int,input().split()))
a=b=c=0
for i in range(N):
if H[i]<=a:
a=H[i]
b+=1
if b>=c:
c=b
else:
a=H[i]
b=0
print(c)
``` | output | 1 | 13,147 | 15 | 26,295 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N squares arranged in a row from left to right.
The height of the i-th square from the left is H_i.
You will land on a square of your choice, then repeat moving to the adjacent squar... | instruction | 0 | 13,148 | 15 | 26,296 |
Yes | output | 1 | 13,148 | 15 | 26,297 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.