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're given an array a of length 2n. Is it possible to reorder it in such way so that the sum of the first n elements isn't equal to the sum of the last n elements?
Input
The first line contains an integer n (1 ≤ n ≤ 1000), where 2n is th... | instruction | 0 | 50,561 | 12 | 101,122 |
Tags: constructive algorithms, greedy, sortings
Correct Solution:
```
n = int(input())
elements = list(map(int,input().split()))
if len(set(elements)) == 1:
print("-1")
else:
elements.sort()
for i in elements:
print(i,end=" ")
``` | output | 1 | 50,561 | 12 | 101,123 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You're given an array a of length 2n. Is it possible to reorder it in such way so that the sum of the first n elements isn't equal to the sum of the last n elements?
Input
The first line contains an integer n (1 ≤ n ≤ 1000), where 2n is th... | instruction | 0 | 50,562 | 12 | 101,124 |
Tags: constructive algorithms, greedy, sortings
Correct Solution:
```
n = int(input())
a = list(map(int, input().split()))
a.sort()
cnt = 0
for i in range(n):
cnt += a[i]
if cnt != sum(a) - cnt:
print(*a)
else:
print(-1)
``` | output | 1 | 50,562 | 12 | 101,125 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You're given an array a of length 2n. Is it possible to reorder it in such way so that the sum of the first n elements isn't equal to the sum of the last n elements?
Input
The first line contains an integer n (1 ≤ n ≤ 1000), where 2n is th... | instruction | 0 | 50,563 | 12 | 101,126 |
Tags: constructive algorithms, greedy, sortings
Correct Solution:
```
n= int(input())
a = list(map(int,input().split()))
b = set(a)
if (len(b)==1):
print(-1)
exit(0)
else:
a = sorted(a)
for i in a:
print(i, end=" ")
``` | output | 1 | 50,563 | 12 | 101,127 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You're given an array a of length 2n. Is it possible to reorder it in such way so that the sum of the first n elements isn't equal to the sum of the last n elements?
Input
The first line contains an integer n (1 ≤ n ≤ 1000), where 2n is th... | instruction | 0 | 50,564 | 12 | 101,128 |
Tags: constructive algorithms, greedy, sortings
Correct Solution:
```
def main():
n = int(input())
a = [int(x) for x in input().split()]
a.sort()
if a[0] == a[-1]:
print(-1)
else:
for ai in a:
print(ai, end=" ")
if __name__ == "__main__":
main()
``` | output | 1 | 50,564 | 12 | 101,129 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You're given an array a of length 2n. Is it possible to reorder it in such way so that the sum of the first n elements isn't equal to the sum of the last n elements?
Input
The first line contains an integer n (1 ≤ n ≤ 1000), where 2n is th... | instruction | 0 | 50,565 | 12 | 101,130 |
Tags: constructive algorithms, greedy, sortings
Correct Solution:
```
n=int(input())
a=list(map(int,input().split()))
a.sort()
#print(a[:n],a[n:])
if(sum(a[:n])==sum(a[n:])):
print(-1)
else:
print(' '.join(str(x) for x in a))
``` | output | 1 | 50,565 | 12 | 101,131 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You're given an array a of length 2n. Is it possible to reorder it in such way so that the sum of the first n elements isn't equal to the sum of the last n elements?
Input
The first line contains an integer n (1 ≤ n ≤ 1000), where 2n is th... | instruction | 0 | 50,566 | 12 | 101,132 |
Tags: constructive algorithms, greedy, sortings
Correct Solution:
```
n=int(input())
A=list(map(int,input().split()))
A.sort()
if sum(A)==2*sum(A[:n]):
print(-1)
else:
print(*A)
``` | output | 1 | 50,566 | 12 | 101,133 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You're given an array a of length 2n. Is it possible to reorder it in such way so that the sum of the first n elements isn't equal to the sum of the last n elements?
Input
The first line conta... | instruction | 0 | 50,567 | 12 | 101,134 |
Yes | output | 1 | 50,567 | 12 | 101,135 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You're given an array a of length 2n. Is it possible to reorder it in such way so that the sum of the first n elements isn't equal to the sum of the last n elements?
Input
The first line conta... | instruction | 0 | 50,568 | 12 | 101,136 |
Yes | output | 1 | 50,568 | 12 | 101,137 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You're given an array a of length 2n. Is it possible to reorder it in such way so that the sum of the first n elements isn't equal to the sum of the last n elements?
Input
The first line conta... | instruction | 0 | 50,569 | 12 | 101,138 |
Yes | output | 1 | 50,569 | 12 | 101,139 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You're given an array a of length 2n. Is it possible to reorder it in such way so that the sum of the first n elements isn't equal to the sum of the last n elements?
Input
The first line conta... | instruction | 0 | 50,570 | 12 | 101,140 |
Yes | output | 1 | 50,570 | 12 | 101,141 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You're given an array a of length 2n. Is it possible to reorder it in such way so that the sum of the first n elements isn't equal to the sum of the last n elements?
Input
The first line conta... | instruction | 0 | 50,571 | 12 | 101,142 |
No | output | 1 | 50,571 | 12 | 101,143 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You're given an array a of length 2n. Is it possible to reorder it in such way so that the sum of the first n elements isn't equal to the sum of the last n elements?
Input
The first line conta... | instruction | 0 | 50,572 | 12 | 101,144 |
No | output | 1 | 50,572 | 12 | 101,145 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You're given an array a of length 2n. Is it possible to reorder it in such way so that the sum of the first n elements isn't equal to the sum of the last n elements?
Input
The first line conta... | instruction | 0 | 50,573 | 12 | 101,146 |
No | output | 1 | 50,573 | 12 | 101,147 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You're given an array a of length 2n. Is it possible to reorder it in such way so that the sum of the first n elements isn't equal to the sum of the last n elements?
Input
The first line conta... | instruction | 0 | 50,574 | 12 | 101,148 |
No | output | 1 | 50,574 | 12 | 101,149 |
Provide tags and a correct Python 3 solution for this coding contest problem.
At first, let's define function f(x) as follows: $$$ \begin{matrix} f(x) & = & \left\{ \begin{matrix} x/2 & \mbox{if } x is even \\\ x - 1 & \mbox{otherwise } \end{matrix} \right. \end{matrix} $$$
We can see that if we choose some value v ... | instruction | 0 | 50,602 | 12 | 101,204 |
Tags: binary search, combinatorics, dp, math
Correct Solution:
```
from collections import defaultdict
(n, k)=[int(x) for x in input().split()]
# res =-1
# dp = [1] * (n+1)
# for i in range(n,0,-1):
# if dp[i] >= k:
# res = i
# break
# imod2 = i % 2
# if imod2 == 0:
# dp[i//2] += dp... | output | 1 | 50,602 | 12 | 101,205 |
Provide tags and a correct Python 3 solution for this coding contest problem.
At first, let's define function f(x) as follows: $$$ \begin{matrix} f(x) & = & \left\{ \begin{matrix} x/2 & \mbox{if } x is even \\\ x - 1 & \mbox{otherwise } \end{matrix} \right. \end{matrix} $$$
We can see that if we choose some value v ... | instruction | 0 | 50,603 | 12 | 101,206 |
Tags: binary search, combinatorics, dp, math
Correct Solution:
```
n, k = map(int, input().split())
s = bin(n)[2:]
ans = 1
if k == 1:
ans = n
else:
f = len(s)
for d in range(1, f):
rgt = int(s[-d:], 2)
lft = int(s[:-d], 2)
c = 2**d
# print(d, lft, rgt+c, 2*c-1)
if rg... | output | 1 | 50,603 | 12 | 101,207 |
Provide tags and a correct Python 3 solution for this coding contest problem.
At first, let's define function f(x) as follows: $$$ \begin{matrix} f(x) & = & \left\{ \begin{matrix} x/2 & \mbox{if } x is even \\\ x - 1 & \mbox{otherwise } \end{matrix} \right. \end{matrix} $$$
We can see that if we choose some value v ... | instruction | 0 | 50,604 | 12 | 101,208 |
Tags: binary search, combinatorics, dp, math
Correct Solution:
```
n,k=map(int,input().split())
j=n
odd=3
even=6
if j%2==0:
n1=1
n2=1
elif j%2!=0:
n1=1
n2=2
preodd=1
preeven=2
if k==n:
print(1)
elif k==1:
print(j)
elif k==2:
if j%2==0:
print(j-2)
else:
print(j-1)
else:
... | output | 1 | 50,604 | 12 | 101,209 |
Provide tags and a correct Python 3 solution for this coding contest problem.
At first, let's define function f(x) as follows: $$$ \begin{matrix} f(x) & = & \left\{ \begin{matrix} x/2 & \mbox{if } x is even \\\ x - 1 & \mbox{otherwise } \end{matrix} \right. \end{matrix} $$$
We can see that if we choose some value v ... | instruction | 0 | 50,605 | 12 | 101,210 |
Tags: binary search, combinatorics, dp, math
Correct Solution:
```
def check(md, n, k):
s=0
temp, i = md, 1
while temp<=n:
s += min(n-temp+1, i)
temp *= 2
i *= 2
if md%2==0:
temp, i=md+1, 1
while temp<=n:
s += min(n-temp+1, i)
... | output | 1 | 50,605 | 12 | 101,211 |
Provide tags and a correct Python 3 solution for this coding contest problem.
At first, let's define function f(x) as follows: $$$ \begin{matrix} f(x) & = & \left\{ \begin{matrix} x/2 & \mbox{if } x is even \\\ x - 1 & \mbox{otherwise } \end{matrix} \right. \end{matrix} $$$
We can see that if we choose some value v ... | instruction | 0 | 50,606 | 12 | 101,212 |
Tags: binary search, combinatorics, dp, math
Correct Solution:
```
import sys
import math
from collections import defaultdict,Counter,deque
# input=sys.stdin.readline
# def print(x):
# sys.stdout.write(str(x)+"\n")
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlin... | output | 1 | 50,606 | 12 | 101,213 |
Provide tags and a correct Python 3 solution for this coding contest problem.
At first, let's define function f(x) as follows: $$$ \begin{matrix} f(x) & = & \left\{ \begin{matrix} x/2 & \mbox{if } x is even \\\ x - 1 & \mbox{otherwise } \end{matrix} \right. \end{matrix} $$$
We can see that if we choose some value v ... | instruction | 0 | 50,607 | 12 | 101,214 |
Tags: binary search, combinatorics, dp, math
Correct Solution:
```
n,k = [int(x) for x in input().split()]
def DTB(num,x):
if num > 1:
DTB(num // 2,x)
x.append(num % 2)
nn=[]
kk=[]
DTB(n,nn)
DTB(k,kk)
if k==1:
print(n)
elif k==2:
if n==2:
print(1)
else:
if n%2==0:
... | output | 1 | 50,607 | 12 | 101,215 |
Provide tags and a correct Python 3 solution for this coding contest problem.
At first, let's define function f(x) as follows: $$$ \begin{matrix} f(x) & = & \left\{ \begin{matrix} x/2 & \mbox{if } x is even \\\ x - 1 & \mbox{otherwise } \end{matrix} \right. \end{matrix} $$$
We can see that if we choose some value v ... | instruction | 0 | 50,608 | 12 | 101,216 |
Tags: binary search, combinatorics, dp, math
Correct Solution:
```
import sys
input = sys.stdin.readline
N, K = map(int, input().split())
def search(odd_num):
c = 0
upper = odd_num
down = odd_num
while upper <= N:
c += (upper-down+1)
upper = 2*upper+1
down = 2*down
if down ... | output | 1 | 50,608 | 12 | 101,217 |
Provide tags and a correct Python 3 solution for this coding contest problem.
At first, let's define function f(x) as follows: $$$ \begin{matrix} f(x) & = & \left\{ \begin{matrix} x/2 & \mbox{if } x is even \\\ x - 1 & \mbox{otherwise } \end{matrix} \right. \end{matrix} $$$
We can see that if we choose some value v ... | instruction | 0 | 50,609 | 12 | 101,218 |
Tags: binary search, combinatorics, dp, math
Correct Solution:
```
import sys
input=sys.stdin.readline
n,k=map(int,input().split())
# even
l=0;r=n
while r-l>1:
mid=(l+r)//2
x=mid*2
cnt=0
if x<=n:
cnt+=1
if x+1<=n:
cnt+=1
v=2
while v*x<=n:
if v*x+2*v-1<=n:
... | output | 1 | 50,609 | 12 | 101,219 |
Provide tags and a correct Python 2 solution for this coding contest problem.
At first, let's define function f(x) as follows: $$$ \begin{matrix} f(x) & = & \left\{ \begin{matrix} x/2 & \mbox{if } x is even \\\ x - 1 & \mbox{otherwise } \end{matrix} \right. \end{matrix} $$$
We can see that if we choose some value v ... | instruction | 0 | 50,610 | 12 | 101,220 |
Tags: binary search, combinatorics, dp, math
Correct Solution:
```
from sys import stdin, stdout
from collections import Counter, defaultdict
pr=stdout.write
raw_input = stdin.readline
def ni():
return int(raw_input())
def li():
return list(map(int,raw_input().split()))
def pn(n):
stdout.write(str(n)+'... | output | 1 | 50,610 | 12 | 101,221 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Baby Ehab was toying around with arrays. He has an array a of length n. He defines an array to be good if there's no way to partition it into 2 subsequences such that the sum of the elements in the first is equal to the sum of the elements i... | instruction | 0 | 50,727 | 12 | 101,454 |
Tags: bitmasks, constructive algorithms, dp, math
Correct Solution:
```
# cook your dish here
from collections import defaultdict, OrderedDict, Counter
from sys import stdin, stdout
from bisect import bisect_left, bisect_right
# import numpy as np
from queue import Queue, PriorityQueue
from heapq import *
from statisti... | output | 1 | 50,727 | 12 | 101,455 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Baby Ehab was toying around with arrays. He has an array a of length n. He defines an array to be good if there's no way to partition it into 2 subsequences such that the sum of the elements in the first is equal to the sum of the elements i... | instruction | 0 | 50,728 | 12 | 101,456 |
Tags: bitmasks, constructive algorithms, dp, math
Correct Solution:
```
import sys
import math
def solve(N, A):
g = A[0]
for a in A:
g = math.gcd(g, a)
A2 = [a//g for a in A]
# print(A, A2, sum(A2))
s = sum(A2)
if s % 2:
return []
h = s // 2
S = [0] * (h+1)
S[0] = 1
... | output | 1 | 50,728 | 12 | 101,457 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Baby Ehab was toying around with arrays. He has an array a of length n. He defines an array to be good if there's no way to partition it into 2 subsequences such that the sum of the elements in the first is equal to the sum of the elements i... | instruction | 0 | 50,729 | 12 | 101,458 |
Tags: bitmasks, constructive algorithms, dp, math
Correct Solution:
```
def zip_sorted(a,b):
# sorted by a
a,b = zip(*sorted(zip(a,b)))
# sorted by b
sorted(zip(a, b), key=lambda x: x[1])
return a,b
def number_to_list(a):
b = []
while a>=1:
c = a%10
a = int(a/10)
b.append(c)
return list(reverse... | output | 1 | 50,729 | 12 | 101,459 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Baby Ehab was toying around with arrays. He has an array a of length n. He defines an array to be good if there's no way to partition it into 2 subsequences such that the sum of the elements in the first is equal to the sum of the elements i... | instruction | 0 | 50,730 | 12 | 101,460 |
Tags: bitmasks, constructive algorithms, dp, math
Correct Solution:
```
def isSubsetSum(arr, n, sm):
subset = [ [False for j in range(sm + 1)] for i in range(3) ]
for i in range(n + 1):
for j in range(sm + 1):
if (j == 0):
subset[i % 2][j] = True
elif (i == 0):
subs... | output | 1 | 50,730 | 12 | 101,461 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Baby Ehab was toying around with arrays. He has an array a of length n. He defines an array to be good if there's no way to partition it into 2 subsequences such that the sum of the elements in the first is equal to the sum of the elements i... | instruction | 0 | 50,731 | 12 | 101,462 |
Tags: bitmasks, constructive algorithms, dp, math
Correct Solution:
```
import functools, math, sys
input = sys.stdin.readline
def knapsack(capacity, utility, weight):
backpack = [[0 for i in range(capacity + 1)] for j in range(2)]
for i in range(len(weight)):
for j in range(capacity + 1):
... | output | 1 | 50,731 | 12 | 101,463 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Baby Ehab was toying around with arrays. He has an array a of length n. He defines an array to be good if there's no way to partition it into 2 subsequences such that the sum of the elements in the first is equal to the sum of the elements i... | instruction | 0 | 50,732 | 12 | 101,464 |
Tags: bitmasks, constructive algorithms, dp, math
Correct Solution:
```
N = int(input())
aa = [int(x) for x in input().split()]
def get_max_pow2_factor(x):
result = 0
cur_a = x
while cur_a > 0 and cur_a % 2 == 0:
cur_a //= 2
result += 1
return result
shared_pow2_factor = min([get_ma... | output | 1 | 50,732 | 12 | 101,465 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Baby Ehab was toying around with arrays. He has an array a of length n. He defines an array to be good if there's no way to partition it into 2 subsequences such that the sum of the elements in the first is equal to the sum of the elements i... | instruction | 0 | 50,733 | 12 | 101,466 |
Tags: bitmasks, constructive algorithms, dp, math
Correct Solution:
```
def possible(nums,target):
reach = {0}
for num in nums:
reach |= {i+num for i in reach if i+num <= target}
if target in reach:
return True
return False
n = int(input())
arr = list(map(int,input().split()))
s = sum(ar... | output | 1 | 50,733 | 12 | 101,467 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Baby Ehab was toying around with arrays. He has an array a of length n. He defines an array to be good if there's no way to partition it into 2 subsequences such that the sum of the elements in the first is equal to the sum of the elements i... | instruction | 0 | 50,734 | 12 | 101,468 |
Tags: bitmasks, constructive algorithms, dp, math
Correct Solution:
```
import math
import sys
import collections
import bisect
import time
import random
from itertools import permutations
def get_ints():return map(int, sys.stdin.readline().strip().split())
def get_list():return list(map(int, sys.stdin.readline().strip... | output | 1 | 50,734 | 12 | 101,469 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Baby Ehab was toying around with arrays. He has an array a of length n. He defines an array to be good if there's no way to partition it into 2 subsequences such that the sum of the elements in ... | instruction | 0 | 50,735 | 12 | 101,470 |
Yes | output | 1 | 50,735 | 12 | 101,471 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Baby Ehab was toying around with arrays. He has an array a of length n. He defines an array to be good if there's no way to partition it into 2 subsequences such that the sum of the elements in ... | instruction | 0 | 50,736 | 12 | 101,472 |
Yes | output | 1 | 50,736 | 12 | 101,473 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Baby Ehab was toying around with arrays. He has an array a of length n. He defines an array to be good if there's no way to partition it into 2 subsequences such that the sum of the elements in ... | instruction | 0 | 50,737 | 12 | 101,474 |
Yes | output | 1 | 50,737 | 12 | 101,475 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Baby Ehab was toying around with arrays. He has an array a of length n. He defines an array to be good if there's no way to partition it into 2 subsequences such that the sum of the elements in ... | instruction | 0 | 50,738 | 12 | 101,476 |
Yes | output | 1 | 50,738 | 12 | 101,477 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Baby Ehab was toying around with arrays. He has an array a of length n. He defines an array to be good if there's no way to partition it into 2 subsequences such that the sum of the elements in ... | instruction | 0 | 50,739 | 12 | 101,478 |
No | output | 1 | 50,739 | 12 | 101,479 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Baby Ehab was toying around with arrays. He has an array a of length n. He defines an array to be good if there's no way to partition it into 2 subsequences such that the sum of the elements in ... | instruction | 0 | 50,740 | 12 | 101,480 |
No | output | 1 | 50,740 | 12 | 101,481 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Baby Ehab was toying around with arrays. He has an array a of length n. He defines an array to be good if there's no way to partition it into 2 subsequences such that the sum of the elements in ... | instruction | 0 | 50,741 | 12 | 101,482 |
No | output | 1 | 50,741 | 12 | 101,483 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Baby Ehab was toying around with arrays. He has an array a of length n. He defines an array to be good if there's no way to partition it into 2 subsequences such that the sum of the elements in ... | instruction | 0 | 50,742 | 12 | 101,484 |
No | output | 1 | 50,742 | 12 | 101,485 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array s consisting of n integers.
You have to find any array t of length k such that you can cut out maximum number of copies of array t from array s.
Cutting out the copy of t means that for each element t_i of array t yo... | instruction | 0 | 51,320 | 12 | 102,640 |
Tags: binary search, sortings
Correct Solution:
```
#15:40
def check(m, z):
i = 0
for j in range(z):
i += poj[j] // m
if i < k:
return False
else:
return True
n, k = map(int, input().split())
s = list(map(int, input().split()))
z = max(s)
poj = [0 for i ... | output | 1 | 51,320 | 12 | 102,641 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array s consisting of n integers.
You have to find any array t of length k such that you can cut out maximum number of copies of array t from array s.
Cutting out the copy of t means that for each element t_i of array t yo... | instruction | 0 | 51,321 | 12 | 102,642 |
Tags: binary search, sortings
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
# region fastio
BUFSIZE = 8192
from collections import Counter
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writa... | output | 1 | 51,321 | 12 | 102,643 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array s consisting of n integers.
You have to find any array t of length k such that you can cut out maximum number of copies of array t from array s.
Cutting out the copy of t means that for each element t_i of array t yo... | instruction | 0 | 51,322 | 12 | 102,644 |
Tags: binary search, sortings
Correct Solution:
```
MAX = 200 * 1000 + 1
n, k = map(int,input().split())
arr = [int(x) for x in input().split()]
cnts = {}
t = []
def can(cnt):
del t[:]
for key,value in cnts.items():
need = min(int(value / cnt), k - len(t))
for j in range(need):
t.app... | output | 1 | 51,322 | 12 | 102,645 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array s consisting of n integers.
You have to find any array t of length k such that you can cut out maximum number of copies of array t from array s.
Cutting out the copy of t means that for each element t_i of array t yo... | instruction | 0 | 51,323 | 12 | 102,646 |
Tags: binary search, sortings
Correct Solution:
```
# -*- coding: utf-8 -*-
import collections
"""
created by shhuan at 2018/11/16 23:01
"""
N, K = map(int, input().split())
S = [int(x) for x in input().split()]
wc = [(c, w) for w, c in collections.Counter(S).items()]
wc.sort(reverse=True)
lo, hi = 1, wc[0][0]
... | output | 1 | 51,323 | 12 | 102,647 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array s consisting of n integers.
You have to find any array t of length k such that you can cut out maximum number of copies of array t from array s.
Cutting out the copy of t means that for each element t_i of array t yo... | instruction | 0 | 51,324 | 12 | 102,648 |
Tags: binary search, sortings
Correct Solution:
```
import sys
from math import floor
from itertools import repeat
input = sys.stdin.readline
n, k = map(int, input().split())
a = list(map(int, input().split()))
count = {}
maxcount = 0
for i in range(n):
if a[i] not in count.keys():
count[a[i]] = 0
c... | output | 1 | 51,324 | 12 | 102,649 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array s consisting of n integers.
You have to find any array t of length k such that you can cut out maximum number of copies of array t from array s.
Cutting out the copy of t means that for each element t_i of array t yo... | instruction | 0 | 51,325 | 12 | 102,650 |
Tags: binary search, sortings
Correct Solution:
```
# coding=utf-8
from heapq import heappop, heappush
n, k = map(int, input().split())
w = {}
for i in [int(i) for i in input().split()]:
w[i] = w.get(i, 0) + 1
heap = []
for i in sorted(w.items(), key=lambda x: -x[1]):
heappush(heap, [-i[1], i[0], 1])
ans... | output | 1 | 51,325 | 12 | 102,651 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array s consisting of n integers.
You have to find any array t of length k such that you can cut out maximum number of copies of array t from array s.
Cutting out the copy of t means that for each element t_i of array t yo... | instruction | 0 | 51,326 | 12 | 102,652 |
Tags: binary search, sortings
Correct Solution:
```
'''input
8 4
1 1 1 1 1 1 2 2
'''
from sys import stdin
import math
import heapq
import copy
def sort_by_frequency(n, arr):
count= [0] * ((2 * (10 ** 5 ))+ 1)
for i in range(n):
count[arr[i]] += 1
freq = []
for i in range((len(count))):
if count[i] != 0:
... | output | 1 | 51,326 | 12 | 102,653 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array s consisting of n integers.
You have to find any array t of length k such that you can cut out maximum number of copies of array t from array s.
Cutting out the copy of t means that for each element t_i of array t yo... | instruction | 0 | 51,327 | 12 | 102,654 |
Tags: binary search, sortings
Correct Solution:
```
import sys
input=sys.stdin.readline
def f(z):
ans=0
for i in l:
ans+=(i[0]//z)
if(ans>=k):
return 1
return 0
def bsearch(l,r):
m=(l+r)//2
if(f(m)):
if(f(m+1)==0):
return m
return bsearch(m+1,r)
re... | output | 1 | 51,327 | 12 | 102,655 |
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 s consisting of n integers.
You have to find any array t of length k such that you can cut out maximum number of copies of array t from array s.
Cutting out the copy of ... | instruction | 0 | 51,328 | 12 | 102,656 |
Yes | output | 1 | 51,328 | 12 | 102,657 |
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 s consisting of n integers.
You have to find any array t of length k such that you can cut out maximum number of copies of array t from array s.
Cutting out the copy of ... | instruction | 0 | 51,329 | 12 | 102,658 |
Yes | output | 1 | 51,329 | 12 | 102,659 |
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 s consisting of n integers.
You have to find any array t of length k such that you can cut out maximum number of copies of array t from array s.
Cutting out the copy of ... | instruction | 0 | 51,330 | 12 | 102,660 |
Yes | output | 1 | 51,330 | 12 | 102,661 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.