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.
This is the easy version of the problem. The difference between versions is the constraints on n and a_i. You can make hacks only if all versions of the problem are solved.
First, Aoi came up with the following idea for the competitive prog... | instruction | 0 | 80,106 | 12 | 160,212 |
Tags: binary search, brute force, combinatorics, math, number theory, sortings
Correct Solution:
```
import sys
input = sys.stdin.readline
inputr = lambda: sys.stdin.readline().rstrip('\n')
from collections import Counter
n, p = map(int, input().split())
A = sorted(map(int, input().split()))
B = sorted(Counter(A).it... | output | 1 | 80,106 | 12 | 160,213 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is the easy version of the problem. The difference between versions is the constraints on n and a_i. You can make hacks only if all versions of the problem are solved.
First, Aoi came up with the following idea for the competitive prog... | instruction | 0 | 80,107 | 12 | 160,214 |
Tags: binary search, brute force, combinatorics, math, number theory, sortings
Correct Solution:
```
def solution(n,a,p):
result = []
r=[]
a.sort()
for i in range(n):
r.append(-a[i]+i+1)
# print(r)
remainder = []
for i in range(p):
remainder.append(0)
for i in range(p-1,n... | output | 1 | 80,107 | 12 | 160,215 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is the easy version of the problem. The difference between versions is the constraints on n and a_i. You can make hacks only if all versions of the problem are solved.
First, Aoi came up with the following idea for the competitive prog... | instruction | 0 | 80,108 | 12 | 160,216 |
Tags: binary search, brute force, combinatorics, math, number theory, sortings
Correct Solution:
```
#!/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase
import threading
from collections import defaultdict,Counter
from math import factorial as fac
def main():
for _ in range(1):
n,p=... | output | 1 | 80,108 | 12 | 160,217 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is the easy version of the problem. The difference between versions is the constraints on n and a_i. You can make hacks only if all versions of the problem are solved.
First, Aoi came up with the following idea for the competitive prog... | instruction | 0 | 80,109 | 12 | 160,218 |
Tags: binary search, brute force, combinatorics, math, number theory, sortings
Correct Solution:
```
import io
import os
from bisect import bisect_right
from collections import Counter, deque
from functools import lru_cache
DEBUG = False
def solve(N, P, A):
# P prime
assert len(A) == N
assert P <= N
... | output | 1 | 80,109 | 12 | 160,219 |
Provide tags and a correct Python 3 solution for this coding contest problem.
This is the easy version of the problem. The difference between versions is the constraints on n and a_i. You can make hacks only if all versions of the problem are solved.
First, Aoi came up with the following idea for the competitive prog... | instruction | 0 | 80,110 | 12 | 160,220 |
Tags: binary search, brute force, combinatorics, math, number theory, sortings
Correct Solution:
```
# f = open('test.py')
# def input():
# return f.readline().replace('\n','')
# import heapq
# import bisect
from collections import deque
# from collections import defaultdict
def read_list():
return list(map(int,inpu... | output | 1 | 80,110 | 12 | 160,221 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the easy version of the problem. The difference between versions is the constraints on n and a_i. You can make hacks only if all versions of the problem are solved.
First, Aoi came up w... | instruction | 0 | 80,111 | 12 | 160,222 |
Yes | output | 1 | 80,111 | 12 | 160,223 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the easy version of the problem. The difference between versions is the constraints on n and a_i. You can make hacks only if all versions of the problem are solved.
First, Aoi came up w... | instruction | 0 | 80,112 | 12 | 160,224 |
Yes | output | 1 | 80,112 | 12 | 160,225 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the easy version of the problem. The difference between versions is the constraints on n and a_i. You can make hacks only if all versions of the problem are solved.
First, Aoi came up w... | instruction | 0 | 80,113 | 12 | 160,226 |
Yes | output | 1 | 80,113 | 12 | 160,227 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the easy version of the problem. The difference between versions is the constraints on n and a_i. You can make hacks only if all versions of the problem are solved.
First, Aoi came up w... | instruction | 0 | 80,114 | 12 | 160,228 |
Yes | output | 1 | 80,114 | 12 | 160,229 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the easy version of the problem. The difference between versions is the constraints on n and a_i. You can make hacks only if all versions of the problem are solved.
First, Aoi came up w... | instruction | 0 | 80,115 | 12 | 160,230 |
No | output | 1 | 80,115 | 12 | 160,231 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the easy version of the problem. The difference between versions is the constraints on n and a_i. You can make hacks only if all versions of the problem are solved.
First, Aoi came up w... | instruction | 0 | 80,116 | 12 | 160,232 |
No | output | 1 | 80,116 | 12 | 160,233 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the easy version of the problem. The difference between versions is the constraints on n and a_i. You can make hacks only if all versions of the problem are solved.
First, Aoi came up w... | instruction | 0 | 80,117 | 12 | 160,234 |
No | output | 1 | 80,117 | 12 | 160,235 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
This is the easy version of the problem. The difference between versions is the constraints on n and a_i. You can make hacks only if all versions of the problem are solved.
First, Aoi came up w... | instruction | 0 | 80,118 | 12 | 160,236 |
No | output | 1 | 80,118 | 12 | 160,237 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array a consisting of n integers. We denote the subarray a[l..r] as the array [a_l, a_{l + 1}, ..., a_r] (1 ≤ l ≤ r ≤ n).
A subarray is considered good if every integer that occurs in this subarray occurs there exactly thri... | instruction | 0 | 80,135 | 12 | 160,270 |
Tags: data structures, divide and conquer, hashing, two pointers
Correct Solution:
```
mod = 1000000007
eps = 10**-9
def main():
import sys
from random import sample
from bisect import bisect_left
input = sys.stdin.readline
N = int(input())
A = list(map(int, input().split()))
rmax = 1 << ... | output | 1 | 80,135 | 12 | 160,271 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array a consisting of n integers. We denote the subarray a[l..r] as the array [a_l, a_{l + 1}, ..., a_r] (1 ≤ l ≤ r ≤ n).
A subarray is considered good if every integer that occurs in this subarray occurs there exactly thri... | instruction | 0 | 80,136 | 12 | 160,272 |
Tags: data structures, divide and conquer, hashing, two pointers
Correct Solution:
```
import random
n = int(input())
a = list(map(int, input().split()))
a.insert(0, 0)
cnt = [0] * (n + 1)
cnt2 = [0] * (n + 1)
hashs = [0] * (n + 1)
r1 = [None] * (n + 1)
r2 = [None] * (n + 1)
for i in range(1, n + 1):
r1[i] = r... | output | 1 | 80,136 | 12 | 160,273 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array a consisting of n integers. We denote the subarray a[l..r] as the array [a_l, a_{l + 1}, ..., a_r] (1 ≤ l ≤ r ≤ n).
A subarray is considered good if every integer that occurs in this subarray occurs there exactly thri... | instruction | 0 | 80,137 | 12 | 160,274 |
Tags: data structures, divide and conquer, hashing, two pointers
Correct Solution:
```
import sys
import math
import timeit
from collections import Counter
from random import randint
def main():
n = int(input())
a = [int(x) - 1 for x in input().split()]
hash_value = [randint(1, 10**20) for i in range(n + 1... | output | 1 | 80,137 | 12 | 160,275 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given an array a consisting of n integers. We denote the subarray a[l..r] as the array [a_l, a_{l + 1}, ..., a_r] (1 ≤ l ≤ r ≤ n).
A subarray is considered good if every integer that occurs in this subarray occurs there exactly thri... | instruction | 0 | 80,138 | 12 | 160,276 |
Tags: data structures, divide and conquer, hashing, two pointers
Correct Solution:
```
from collections import Counter
from random import randint
import sys
input = sys.stdin.buffer.readline
def prog():
n = int(input())
a = list(map(int,input().split()))
curr_occurences = [0]*(n + 1)
mult = [randint(1,... | output | 1 | 80,138 | 12 | 160,277 |
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 a consisting of n integers. We denote the subarray a[l..r] as the array [a_l, a_{l + 1}, ..., a_r] (1 ≤ l ≤ r ≤ n).
A subarray is considered good if every integer that oc... | instruction | 0 | 80,139 | 12 | 160,278 |
No | output | 1 | 80,139 | 12 | 160,279 |
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 a consisting of n integers. We denote the subarray a[l..r] as the array [a_l, a_{l + 1}, ..., a_r] (1 ≤ l ≤ r ≤ n).
A subarray is considered good if every integer that oc... | instruction | 0 | 80,140 | 12 | 160,280 |
No | output | 1 | 80,140 | 12 | 160,281 |
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 a consisting of n integers. We denote the subarray a[l..r] as the array [a_l, a_{l + 1}, ..., a_r] (1 ≤ l ≤ r ≤ n).
A subarray is considered good if every integer that oc... | instruction | 0 | 80,141 | 12 | 160,282 |
No | output | 1 | 80,141 | 12 | 160,283 |
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 a consisting of n integers. We denote the subarray a[l..r] as the array [a_l, a_{l + 1}, ..., a_r] (1 ≤ l ≤ r ≤ n).
A subarray is considered good if every integer that oc... | instruction | 0 | 80,142 | 12 | 160,284 |
No | output | 1 | 80,142 | 12 | 160,285 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mike received an array a of length n as a birthday present and decided to test how pretty it is.
An array would pass the i-th prettiness test if there is a way to get an array with a sum of elements totaling s_i, using some number (possibly... | instruction | 0 | 80,148 | 12 | 160,296 |
Tags: binary search, brute force, data structures, divide and conquer, implementation, sortings
Correct Solution:
```
# Legends Always Come Up with Solution
# Author: Manvir Singh
import os
from io import BytesIO, IOBase
import sys
from collections import defaultdict, deque, Counter
from math import sqrt, pi, ceil, lo... | output | 1 | 80,148 | 12 | 160,297 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mike received an array a of length n as a birthday present and decided to test how pretty it is.
An array would pass the i-th prettiness test if there is a way to get an array with a sum of elements totaling s_i, using some number (possibly... | instruction | 0 | 80,149 | 12 | 160,298 |
Tags: binary search, brute force, data structures, divide and conquer, implementation, sortings
Correct Solution:
```
import sys
readline = sys.stdin.readline
T = int(readline())
Ans = []
for qu in range(T):
N, Q = map(int, readline().split())
A = list(map(int, readline().split()))
A.sort()
SA = A... | output | 1 | 80,149 | 12 | 160,299 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mike received an array a of length n as a birthday present and decided to test how pretty it is.
An array would pass the i-th prettiness test if there is a way to get an array with a sum of elements totaling s_i, using some number (possibly... | instruction | 0 | 80,150 | 12 | 160,300 |
Tags: binary search, brute force, data structures, divide and conquer, implementation, sortings
Correct Solution:
```
# Author Name: Ajay Meena
# Codeforce : https://codeforces.com/profile/majay1638
# -------- IMPORTANT ---------#
# SUN BHOS**KE AGAR MERA TEMPLATE COPY KAR RHA HAI NA TOH KUCH CHANGES BHI KAR DENA ESS ... | output | 1 | 80,150 | 12 | 160,301 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mike received an array a of length n as a birthday present and decided to test how pretty it is.
An array would pass the i-th prettiness test if there is a way to get an array with a sum of elements totaling s_i, using some number (possibly... | instruction | 0 | 80,151 | 12 | 160,302 |
Tags: binary search, brute force, data structures, divide and conquer, implementation, sortings
Correct Solution:
```
from bisect import *
def chidori(arr,l,r,ans,prefix):
if l==0:
tot=prefix[r]
else:
tot=prefix[r]-prefix[l-1]
if tot not in ans:
ans[tot]=True
if arr[l]==arr[r]:
... | output | 1 | 80,151 | 12 | 160,303 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mike received an array a of length n as a birthday present and decided to test how pretty it is.
An array would pass the i-th prettiness test if there is a way to get an array with a sum of elements totaling s_i, using some number (possibly... | instruction | 0 | 80,152 | 12 | 160,304 |
Tags: binary search, brute force, data structures, divide and conquer, implementation, sortings
Correct Solution:
```
import math
#input = sys.stdin.readline
from pprint import pprint
import sys
from bisect import bisect_left, bisect_right
def do():
import itertools
squery = lambda a, b: sdat[b] - sdat[a] # q... | output | 1 | 80,152 | 12 | 160,305 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mike received an array a of length n as a birthday present and decided to test how pretty it is.
An array would pass the i-th prettiness test if there is a way to get an array with a sum of elements totaling s_i, using some number (possibly... | instruction | 0 | 80,153 | 12 | 160,306 |
Tags: binary search, brute force, data structures, divide and conquer, implementation, sortings
Correct Solution:
```
import sys, math, itertools, collections, copy
input = sys.stdin.readline
def combine(arr: list, ans: set) -> set:
ans.add(sum(arr))
if (arr[0] == arr[-1]):
return ans
mid = arr[0]... | output | 1 | 80,153 | 12 | 160,307 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mike received an array a of length n as a birthday present and decided to test how pretty it is.
An array would pass the i-th prettiness test if there is a way to get an array with a sum of elements totaling s_i, using some number (possibly... | instruction | 0 | 80,154 | 12 | 160,308 |
Tags: binary search, brute force, data structures, divide and conquer, implementation, sortings
Correct Solution:
```
import sys
input=sys.stdin.readline
#print=sys.stdout.write
#sys.setrecursionlimit(100000)
#from heapq import *
#from collections import deque as dq
#from math import ceil,floor,sqrt,gcd,log
#import bis... | output | 1 | 80,154 | 12 | 160,309 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Mike received an array a of length n as a birthday present and decided to test how pretty it is.
An array would pass the i-th prettiness test if there is a way to get an array with a sum of elements totaling s_i, using some number (possibly... | instruction | 0 | 80,155 | 12 | 160,310 |
Tags: binary search, brute force, data structures, divide and conquer, implementation, sortings
Correct Solution:
```
from sys import stdin
from sys import stdout
from math import *
# input = stdin.readline
# print = stdout.write
def bs(x,y,ar,m):
ans=-1
while(x<=y):
mid = (x+y)//2
if(ar[mid]<=m):
ans=mid
... | output | 1 | 80,155 | 12 | 160,311 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mike received an array a of length n as a birthday present and decided to test how pretty it is.
An array would pass the i-th prettiness test if there is a way to get an array with a sum of ele... | instruction | 0 | 80,156 | 12 | 160,312 |
Yes | output | 1 | 80,156 | 12 | 160,313 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mike received an array a of length n as a birthday present and decided to test how pretty it is.
An array would pass the i-th prettiness test if there is a way to get an array with a sum of ele... | instruction | 0 | 80,157 | 12 | 160,314 |
Yes | output | 1 | 80,157 | 12 | 160,315 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mike received an array a of length n as a birthday present and decided to test how pretty it is.
An array would pass the i-th prettiness test if there is a way to get an array with a sum of ele... | instruction | 0 | 80,158 | 12 | 160,316 |
Yes | output | 1 | 80,158 | 12 | 160,317 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mike received an array a of length n as a birthday present and decided to test how pretty it is.
An array would pass the i-th prettiness test if there is a way to get an array with a sum of ele... | instruction | 0 | 80,159 | 12 | 160,318 |
Yes | output | 1 | 80,159 | 12 | 160,319 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mike received an array a of length n as a birthday present and decided to test how pretty it is.
An array would pass the i-th prettiness test if there is a way to get an array with a sum of ele... | instruction | 0 | 80,160 | 12 | 160,320 |
No | output | 1 | 80,160 | 12 | 160,321 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mike received an array a of length n as a birthday present and decided to test how pretty it is.
An array would pass the i-th prettiness test if there is a way to get an array with a sum of ele... | instruction | 0 | 80,161 | 12 | 160,322 |
No | output | 1 | 80,161 | 12 | 160,323 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mike received an array a of length n as a birthday present and decided to test how pretty it is.
An array would pass the i-th prettiness test if there is a way to get an array with a sum of ele... | instruction | 0 | 80,162 | 12 | 160,324 |
No | output | 1 | 80,162 | 12 | 160,325 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Mike received an array a of length n as a birthday present and decided to test how pretty it is.
An array would pass the i-th prettiness test if there is a way to get an array with a sum of ele... | instruction | 0 | 80,163 | 12 | 160,326 |
No | output | 1 | 80,163 | 12 | 160,327 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A piece of paper contains an array of n integers a1, a2, ..., an. Your task is to find a number that occurs the maximum number of times in this array.
However, before looking for such number, you are allowed to perform not more than k follo... | instruction | 0 | 80,217 | 12 | 160,434 |
Tags: binary search, sortings, two pointers
Correct Solution:
```
n,k=map(int,input().split())
lis=[0]+sorted(map(int,input().split()))
s=[0]*(n+1)
ans=fin=0
for i in range(1,n+1):
s[i]=lis[i]+s[i-1]
#print(s,lis)
for i in range(1,n+1):
l=1
r=i
freq=-1
while l<=r:
mid=l+(r-l)//2
req ... | output | 1 | 80,217 | 12 | 160,435 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A piece of paper contains an array of n integers a1, a2, ..., an. Your task is to find a number that occurs the maximum number of times in this array.
However, before looking for such number, you are allowed to perform not more than k follo... | instruction | 0 | 80,218 | 12 | 160,436 |
Tags: binary search, sortings, two pointers
Correct Solution:
```
n,k=map(int,input().split())
a=list(map(int,input().split()))
a.sort(reverse=True)
b=[a[0]]
for i in range(1,n):
b.append(b[-1]+a[i])
ans=-1
s=0
j=-1
for i in range(n):
s+=a[i];
l=i;
r=n;
while r>l+1:
m=(l+r)//2
if a[i... | output | 1 | 80,218 | 12 | 160,437 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A piece of paper contains an array of n integers a1, a2, ..., an. Your task is to find a number that occurs the maximum number of times in this array.
However, before looking for such number, you are allowed to perform not more than k follo... | instruction | 0 | 80,219 | 12 | 160,438 |
Tags: binary search, sortings, two pointers
Correct Solution:
```
n, k = map(int, input().split())
arr = sorted(list(map(int, input().split())))
s = [0] * (n+1)
res1, res2 = 0, 0
for i in range(1, n+1):
s[i] = arr[i-1] + s[i-1]
i, j = 0, 0
while i < n:
d1 = i - j + 1
d2 = s[i+1] - s[j]
if j <= i and (d1... | output | 1 | 80,219 | 12 | 160,439 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A piece of paper contains an array of n integers a1, a2, ..., an. Your task is to find a number that occurs the maximum number of times in this array.
However, before looking for such number, you are allowed to perform not more than k follo... | instruction | 0 | 80,220 | 12 | 160,440 |
Tags: binary search, sortings, two pointers
Correct Solution:
```
# Legends Always Come Up with Solution
# Author: Manvir Singh
import os
import sys
from io import BytesIO, IOBase
def main():
n,k=map(int,input().split())
a=sorted(map(int,input().split()))
su,j,ma,ele=0,0,-1,0
for i in range(n):
... | output | 1 | 80,220 | 12 | 160,441 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A piece of paper contains an array of n integers a1, a2, ..., an. Your task is to find a number that occurs the maximum number of times in this array.
However, before looking for such number, you are allowed to perform not more than k follo... | instruction | 0 | 80,221 | 12 | 160,442 |
Tags: binary search, sortings, two pointers
Correct Solution:
```
from itertools import accumulate
n,k = map(int, input().split())
nums = [int(x) for x in input().split()]
nums.sort(reverse=True)
falta = [nums[0]-i for i in nums]
acc = list(accumulate(falta))
#print(falta, acc)
rx, ry = 0,0
for i, nu in enumerate(nums)... | output | 1 | 80,221 | 12 | 160,443 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A piece of paper contains an array of n integers a1, a2, ..., an. Your task is to find a number that occurs the maximum number of times in this array.
However, before looking for such number, you are allowed to perform not more than k follo... | instruction | 0 | 80,222 | 12 | 160,444 |
Tags: binary search, sortings, two pointers
Correct Solution:
```
from __future__ import division, print_function
import os
import sys
from io import BytesIO, IOBase
def main():
n, k = [ int(x) for x in input().split() ]
array = [ int(x) for x in input().split() ]
array.sort()
accumulated = [0] * n
... | output | 1 | 80,222 | 12 | 160,445 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A piece of paper contains an array of n integers a1, a2, ..., an. Your task is to find a number that occurs the maximum number of times in this array.
However, before looking for such number, you are allowed to perform not more than k follo... | instruction | 0 | 80,223 | 12 | 160,446 |
Tags: binary search, sortings, two pointers
Correct Solution:
```
def binarySearch(alist, item, k, slist,lis):
first = 0
last = len(alist)-1
opt = 0
while first<=last:
midpoint = (first + last)//2
if lis[item]*alist[midpoint] - (slist[item+1]-slist[item+1-alist[midpoint]]) > k:
... | output | 1 | 80,223 | 12 | 160,447 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A piece of paper contains an array of n integers a1, a2, ..., an. Your task is to find a number that occurs the maximum number of times in this array.
However, before looking for such number, you are allowed to perform not more than k follo... | instruction | 0 | 80,224 | 12 | 160,448 |
Tags: binary search, sortings, two pointers
Correct Solution:
```
from bisect import bisect_left as bl, bisect_right as br, insort
import sys
import heapq
# from math import *
from collections import defaultdict as dd, deque
def data(): return sys.stdin.readline().strip()
def mdata(): return map(int, data().split())
# ... | output | 1 | 80,224 | 12 | 160,449 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A piece of paper contains an array of n integers a1, a2, ..., an. Your task is to find a number that occurs the maximum number of times in this array.
However, before looking for such number, y... | instruction | 0 | 80,225 | 12 | 160,450 |
Yes | output | 1 | 80,225 | 12 | 160,451 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A piece of paper contains an array of n integers a1, a2, ..., an. Your task is to find a number that occurs the maximum number of times in this array.
However, before looking for such number, y... | instruction | 0 | 80,226 | 12 | 160,452 |
Yes | output | 1 | 80,226 | 12 | 160,453 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A piece of paper contains an array of n integers a1, a2, ..., an. Your task is to find a number that occurs the maximum number of times in this array.
However, before looking for such number, y... | instruction | 0 | 80,227 | 12 | 160,454 |
Yes | output | 1 | 80,227 | 12 | 160,455 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A piece of paper contains an array of n integers a1, a2, ..., an. Your task is to find a number that occurs the maximum number of times in this array.
However, before looking for such number, y... | instruction | 0 | 80,228 | 12 | 160,456 |
Yes | output | 1 | 80,228 | 12 | 160,457 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A piece of paper contains an array of n integers a1, a2, ..., an. Your task is to find a number that occurs the maximum number of times in this array.
However, before looking for such number, y... | instruction | 0 | 80,229 | 12 | 160,458 |
No | output | 1 | 80,229 | 12 | 160,459 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.