message stringlengths 2 433k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 113 108k | cluster float64 12 12 | __index_level_0__ int64 226 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
Ivan has an array consisting of n elements. Each of the elements is an integer from 1 to n.
Recently Ivan learned about permutations and their lexicographical order. Now he wants to change (replace) minimum number of elements in his array i... | instruction | 0 | 82,273 | 12 | 164,546 |
Tags: greedy, implementation, math
Correct Solution:
```
import math
import sys
from collections import deque
import heapq
import time
input = sys.stdin.readline
mod=10**9+7
############ ---- Input Functions ---- ############
def inp():
return(int(input()))
def inlt():
return(list(map(int,input().split())))
def... | output | 1 | 82,273 | 12 | 164,547 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Ivan has an array consisting of n elements. Each of the elements is an integer from 1 to n.
Recently Ivan learned about permutations and their lexicographical order. Now he wants to change (replace) minimum number of elements in his array i... | instruction | 0 | 82,274 | 12 | 164,548 |
Tags: greedy, implementation, math
Correct Solution:
```
from collections import Counter
n = int(input())
a = list(map(int,input().split()))
c = Counter(a)
b=dict()
for i in c.keys():
b[i]=0
d = list(sorted((Counter(range(1,n+1))-c).keys()))
r = n-len(c)
j=0
print(r)
for i in range(n):
if j==r:
break
if c[a[i... | output | 1 | 82,274 | 12 | 164,549 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ivan has an array consisting of n elements. Each of the elements is an integer from 1 to n.
Recently Ivan learned about permutations and their lexicographical order. Now he wants to change (rep... | instruction | 0 | 82,275 | 12 | 164,550 |
Yes | output | 1 | 82,275 | 12 | 164,551 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ivan has an array consisting of n elements. Each of the elements is an integer from 1 to n.
Recently Ivan learned about permutations and their lexicographical order. Now he wants to change (rep... | instruction | 0 | 82,276 | 12 | 164,552 |
Yes | output | 1 | 82,276 | 12 | 164,553 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ivan has an array consisting of n elements. Each of the elements is an integer from 1 to n.
Recently Ivan learned about permutations and their lexicographical order. Now he wants to change (rep... | instruction | 0 | 82,277 | 12 | 164,554 |
Yes | output | 1 | 82,277 | 12 | 164,555 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ivan has an array consisting of n elements. Each of the elements is an integer from 1 to n.
Recently Ivan learned about permutations and their lexicographical order. Now he wants to change (rep... | instruction | 0 | 82,278 | 12 | 164,556 |
Yes | output | 1 | 82,278 | 12 | 164,557 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ivan has an array consisting of n elements. Each of the elements is an integer from 1 to n.
Recently Ivan learned about permutations and their lexicographical order. Now he wants to change (rep... | instruction | 0 | 82,279 | 12 | 164,558 |
No | output | 1 | 82,279 | 12 | 164,559 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ivan has an array consisting of n elements. Each of the elements is an integer from 1 to n.
Recently Ivan learned about permutations and their lexicographical order. Now he wants to change (rep... | instruction | 0 | 82,280 | 12 | 164,560 |
No | output | 1 | 82,280 | 12 | 164,561 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ivan has an array consisting of n elements. Each of the elements is an integer from 1 to n.
Recently Ivan learned about permutations and their lexicographical order. Now he wants to change (rep... | instruction | 0 | 82,281 | 12 | 164,562 |
No | output | 1 | 82,281 | 12 | 164,563 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ivan has an array consisting of n elements. Each of the elements is an integer from 1 to n.
Recently Ivan learned about permutations and their lexicographical order. Now he wants to change (rep... | instruction | 0 | 82,282 | 12 | 164,564 |
No | output | 1 | 82,282 | 12 | 164,565 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Two integer sequences existed initially, one of them was strictly increasing, and another one — strictly decreasing.
Strictly increasing sequence is a sequence of integers [x_1 < x_2 < ... < x_k]. And strictly decreasing sequence is a seque... | instruction | 0 | 82,645 | 12 | 165,290 |
Tags: dp, greedy
Correct Solution:
```
#!/usr/bin/env python
n, a = int(input()), list(map(int, input().split())) + [0, ]
ans, inc, dec = [0] * n, -1, 1e7
for i in range(n):
if inc < a[i] < dec:
if a[i] < a[i + 1]:
inc = a[i]
else:
dec = a[i]
ans[i] = 1
elif inc < a[i]:
inc = a[i]
elif dec > a[i]:
... | output | 1 | 82,645 | 12 | 165,291 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Two integer sequences existed initially, one of them was strictly increasing, and another one — strictly decreasing.
Strictly increasing sequence is a sequence of integers [x_1 < x_2 < ... < x_k]. And strictly decreasing sequence is a seque... | instruction | 0 | 82,646 | 12 | 165,292 |
Tags: dp, greedy
Correct Solution:
```
n = int(input())
a = list(map(int, input().split()))
inf = 10 ** 6
inc = [inf for i in range(0, n + 1)]
dec = [-inf for i in range(0, n + 1)]
trinc = [-1 for i in range(0, n + 1)]
trdec = [-1 for i in range(0, n + 1)]
inc[0] = -inf
dec[0] = inf
#inc means last dec was in i and we ... | output | 1 | 82,646 | 12 | 165,293 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Two integer sequences existed initially, one of them was strictly increasing, and another one — strictly decreasing.
Strictly increasing sequence is a sequence of integers [x_1 < x_2 < ... < x_k]. And strictly decreasing sequence is a seque... | instruction | 0 | 82,647 | 12 | 165,294 |
Tags: dp, greedy
Correct Solution:
```
n = int(input())
a = list(map(int, input().split())) + [0]
answer = [0] * n
current_increase_max = -1
current_decrease_min = 1e6
for i in range(n):
if current_increase_max < a[i] and a[i] < current_decrease_min:
if a[i] < a[i + 1]:
current_increase_max = ... | output | 1 | 82,647 | 12 | 165,295 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Two integer sequences existed initially, one of them was strictly increasing, and another one — strictly decreasing.
Strictly increasing sequence is a sequence of integers [x_1 < x_2 < ... < x_k]. And strictly decreasing sequence is a seque... | instruction | 0 | 82,648 | 12 | 165,296 |
Tags: dp, greedy
Correct Solution:
```
n, a = int(input()), [int(i) for i in input().split()] + [0]
ans, inc, dec = [0 for _ in range(n)], -1,float('inf')
for i in range(n):
if inc < a[i] < dec:
if a[i] < a[i+1]:
inc = a[i]
else:
dec = a[i]
ans[i] = 1
elif inc... | output | 1 | 82,648 | 12 | 165,297 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Two integer sequences existed initially, one of them was strictly increasing, and another one — strictly decreasing.
Strictly increasing sequence is a sequence of integers [x_1 < x_2 < ... < x_k]. And strictly decreasing sequence is a seque... | instruction | 0 | 82,649 | 12 | 165,298 |
Tags: dp, greedy
Correct Solution:
```
def main():
n = int(input())
a = list(map(int, input().split()))
result = [0] * n
last_increasing = -1
last_decreasing = 200001
for i, x in enumerate(a):
if i == n - 1:
if x < last_decreasing:
result[i] = 1
e... | output | 1 | 82,649 | 12 | 165,299 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Two integer sequences existed initially, one of them was strictly increasing, and another one — strictly decreasing.
Strictly increasing sequence is a sequence of integers [x_1 < x_2 < ... < x_k]. And strictly decreasing sequence is a seque... | instruction | 0 | 82,650 | 12 | 165,300 |
Tags: dp, greedy
Correct Solution:
```
from collections import defaultdict as dd
import math
def nn():
return int(input())
def li():
return list(input())
def mi():
return map(int, input().split())
def lm():
return list(map(int, input().split()))
def getanswers():
n=nn()
seq=lm()
lower=None
upper=None
an... | output | 1 | 82,650 | 12 | 165,301 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Two integer sequences existed initially, one of them was strictly increasing, and another one — strictly decreasing.
Strictly increasing sequence is a sequence of integers [x_1 < x_2 < ... < x_k]. And strictly decreasing sequence is a seque... | instruction | 0 | 82,651 | 12 | 165,302 |
Tags: dp, greedy
Correct Solution:
```
import math
def main():
n = int(input())
a = list(map(int, input().split()))
if n == 1:
print('YES')
print(0)
else:
res = [0] * n
ok = True
last_inc = -math.inf
last_dec = math.inf
for i in range(n):
... | output | 1 | 82,651 | 12 | 165,303 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Two integer sequences existed initially, one of them was strictly increasing, and another one — strictly decreasing.
Strictly increasing sequence is a sequence of integers [x_1 < x_2 < ... < x_k]. And strictly decreasing sequence is a seque... | instruction | 0 | 82,652 | 12 | 165,304 |
Tags: dp, greedy
Correct Solution:
```
n, a = int(input()), [int(ai) for ai in input().split()] + [0]
res, inc, dec = [0] * n, -1, 10**6
for i in range(n):
if inc < a[i] and a[i] < dec:
if a[i] < a[i + 1]:
inc = a[i]
else:
dec = a[i]
res[i] = 1
elif inc < a[i]... | output | 1 | 82,652 | 12 | 165,305 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Two integer sequences existed initially, one of them was strictly increasing, and another one — strictly decreasing.
Strictly increasing sequence is a sequence of integers [x_1 < x_2 < ... < x_... | instruction | 0 | 82,653 | 12 | 165,306 |
Yes | output | 1 | 82,653 | 12 | 165,307 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Two integer sequences existed initially, one of them was strictly increasing, and another one — strictly decreasing.
Strictly increasing sequence is a sequence of integers [x_1 < x_2 < ... < x_... | instruction | 0 | 82,654 | 12 | 165,308 |
Yes | output | 1 | 82,654 | 12 | 165,309 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Two integer sequences existed initially, one of them was strictly increasing, and another one — strictly decreasing.
Strictly increasing sequence is a sequence of integers [x_1 < x_2 < ... < x_... | instruction | 0 | 82,655 | 12 | 165,310 |
Yes | output | 1 | 82,655 | 12 | 165,311 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Two integer sequences existed initially, one of them was strictly increasing, and another one — strictly decreasing.
Strictly increasing sequence is a sequence of integers [x_1 < x_2 < ... < x_... | instruction | 0 | 82,656 | 12 | 165,312 |
No | output | 1 | 82,656 | 12 | 165,313 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Two integer sequences existed initially, one of them was strictly increasing, and another one — strictly decreasing.
Strictly increasing sequence is a sequence of integers [x_1 < x_2 < ... < x_... | instruction | 0 | 82,657 | 12 | 165,314 |
No | output | 1 | 82,657 | 12 | 165,315 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Two integer sequences existed initially, one of them was strictly increasing, and another one — strictly decreasing.
Strictly increasing sequence is a sequence of integers [x_1 < x_2 < ... < x_... | instruction | 0 | 82,658 | 12 | 165,316 |
No | output | 1 | 82,658 | 12 | 165,317 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Two integer sequences existed initially, one of them was strictly increasing, and another one — strictly decreasing.
Strictly increasing sequence is a sequence of integers [x_1 < x_2 < ... < x_... | instruction | 0 | 82,659 | 12 | 165,318 |
No | output | 1 | 82,659 | 12 | 165,319 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Petya very much likes arrays consisting of n integers, where each of them is in the range from 1 to 109, inclusive. Recently he has received one such array as a gift from his mother. Petya didn't like it at once. He decided to choose ... | instruction | 0 | 82,745 | 12 | 165,490 |
Tags: greedy, implementation, sortings
Correct Solution:
```
n = input()
li = list(map(int, input().split(" ")))
li.sort()
if li[-1] != 1: li.insert(0, 1)
else: li.insert(0, 2)
del li[-1]
li.sort()
print(" ".join(map(str, li)))
``` | output | 1 | 82,745 | 12 | 165,491 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Petya very much likes arrays consisting of n integers, where each of them is in the range from 1 to 109, inclusive. Recently he has received one such array as a gift from his mother. Petya didn't like it at once. He decided to choose ... | instruction | 0 | 82,746 | 12 | 165,492 |
Tags: greedy, implementation, sortings
Correct Solution:
```
def solve():
n=int(input())
l=[int(x) for x in input().split()]
if max(l)==1:
l[0]=2
l.sort()
for num in l:print(num,end=" ")
else:
l[l.index(max(l))]=1
l.sort()
for num in l:print(num,end=" ")
... | output | 1 | 82,746 | 12 | 165,493 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Petya very much likes arrays consisting of n integers, where each of them is in the range from 1 to 109, inclusive. Recently he has received one such array as a gift from his mother. Petya didn't like it at once. He decided to choose ... | instruction | 0 | 82,747 | 12 | 165,494 |
Tags: greedy, implementation, sortings
Correct Solution:
```
def solve(array):
if max(array) == 1:
return array[:-1] + [2]
array.sort()
return [1] + array[:-1]
if __name__ == "__main__":
n = int(input())
array = [int(x) for x in input().split()]
print(" ".join(map(str, solve(array))))... | output | 1 | 82,747 | 12 | 165,495 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Petya very much likes arrays consisting of n integers, where each of them is in the range from 1 to 109, inclusive. Recently he has received one such array as a gift from his mother. Petya didn't like it at once. He decided to choose ... | instruction | 0 | 82,748 | 12 | 165,496 |
Tags: greedy, implementation, sortings
Correct Solution:
```
n=int(input())
a=list(map(int,input().split()))
if(len(set(a))==1 and a[0]==1):
a[0]=2
a.sort()
print(" ".join(map(str,a)))
else:
a[a.index(max(a))]=1
a.sort()
print(" ".join(map(str,a)))
``` | output | 1 | 82,748 | 12 | 165,497 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Petya very much likes arrays consisting of n integers, where each of them is in the range from 1 to 109, inclusive. Recently he has received one such array as a gift from his mother. Petya didn't like it at once. He decided to choose ... | instruction | 0 | 82,749 | 12 | 165,498 |
Tags: greedy, implementation, sortings
Correct Solution:
```
#------------------------template--------------------------#
import os
import sys
from math import *
from collections import *
from fractions import *
from bisect import *
from heapq import*
from io import BytesIO, IOBase
def vsInput():
sys.stdin = open('... | output | 1 | 82,749 | 12 | 165,499 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Petya very much likes arrays consisting of n integers, where each of them is in the range from 1 to 109, inclusive. Recently he has received one such array as a gift from his mother. Petya didn't like it at once. He decided to choose ... | instruction | 0 | 82,750 | 12 | 165,500 |
Tags: greedy, implementation, sortings
Correct Solution:
```
from sys import stdin, stdout
n = int(input())
t = list(map(int, stdin.readline().split()))
t= sorted(t)
m = t[n-1]
t.pop(n-1)
i = 1
while i == m:
i+=1
t.insert(0, i)
t= sorted(t)
for u in t:
stdout.write(str(u)+" ")
``` | output | 1 | 82,750 | 12 | 165,501 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Petya very much likes arrays consisting of n integers, where each of them is in the range from 1 to 109, inclusive. Recently he has received one such array as a gift from his mother. Petya didn't like it at once. He decided to choose ... | instruction | 0 | 82,751 | 12 | 165,502 |
Tags: greedy, implementation, sortings
Correct Solution:
```
n=int(input())
l=list(map(int,input().split()))
if (len(l)==l.count(max(l)) and max(l)==1) or (len(l)==1 and l[0]==1):
l.remove(l[0])
l.append(2)
else:
l.remove(max(l))
if n!=1:
l.sort()
l=[1]+l
for i in l:
print(i,end=" ")
``... | output | 1 | 82,751 | 12 | 165,503 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Petya very much likes arrays consisting of n integers, where each of them is in the range from 1 to 109, inclusive. Recently he has received one such array as a gift from his mother. Petya didn't like it at once. He decided to choose ... | instruction | 0 | 82,752 | 12 | 165,504 |
Tags: greedy, implementation, sortings
Correct Solution:
```
def main():
n=int(input())
L=list(map(int,input().split()))
if max(L)==1:
L[L.index(max(L))]=2
else:
L[L.index(max(L))]=1
L.sort()
print(' '.join(map(str, L)))
main()
``` | output | 1 | 82,752 | 12 | 165,505 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Petya very much likes arrays consisting of n integers, where each of them is in the range from 1 to 109, inclusive. Recently he has received one such array as a gift from his mother. Pety... | instruction | 0 | 82,753 | 12 | 165,506 |
Yes | output | 1 | 82,753 | 12 | 165,507 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Petya very much likes arrays consisting of n integers, where each of them is in the range from 1 to 109, inclusive. Recently he has received one such array as a gift from his mother. Pety... | instruction | 0 | 82,754 | 12 | 165,508 |
Yes | output | 1 | 82,754 | 12 | 165,509 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Petya very much likes arrays consisting of n integers, where each of them is in the range from 1 to 109, inclusive. Recently he has received one such array as a gift from his mother. Pety... | instruction | 0 | 82,755 | 12 | 165,510 |
Yes | output | 1 | 82,755 | 12 | 165,511 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Petya very much likes arrays consisting of n integers, where each of them is in the range from 1 to 109, inclusive. Recently he has received one such array as a gift from his mother. Pety... | instruction | 0 | 82,756 | 12 | 165,512 |
Yes | output | 1 | 82,756 | 12 | 165,513 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Petya very much likes arrays consisting of n integers, where each of them is in the range from 1 to 109, inclusive. Recently he has received one such array as a gift from his mother. Pety... | instruction | 0 | 82,757 | 12 | 165,514 |
No | output | 1 | 82,757 | 12 | 165,515 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Petya very much likes arrays consisting of n integers, where each of them is in the range from 1 to 109, inclusive. Recently he has received one such array as a gift from his mother. Pety... | instruction | 0 | 82,758 | 12 | 165,516 |
No | output | 1 | 82,758 | 12 | 165,517 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Petya very much likes arrays consisting of n integers, where each of them is in the range from 1 to 109, inclusive. Recently he has received one such array as a gift from his mother. Pety... | instruction | 0 | 82,759 | 12 | 165,518 |
No | output | 1 | 82,759 | 12 | 165,519 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Petya very much likes arrays consisting of n integers, where each of them is in the range from 1 to 109, inclusive. Recently he has received one such array as a gift from his mother. Pety... | instruction | 0 | 82,760 | 12 | 165,520 |
No | output | 1 | 82,760 | 12 | 165,521 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a square matrix of size n. Every row and every column of this matrix is a permutation of 1, 2, …, n. Let a_{i, j} be the element at the intersection of i-th row and j-th column for every 1 ≤ i, j ≤ n. Rows are numbered 1, …, n ... | instruction | 0 | 82,793 | 12 | 165,586 |
Tags: math, matrices
Correct Solution:
```
import sys,io,os;input=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
t = int(input())
out = []
for _ in range(t):
n, m = map(int, input().split())
MAT = [list(map(int, input().split())) for i in range(n)]
dx = 0
dy = 0
order = [0,1,2]
d = [0,... | output | 1 | 82,793 | 12 | 165,587 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a square matrix of size n. Every row and every column of this matrix is a permutation of 1, 2, …, n. Let a_{i, j} be the element at the intersection of i-th row and j-th column for every 1 ≤ i, j ≤ n. Rows are numbered 1, …, n ... | instruction | 0 | 82,794 | 12 | 165,588 |
Tags: math, matrices
Correct Solution:
```
import sys,io,os
Z=io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
Y=lambda:[*map(int,Z().split())]
def I(M):
n=len(M)
nM=[[0]*n for i in range(n)]
for x in range(n):
for y in range(n):
nM[x][M[x][y]-1]=y+1
return nM
def C(M):
n=len(... | output | 1 | 82,794 | 12 | 165,589 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a square matrix of size n. Every row and every column of this matrix is a permutation of 1, 2, …, n. Let a_{i, j} be the element at the intersection of i-th row and j-th column for every 1 ≤ i, j ≤ n. Rows are numbered 1, …, n ... | instruction | 0 | 82,795 | 12 | 165,590 |
Tags: math, matrices
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
# region fastio
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r" not ... | output | 1 | 82,795 | 12 | 165,591 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a square matrix of size n. Every row and every column of this matrix is a permutation of 1, 2, …, n. Let a_{i, j} be the element at the intersection of i-th row and j-th column for... | instruction | 0 | 82,796 | 12 | 165,592 |
No | output | 1 | 82,796 | 12 | 165,593 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a square matrix of size n. Every row and every column of this matrix is a permutation of 1, 2, …, n. Let a_{i, j} be the element at the intersection of i-th row and j-th column for... | instruction | 0 | 82,797 | 12 | 165,594 |
No | output | 1 | 82,797 | 12 | 165,595 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a square matrix of size n. Every row and every column of this matrix is a permutation of 1, 2, …, n. Let a_{i, j} be the element at the intersection of i-th row and j-th column for... | instruction | 0 | 82,798 | 12 | 165,596 |
No | output | 1 | 82,798 | 12 | 165,597 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a square matrix of size n. Every row and every column of this matrix is a permutation of 1, 2, …, n. Let a_{i, j} be the element at the intersection of i-th row and j-th column for... | instruction | 0 | 82,799 | 12 | 165,598 |
No | output | 1 | 82,799 | 12 | 165,599 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an interactive problem.
Note: the XOR-sum of an array a_1, a_2, …, a_n (1 ≤ a_i ≤ 10^9) is defined as a_1 ⊕ a_2 ⊕ … ⊕ a_n, where ⊕ denotes the [bitwise XOR operation](https://en.wikipedia.org/wiki/Bitwise_operation#XOR).
Little Dor... | instruction | 0 | 82,819 | 12 | 165,638 |
Tags: brute force, constructive algorithms, dp, flows, graphs, greedy, implementation, interactive, shortest paths
Correct Solution:
```
from collections import deque, defaultdict
from sys import stdout
def searchPath(n, k):
def getNexts(curr):
lb = max(k - curr, curr - k)
ub = min(n - max(0, k + c... | output | 1 | 82,819 | 12 | 165,639 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is an interactive problem.
Note: the XOR-sum of an array a_1, a_2, …, a_n (1 ≤ a_i ≤ 10^9) is defined as a_1 ⊕ a_2 ⊕ … ⊕ a_n, where ⊕ denotes the [bitwise XOR operation](https://en.wikipedia.org/wiki/Bitwise_operation#XOR).
Little Dor... | instruction | 0 | 82,820 | 12 | 165,640 |
Tags: brute force, constructive algorithms, dp, flows, graphs, greedy, implementation, interactive, shortest paths
Correct Solution:
```
from time import time
t0 = time()
from heapq import heappop, heappush, heapify
import sys
input = lambda: sys.stdin.readline().rstrip("\r\n")
N, K = map(int, input().split())
Table... | output | 1 | 82,820 | 12 | 165,641 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.