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.
You are given a non-decreasing array of non-negative integers a_1, a_2, …, a_n. Also you are given a positive integer k.
You want to find m non-decreasing arrays of non-negative integers b_1, b_2, …, b_m, such that:
* The size of b_i is ... | instruction | 0 | 104,622 | 12 | 209,244 |
Tags: constructive algorithms, greedy, math
Correct Solution:
```
# ---------------------------iye ha aam zindegi---------------------------------------------
import math
import random
import heapq, bisect
import sys
from collections import deque, defaultdict
from fractions import Fraction
import sys
import threading
f... | output | 1 | 104,622 | 12 | 209,245 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a non-decreasing array of non-negative integers a_1, a_2, …, a_n. Also you are given a positive integer k.
You want to find m non-decreasing arrays of non-negative integers b_1, b_2, …, b_m, such that:
* The size of b_i is ... | instruction | 0 | 104,623 | 12 | 209,246 |
Tags: constructive algorithms, greedy, math
Correct Solution:
```
import io, os
input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline
from math import ceil
t = int(input())
for _ in range(t):
n, k = map(int, input().split())
a = list(map(int, input().split()))
if len(set(a)) <= k:
prin... | output | 1 | 104,623 | 12 | 209,247 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a non-decreasing array of non-negative integers a_1, a_2, …, a_n. Also you are given a positive integer k.
You want to find m non-decreasing arrays of non-negative integers b_1, b_2, …, b_m, such that:
* The size of b_i is ... | instruction | 0 | 104,624 | 12 | 209,248 |
Tags: constructive algorithms, greedy, math
Correct Solution:
```
import math
from sys import stdin
from sys import setrecursionlimit
setrecursionlimit(100000)
def put(): return map(int, stdin.readline().split())
for _ in range(int(input())):
# n=int(input())
n,k=put()
l=(list(put()))
if(len(set(l))<=k):
print(... | output | 1 | 104,624 | 12 | 209,249 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a non-decreasing array of non-negative integers a_1, a_2, …, a_n. Also you are given a positive integer k.
You want to find m non-decreasing arrays of non-negative integers b_1, b_2, …, b_m, such that:
* The size of b_i is ... | instruction | 0 | 104,625 | 12 | 209,250 |
Tags: constructive algorithms, greedy, math
Correct Solution:
```
from math import ceil
t = int(input())
for _ in range(t):
n, k = map(int, input().split())
A = set(map(int, input().split()))
uniq = len(A)
if k == 1:
if uniq == 1:
print(1)
else:
print(-1)
e... | output | 1 | 104,625 | 12 | 209,251 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a non-decreasing array of non-negative integers a_1, a_2, …, a_n. Also you are given a positive integer k.
You want to find m non-decreasing arrays of non-negative integers b_1, b_2, …, b_m, such that:
* The size of b_i is ... | instruction | 0 | 104,626 | 12 | 209,252 |
Tags: constructive algorithms, greedy, math
Correct Solution:
```
import math
for _ in range(int(input())):
n, k = map(int, input().split())
a = list(map(int, input().split()))
if k == 1:
if len(set(a)) == 1:
print(1)
else:
print(-1)
continue
count = 0... | output | 1 | 104,626 | 12 | 209,253 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a non-decreasing array of non-negative integers a_1, a_2, …, a_n. Also you are given a positive integer k.
You want to find m non-decreasing arrays of non-negative integers b_1, b_2, …, b_m, such that:
* The size of b_i is ... | instruction | 0 | 104,627 | 12 | 209,254 |
Tags: constructive algorithms, greedy, math
Correct Solution:
```
from sys import stdin,stdout
import math,bisect
from collections import Counter,deque,defaultdict
L=lambda:list(map(int, stdin.readline().strip().split()))
M=lambda:map(int, stdin.readline().strip().split())
I=lambda:int(stdin.readline().strip())
S=lambd... | output | 1 | 104,627 | 12 | 209,255 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a non-decreasing array of non-negative integers a_1, a_2, …, a_n. Also you are given a positive integer k.
You want to find m non-decreasing arrays of non-negative integers b_1, b_2, …, b_m, such that:
* The size of b_i is ... | instruction | 0 | 104,628 | 12 | 209,256 |
Tags: constructive algorithms, greedy, math
Correct Solution:
```
for _ in range(int(input())):
n,k = map(int,input().split(' '))
ans = 0
arr = [int(num) for num in input().split(' ')]
if k==1 and len(set(arr))!=1:
ans = -1
elif arr[0]==0 and len(set(arr))==1:
ans = 1
el... | output | 1 | 104,628 | 12 | 209,257 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a non-decreasing array of non-negative integers a_1, a_2, …, a_n. Also you are given a positive integer k.
You want to find m non-decreasing arrays of non-negative integers b_1, b... | instruction | 0 | 104,629 | 12 | 209,258 |
Yes | output | 1 | 104,629 | 12 | 209,259 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a non-decreasing array of non-negative integers a_1, a_2, …, a_n. Also you are given a positive integer k.
You want to find m non-decreasing arrays of non-negative integers b_1, b... | instruction | 0 | 104,630 | 12 | 209,260 |
Yes | output | 1 | 104,630 | 12 | 209,261 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a non-decreasing array of non-negative integers a_1, a_2, …, a_n. Also you are given a positive integer k.
You want to find m non-decreasing arrays of non-negative integers b_1, b... | instruction | 0 | 104,631 | 12 | 209,262 |
Yes | output | 1 | 104,631 | 12 | 209,263 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a non-decreasing array of non-negative integers a_1, a_2, …, a_n. Also you are given a positive integer k.
You want to find m non-decreasing arrays of non-negative integers b_1, b... | instruction | 0 | 104,632 | 12 | 209,264 |
Yes | output | 1 | 104,632 | 12 | 209,265 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a non-decreasing array of non-negative integers a_1, a_2, …, a_n. Also you are given a positive integer k.
You want to find m non-decreasing arrays of non-negative integers b_1, b... | instruction | 0 | 104,633 | 12 | 209,266 |
No | output | 1 | 104,633 | 12 | 209,267 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a non-decreasing array of non-negative integers a_1, a_2, …, a_n. Also you are given a positive integer k.
You want to find m non-decreasing arrays of non-negative integers b_1, b... | instruction | 0 | 104,634 | 12 | 209,268 |
No | output | 1 | 104,634 | 12 | 209,269 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a non-decreasing array of non-negative integers a_1, a_2, …, a_n. Also you are given a positive integer k.
You want to find m non-decreasing arrays of non-negative integers b_1, b... | instruction | 0 | 104,635 | 12 | 209,270 |
No | output | 1 | 104,635 | 12 | 209,271 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a non-decreasing array of non-negative integers a_1, a_2, …, a_n. Also you are given a positive integer k.
You want to find m non-decreasing arrays of non-negative integers b_1, b... | instruction | 0 | 104,636 | 12 | 209,272 |
No | output | 1 | 104,636 | 12 | 209,273 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given two tables A and B of size n × m.
We define a sorting by column as the following: we choose a column and reorder the rows of the table by the value in this column, from the rows ... | instruction | 0 | 104,681 | 12 | 209,362 |
No | output | 1 | 104,681 | 12 | 209,363 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given two tables A and B of size n × m.
We define a sorting by column as the following: we choose a column and reorder the rows of the table by the value in this column, from the rows ... | instruction | 0 | 104,682 | 12 | 209,364 |
No | output | 1 | 104,682 | 12 | 209,365 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given two tables A and B of size n × m.
We define a sorting by column as the following: we choose a column and reorder the rows of the table by the value in this column, from the rows ... | instruction | 0 | 104,683 | 12 | 209,366 |
No | output | 1 | 104,683 | 12 | 209,367 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given two tables A and B of size n × m.
We define a sorting by column as the following: we choose a column and reorder the rows of the table by the value in this column, from the rows ... | instruction | 0 | 104,684 | 12 | 209,368 |
No | output | 1 | 104,684 | 12 | 209,369 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Permutation p is an ordered set of integers p1, p2, ..., pn, consisting of n distinct positive integers not larger than n. We'll denote as n the length of permutation p1, p2, ..., pn.
Your task is to find such permutation p of length n, tha... | instruction | 0 | 104,824 | 12 | 209,648 |
Tags: constructive algorithms, greedy
Correct Solution:
```
n,k = map(int,list(input().split()))
for i in range(1,(k+3)//2):
print(i, k+2-i,end=" ")
if k>1 and k%2==0: print(k//2+1,end=" ")
for i in range(k+2,n+1):
print(i,end=" ")
``` | output | 1 | 104,824 | 12 | 209,649 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Permutation p is an ordered set of integers p1, p2, ..., pn, consisting of n distinct positive integers not larger than n. We'll denote as n the length of permutation p1, p2, ..., pn.
Your task is to find such permutation p of length n, tha... | instruction | 0 | 104,825 | 12 | 209,650 |
Tags: constructive algorithms, greedy
Correct Solution:
```
[n, k], s = map(int, input().split()), [1]
for i in range(k, 0, -1):
s.append(s[-1] + (-i if (k - i) % 2 else i))
print(*s + sorted(set(range(1, n + 1)) - set(s)))
``` | output | 1 | 104,825 | 12 | 209,651 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Permutation p is an ordered set of integers p1, p2, ..., pn, consisting of n distinct positive integers not larger than n. We'll denote as n the length of permutation p1, p2, ..., pn.
Your task is to find such permutation p of length n, tha... | instruction | 0 | 104,826 | 12 | 209,652 |
Tags: constructive algorithms, greedy
Correct Solution:
```
n,k=(int(i) for i in input().split())
l=[i for i in range(1,n-k+1)]
l1=[i for i in range(n-k+1,n+1)]
k1=0
k2=k-1
for i in range(k):
if(i%2==0):
l.append(l1[k2])
k2-=1
else:
l.append(l1[k1])
k1+=1
print(*l)
``` | output | 1 | 104,826 | 12 | 209,653 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Permutation p is an ordered set of integers p1, p2, ..., pn, consisting of n distinct positive integers not larger than n. We'll denote as n the length of permutation p1, p2, ..., pn.
Your task is to find such permutation p of length n, tha... | instruction | 0 | 104,827 | 12 | 209,654 |
Tags: constructive algorithms, greedy
Correct Solution:
```
from sys import stdin
lines = list(filter(None, stdin.read().split('\n')))
def parseline(line):
return list(map(int, line.split()))
lines = list(map(parseline, lines))
n, k = lines[0]
x = n + 1
for i in range(n, n - k, -1):
if (n - i) % 2 == 0:
x = x -... | output | 1 | 104,827 | 12 | 209,655 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Permutation p is an ordered set of integers p1, p2, ..., pn, consisting of n distinct positive integers not larger than n. We'll denote as n the length of permutation p1, p2, ..., pn.
Your task is to find such permutation p of length n, tha... | instruction | 0 | 104,828 | 12 | 209,656 |
Tags: constructive algorithms, greedy
Correct Solution:
```
n, k = map(int, input().split())
a = [x + 1 for x in range(n)]
l = 0
r = n - 1
p = 0
for i in range(k - 1):
if p:
print(a[r], end = ' ')
r -= 1
p = not p
else:
print(a[l], end = ' ')
l += 1
p = not p
... | output | 1 | 104,828 | 12 | 209,657 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Permutation p is an ordered set of integers p1, p2, ..., pn, consisting of n distinct positive integers not larger than n. We'll denote as n the length of permutation p1, p2, ..., pn.
Your task is to find such permutation p of length n, tha... | instruction | 0 | 104,829 | 12 | 209,658 |
Tags: constructive algorithms, greedy
Correct Solution:
```
#In the name of Allah
from sys import stdin, stdout
input = stdin.readline
n, k = map(int, input().split())
def f(n):
n += 1
l = []
for i in range(1, 1 + n // 2):
l.append(str(i))
l.append(str(n - i + ... | output | 1 | 104,829 | 12 | 209,659 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Permutation p is an ordered set of integers p1, p2, ..., pn, consisting of n distinct positive integers not larger than n. We'll denote as n the length of permutation p1, p2, ..., pn.
Your task is to find such permutation p of length n, tha... | instruction | 0 | 104,830 | 12 | 209,660 |
Tags: constructive algorithms, greedy
Correct Solution:
```
n, k = map(int, input().split())
a = []
k += 1
one = 0
two = 0
f = False
for i in range(1, n + 1):
if i % 2 != 0:
i -= one
a.append(i)
one += 1
else:
i -= two
a.append(n + 2 - i)
two += 1
k -= 1
i... | output | 1 | 104,830 | 12 | 209,661 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Permutation p is an ordered set of integers p1, p2, ..., pn, consisting of n distinct positive integers not larger than n. We'll denote as n the length of permutation p1, p2, ..., pn.
Your task is to find such permutation p of length n, tha... | instruction | 0 | 104,831 | 12 | 209,662 |
Tags: constructive algorithms, greedy
Correct Solution:
```
n,k = map(int,input().split())
a = list(range(1,n+1))
for i in range(1,k+1): a[i] = a[i-1] + (k-i+1 if i&1 else i-k-1)
print(" ".join(repr(x) for x in a))
``` | output | 1 | 104,831 | 12 | 209,663 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Permutation p is an ordered set of integers p1, p2, ..., pn, consisting of n distinct positive integers not larger than n. We'll denote as n the length of permutation p1, p2, ..., pn.
Your task... | instruction | 0 | 104,832 | 12 | 209,664 |
Yes | output | 1 | 104,832 | 12 | 209,665 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Permutation p is an ordered set of integers p1, p2, ..., pn, consisting of n distinct positive integers not larger than n. We'll denote as n the length of permutation p1, p2, ..., pn.
Your task... | instruction | 0 | 104,833 | 12 | 209,666 |
Yes | output | 1 | 104,833 | 12 | 209,667 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Permutation p is an ordered set of integers p1, p2, ..., pn, consisting of n distinct positive integers not larger than n. We'll denote as n the length of permutation p1, p2, ..., pn.
Your task... | instruction | 0 | 104,834 | 12 | 209,668 |
Yes | output | 1 | 104,834 | 12 | 209,669 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Permutation p is an ordered set of integers p1, p2, ..., pn, consisting of n distinct positive integers not larger than n. We'll denote as n the length of permutation p1, p2, ..., pn.
Your task... | instruction | 0 | 104,835 | 12 | 209,670 |
Yes | output | 1 | 104,835 | 12 | 209,671 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Permutation p is an ordered set of integers p1, p2, ..., pn, consisting of n distinct positive integers not larger than n. We'll denote as n the length of permutation p1, p2, ..., pn.
Your task... | instruction | 0 | 104,836 | 12 | 209,672 |
No | output | 1 | 104,836 | 12 | 209,673 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Permutation p is an ordered set of integers p1, p2, ..., pn, consisting of n distinct positive integers not larger than n. We'll denote as n the length of permutation p1, p2, ..., pn.
Your task... | instruction | 0 | 104,837 | 12 | 209,674 |
No | output | 1 | 104,837 | 12 | 209,675 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Permutation p is an ordered set of integers p1, p2, ..., pn, consisting of n distinct positive integers not larger than n. We'll denote as n the length of permutation p1, p2, ..., pn.
Your task... | instruction | 0 | 104,838 | 12 | 209,676 |
No | output | 1 | 104,838 | 12 | 209,677 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Permutation p is an ordered set of integers p1, p2, ..., pn, consisting of n distinct positive integers not larger than n. We'll denote as n the length of permutation p1, p2, ..., pn.
Your task... | instruction | 0 | 104,839 | 12 | 209,678 |
No | output | 1 | 104,839 | 12 | 209,679 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array of positive integers a1, a2, ..., an × T of length n × T. We know that for any i > n it is true that ai = ai - n. Find the length of the longest non-decreasing sequence of the given array.
Input
The first line contai... | instruction | 0 | 104,865 | 12 | 209,730 |
Tags: constructive algorithms, dp, matrices
Correct Solution:
```
f = lambda: map(int, input().split())
n, m = f()
t = list(f())
d = {i: j for j, i in enumerate(sorted(set(t)))}
t = [d[i] for i in t]
k = len(d)
a = [0] * k
if m < 2 * k:
for j in t * m:
a[j] += 1
q = a[j]
j += 1
while... | output | 1 | 104,865 | 12 | 209,731 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array of positive integers a1, a2, ..., an × T of length n × T. We know that for any i > n it is true that ai = ai - n. Find the length of the longest non-decreasing sequence of the given array.
Input
The first line contai... | instruction | 0 | 104,866 | 12 | 209,732 |
Tags: constructive algorithms, dp, matrices
Correct Solution:
```
f = lambda: map(int, input().split())
n, m = f()
t = list(f())
s = [0] * 301
d = s[:]
for i in t: d[i] += 1
for i in t * min(m, 2 * n): s[i] = max(s[:i + 1]) + 1
print(max(s) + max((m - n * 2) * max(d), 0))
``` | output | 1 | 104,866 | 12 | 209,733 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array of positive integers a1, a2, ..., an × T of length n × T. We know that for any i > n it is true that ai = ai - n. Find the length of the longest non-decreasing sequence of the given array.
Input
The first line contai... | instruction | 0 | 104,867 | 12 | 209,734 |
Tags: constructive algorithms, dp, matrices
Correct Solution:
```
f = lambda: map(int, input().split())
n, m = f()
t = list(f())
s = [0] * 301
d = s[:]
for i in t: d[i] += 1
for i in t * min(m, 2 * n): s[i] = max(s[:i + 1]) + 1
print(max(s) + max((m - n * 2) * max(d), 0))
# Made By Mostafa_Khaled
``` | output | 1 | 104,867 | 12 | 209,735 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array of positive integers a1, a2, ..., an × T of length n × T. We know that for any i > n it is true that ai = ai - n. Find the length of the longest non-decreasing sequence of the given array.
Input
The first line contai... | instruction | 0 | 104,868 | 12 | 209,736 |
Tags: constructive algorithms, dp, matrices
Correct Solution:
```
mul=lambda A,B,r:[[max([A[i][k]+B[k][j] for k in r if A[i][k] and B[k][j]],default=0) for j in r] for i in r]
def binpower(A,n,e):
r = range(n)
B = A #A^0 is invalid, thus start from A^1
e -= 1
while True:
if e &1: B = mul(B,A... | output | 1 | 104,868 | 12 | 209,737 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array of positive integers a1, a2, ..., an × T of length n × T. We know that for any i > n it is true that ai = ai - n. Find the length of the longest non-decreasing sequence of the given array.
Input
The first line contai... | instruction | 0 | 104,869 | 12 | 209,738 |
Tags: constructive algorithms, dp, matrices
Correct Solution:
```
# ---------------------------iye ha aam zindegi---------------------------------------------
import math
import random
import heapq,bisect
import sys
from collections import deque, defaultdict
from fractions import Fraction
import sys
import threading
fr... | output | 1 | 104,869 | 12 | 209,739 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array of positive integers a1, a2, ..., an × T of length n × T. We know that for any i > n it is true that ai = ai - n. Find the length of the longest non-decreasing sequence of... | instruction | 0 | 104,870 | 12 | 209,740 |
No | output | 1 | 104,870 | 12 | 209,741 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array of positive integers a1, a2, ..., an × T of length n × T. We know that for any i > n it is true that ai = ai - n. Find the length of the longest non-decreasing sequence of... | instruction | 0 | 104,871 | 12 | 209,742 |
No | output | 1 | 104,871 | 12 | 209,743 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array of positive integers a1, a2, ..., an × T of length n × T. We know that for any i > n it is true that ai = ai - n. Find the length of the longest non-decreasing sequence of... | instruction | 0 | 104,872 | 12 | 209,744 |
No | output | 1 | 104,872 | 12 | 209,745 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array of positive integers a1, a2, ..., an × T of length n × T. We know that for any i > n it is true that ai = ai - n. Find the length of the longest non-decreasing sequence of... | instruction | 0 | 104,873 | 12 | 209,746 |
No | output | 1 | 104,873 | 12 | 209,747 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Define the simple skewness of a collection of numbers to be the collection's mean minus its median. You are given a list of n (not necessarily distinct) integers. Find the non-empty subset (with repetition) with the maximum simple skewness.
... | instruction | 0 | 104,890 | 12 | 209,780 |
Tags: binary search, math, ternary search
Correct Solution:
```
from itertools import accumulate
from fractions import Fraction
n = int(input())
A = [int(x) for x in input().split()]
A.sort()
B = list(accumulate([0] + A))
def condition(i, z):
return (2*z - 1)*(A[i-z] + A[-z]) > 2*(B[i+1] - B[i-z+1] + B[-1] - B[-z]... | output | 1 | 104,890 | 12 | 209,781 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Define the simple skewness of a collection of numbers to be the collection's mean minus its median. You are given a list of n (not necessarily distinct) integers. Find the non-empty subset (with... | instruction | 0 | 104,891 | 12 | 209,782 |
No | output | 1 | 104,891 | 12 | 209,783 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Define the simple skewness of a collection of numbers to be the collection's mean minus its median. You are given a list of n (not necessarily distinct) integers. Find the non-empty subset (with... | instruction | 0 | 104,892 | 12 | 209,784 |
No | output | 1 | 104,892 | 12 | 209,785 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Define the simple skewness of a collection of numbers to be the collection's mean minus its median. You are given a list of n (not necessarily distinct) integers. Find the non-empty subset (with... | instruction | 0 | 104,893 | 12 | 209,786 |
No | output | 1 | 104,893 | 12 | 209,787 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Define the simple skewness of a collection of numbers to be the collection's mean minus its median. You are given a list of n (not necessarily distinct) integers. Find the non-empty subset (with... | instruction | 0 | 104,894 | 12 | 209,788 |
No | output | 1 | 104,894 | 12 | 209,789 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Petya is now fond of data compression algorithms. He has already studied gz, bz, zip algorithms and many others. Inspired by the new knowledge, Petya is now developing the new compression... | instruction | 0 | 104,895 | 12 | 209,790 |
No | output | 1 | 104,895 | 12 | 209,791 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.