message stringlengths 2 43.5k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 853 107k | cluster float64 24 24 | __index_level_0__ int64 1.71k 214k |
|---|---|---|---|---|---|
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-empty string s=s_1s_2... s_n, which consists only of lowercase Latin letters. Polycarp does not like a string if it contains at least one string "one" or at least one string ... | instruction | 0 | 80,936 | 24 | 161,872 |
Yes | output | 1 | 80,936 | 24 | 161,873 |
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-empty string s=s_1s_2... s_n, which consists only of lowercase Latin letters. Polycarp does not like a string if it contains at least one string "one" or at least one string ... | instruction | 0 | 80,937 | 24 | 161,874 |
Yes | output | 1 | 80,937 | 24 | 161,875 |
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-empty string s=s_1s_2... s_n, which consists only of lowercase Latin letters. Polycarp does not like a string if it contains at least one string "one" or at least one string ... | instruction | 0 | 80,938 | 24 | 161,876 |
Yes | output | 1 | 80,938 | 24 | 161,877 |
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-empty string s=s_1s_2... s_n, which consists only of lowercase Latin letters. Polycarp does not like a string if it contains at least one string "one" or at least one string ... | instruction | 0 | 80,939 | 24 | 161,878 |
No | output | 1 | 80,939 | 24 | 161,879 |
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-empty string s=s_1s_2... s_n, which consists only of lowercase Latin letters. Polycarp does not like a string if it contains at least one string "one" or at least one string ... | instruction | 0 | 80,940 | 24 | 161,880 |
No | output | 1 | 80,940 | 24 | 161,881 |
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-empty string s=s_1s_2... s_n, which consists only of lowercase Latin letters. Polycarp does not like a string if it contains at least one string "one" or at least one string ... | instruction | 0 | 80,941 | 24 | 161,882 |
No | output | 1 | 80,941 | 24 | 161,883 |
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-empty string s=s_1s_2... s_n, which consists only of lowercase Latin letters. Polycarp does not like a string if it contains at least one string "one" or at least one string ... | instruction | 0 | 80,942 | 24 | 161,884 |
No | output | 1 | 80,942 | 24 | 161,885 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp has a checkered sheet of paper of size n × m. Polycarp painted some of cells with black, the others remained white. Inspired by Malevich's "Black Square", Polycarp wants to paint minimum possible number of white cells with black so ... | instruction | 0 | 81,360 | 24 | 162,720 |
Tags: implementation
Correct Solution:
```
I = input
n, m = map(int, I().split())
board = []
yup, ydown, xleft, xrigth = 0, n, 0, m
for _ in range(n):
board.append(I())
for row in board:
if 'B' not in row:
yup += 1
else:
break
for row in board[::-1]:
if 'B' not in row:
ydown -= ... | output | 1 | 81,360 | 24 | 162,721 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp has a checkered sheet of paper of size n × m. Polycarp painted some of cells with black, the others remained white. Inspired by Malevich's "Black Square", Polycarp wants to paint minimum possible number of white cells with black so ... | instruction | 0 | 81,361 | 24 | 162,722 |
Tags: implementation
Correct Solution:
```
import traceback
import os
import sys
from io import BytesIO, IOBase
import math
from collections import defaultdict, Counter
from functools import lru_cache
from itertools import accumulate
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file)... | output | 1 | 81,361 | 24 | 162,723 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp has a checkered sheet of paper of size n × m. Polycarp painted some of cells with black, the others remained white. Inspired by Malevich's "Black Square", Polycarp wants to paint minimum possible number of white cells with black so ... | instruction | 0 | 81,362 | 24 | 162,724 |
Tags: implementation
Correct Solution:
```
n, m = map(int, input().split())
min_x = m
min_y = n
max_x = 0
max_y = 0
r = -1
s = 0
for y in range(n):
str = input()
for x in range(m):
if str[x] == 'B':
s += 1
if y < min_y:
min_y = y
if x < min_x:
... | output | 1 | 81,362 | 24 | 162,725 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp has a checkered sheet of paper of size n × m. Polycarp painted some of cells with black, the others remained white. Inspired by Malevich's "Black Square", Polycarp wants to paint minimum possible number of white cells with black so ... | instruction | 0 | 81,363 | 24 | 162,726 |
Tags: implementation
Correct Solution:
```
def polycarp(n, m, l):
left = min(l).find("B")
if left == -1:
return 1
right = m - min([x[::-1] for x in l]).find("B") - 1
top = bottom = -1
for i in range(n):
if l[i].find("B") != -1:
top = i
break
for i in range... | output | 1 | 81,363 | 24 | 162,727 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp has a checkered sheet of paper of size n × m. Polycarp painted some of cells with black, the others remained white. Inspired by Malevich's "Black Square", Polycarp wants to paint minimum possible number of white cells with black so ... | instruction | 0 | 81,364 | 24 | 162,728 |
Tags: implementation
Correct Solution:
```
length, width = map(int, input().strip().split());
left, right, up, down = 101, -1, 101, -1
count = 0
for i in range(length):
string = input()
for j in range(width):
if (string[j] == 'B'):
count += 1
left = min(left, j)
right = max(right, j)
up = min(up, i)
... | output | 1 | 81,364 | 24 | 162,729 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp has a checkered sheet of paper of size n × m. Polycarp painted some of cells with black, the others remained white. Inspired by Malevich's "Black Square", Polycarp wants to paint minimum possible number of white cells with black so ... | instruction | 0 | 81,365 | 24 | 162,730 |
Tags: implementation
Correct Solution:
```
n, m = map(int, input().split())
c = []
a = []
numBlack = 0
for i in range(n):
st = str(input())
#print(st)
c.append([])
for ch in st:
c[i].append(ch)
s = []
#print(c)
for i in range(n):
a.append([0]*m)
s.append([0]*m)
for j in range(m):... | output | 1 | 81,365 | 24 | 162,731 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp has a checkered sheet of paper of size n × m. Polycarp painted some of cells with black, the others remained white. Inspired by Malevich's "Black Square", Polycarp wants to paint minimum possible number of white cells with black so ... | instruction | 0 | 81,366 | 24 | 162,732 |
Tags: implementation
Correct Solution:
```
n,k=map(int,input().split(' '))
b=[]
r=[]
c=[]
for i in range (n):
b.append(input())
for i in range(n):
for j in range(k):
if b[i][j]=='B':
r.append(i)
c.append(j)
if len(c)==0:
print(1)
else:
maxr=max(r)-min(r)
maxc=max(c)-min(c)
size=max(... | output | 1 | 81,366 | 24 | 162,733 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp has a checkered sheet of paper of size n × m. Polycarp painted some of cells with black, the others remained white. Inspired by Malevich's "Black Square", Polycarp wants to paint minimum possible number of white cells with black so ... | instruction | 0 | 81,367 | 24 | 162,734 |
Tags: implementation
Correct Solution:
```
n,m=map(int,input().split())
matr=[list(input()) for i in range(n)]
h1=h2=w1=w2=-1
cout=0
for i,x in enumerate(matr):
for j,y in enumerate(x):
if y=='B':
if h1==-1:
h1=h2=i
w1=w2=j
else:
h2=i
... | output | 1 | 81,367 | 24 | 162,735 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp, Arkady's friend, prepares to the programming competition and decides to write a contest. The contest consists of n problems and lasts for T minutes. Each of the problems is defined by two positive integers a_i and p_i — its difficu... | instruction | 0 | 81,732 | 24 | 163,464 |
Tags: binary search, dp, math
Correct Solution:
```
from math import sqrt
class pro(object):
def __init__(self,dif,sc):
self.dif=dif
self.sc=sc
def __lt__(self,other):
return self.dif>other.dif
T=int(input())
mul=[1]
for i in range(100):
mul.append(mul[i]*10/9)
inf=1000000007
for t... | output | 1 | 81,732 | 24 | 163,465 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp, Arkady's friend, prepares to the programming competition and decides to write a contest. The contest consists of n problems and lasts for T minutes. Each of the problems is defined by ... | instruction | 0 | 81,733 | 24 | 163,466 |
No | output | 1 | 81,733 | 24 | 163,467 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp, Arkady's friend, prepares to the programming competition and decides to write a contest. The contest consists of n problems and lasts for T minutes. Each of the problems is defined by ... | instruction | 0 | 81,734 | 24 | 163,468 |
No | output | 1 | 81,734 | 24 | 163,469 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp, Arkady's friend, prepares to the programming competition and decides to write a contest. The contest consists of n problems and lasts for T minutes. Each of the problems is defined by ... | instruction | 0 | 81,735 | 24 | 163,470 |
No | output | 1 | 81,735 | 24 | 163,471 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp, Arkady's friend, prepares to the programming competition and decides to write a contest. The contest consists of n problems and lasts for T minutes. Each of the problems is defined by ... | instruction | 0 | 81,736 | 24 | 163,472 |
No | output | 1 | 81,736 | 24 | 163,473 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp has a string s[1 ... n] of length n consisting of decimal digits. Polycarp performs the following operation with the string s no more than once (i.e. he can perform operation 0 or 1 time):
* Polycarp selects two numbers i and j ... | instruction | 0 | 81,934 | 24 | 163,868 |
Tags: dp, implementation, strings
Correct Solution:
```
t = int(input())
for i in range(t):
n = int(input())
a = input()
if a[0] + a[n - 3] + a[n - 2] + a[n - 1] == "2020" or a[0] + a[1] + a[n - 2] + a[n - 1] == "2020" or a[0] + a[
1] + a[2] + a[3] == "2020" or a[0] + a[1] + a[2] + a[n - 1] == "2020... | output | 1 | 81,934 | 24 | 163,869 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp has a string s[1 ... n] of length n consisting of decimal digits. Polycarp performs the following operation with the string s no more than once (i.e. he can perform operation 0 or 1 time):
* Polycarp selects two numbers i and j ... | instruction | 0 | 81,935 | 24 | 163,870 |
Tags: dp, implementation, strings
Correct Solution:
```
for _ in range(int(input())):
n=int(input())
s=input()
flag=-1
if s[0]=="2":
flag=3
if s[1]=="0":
flag=2
if s[2]=="2":
flag=1
if s[3]=="0":
flag=0
... | output | 1 | 81,935 | 24 | 163,871 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp has a string s[1 ... n] of length n consisting of decimal digits. Polycarp performs the following operation with the string s no more than once (i.e. he can perform operation 0 or 1 time):
* Polycarp selects two numbers i and j ... | instruction | 0 | 81,936 | 24 | 163,872 |
Tags: dp, implementation, strings
Correct Solution:
```
t = int(input())
for ioijhjgyjvbrbgj in range (t):
n = int(input())
s = input()
if (s[0]=="2"):
if (s[1] == "0"):
if (s[2] == "2"):
if (s[3] == "0"):
print ("YES")
elif (s[n-1] == ... | output | 1 | 81,936 | 24 | 163,873 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp has a string s[1 ... n] of length n consisting of decimal digits. Polycarp performs the following operation with the string s no more than once (i.e. he can perform operation 0 or 1 time):
* Polycarp selects two numbers i and j ... | instruction | 0 | 81,937 | 24 | 163,874 |
Tags: dp, implementation, strings
Correct Solution:
```
t = int(input())
for _ in range(t):
n = int(input())
s = str(input())
if s == '2020':
print('YES')
continue
m = len(s)-4
flag = False
for i in range(n-m+1):
t = s[0:i]+s[i+m:]
#print(t)
if t == '2020'... | output | 1 | 81,937 | 24 | 163,875 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp has a string s[1 ... n] of length n consisting of decimal digits. Polycarp performs the following operation with the string s no more than once (i.e. he can perform operation 0 or 1 time):
* Polycarp selects two numbers i and j ... | instruction | 0 | 81,938 | 24 | 163,876 |
Tags: dp, implementation, strings
Correct Solution:
```
# cook your dish here
for _ in range(int(input())):
n = int(input())
s = input()
flag = 0
if s[0] == "2" and s[n-1] == "0" and s[n-2] == "2" and s[n-3] == "0":
flag = 1
if s[0] == "2" and s[n-1] == "0" and s[n-2] == "2" and s[1] == "0":... | output | 1 | 81,938 | 24 | 163,877 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp has a string s[1 ... n] of length n consisting of decimal digits. Polycarp performs the following operation with the string s no more than once (i.e. he can perform operation 0 or 1 time):
* Polycarp selects two numbers i and j ... | instruction | 0 | 81,939 | 24 | 163,878 |
Tags: dp, implementation, strings
Correct Solution:
```
from collections import defaultdict
import bisect
from itertools import accumulate
import os
import sys
import math
from decimal import *
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
... | output | 1 | 81,939 | 24 | 163,879 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp has a string s[1 ... n] of length n consisting of decimal digits. Polycarp performs the following operation with the string s no more than once (i.e. he can perform operation 0 or 1 time):
* Polycarp selects two numbers i and j ... | instruction | 0 | 81,940 | 24 | 163,880 |
Tags: dp, implementation, strings
Correct Solution:
```
t=int(input())
for z in range(t):
n=int(input())
s=input()
if s[:4]=="2020" or s[n-4:]=="2020":
print("YES")
elif s[0]=="2" and s[n-3:]=="020":
print("YES")
elif s[:2]=="20" and s[n-2:]=="20":
print("YES")
elif s[:3]... | output | 1 | 81,940 | 24 | 163,881 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Polycarp has a string s[1 ... n] of length n consisting of decimal digits. Polycarp performs the following operation with the string s no more than once (i.e. he can perform operation 0 or 1 time):
* Polycarp selects two numbers i and j ... | instruction | 0 | 81,941 | 24 | 163,882 |
Tags: dp, implementation, strings
Correct Solution:
```
for _ in range(int(input())):
n=int(input())
s=list(input())
if (s[0]=='2' and s[1]=='0' and s[2]=='2' and s[3]=='0') or (s[0]=='2' and s[1]=='0' and s[2]=='2' and s[-1]=='0') or (s[0]=='2' and s[1]=='0' and s[-2]=='2' and s[-1]=='0')or (s[0]=='2' and ... | output | 1 | 81,941 | 24 | 163,883 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp has a string s[1 ... n] of length n consisting of decimal digits. Polycarp performs the following operation with the string s no more than once (i.e. he can perform operation 0 or 1 tim... | instruction | 0 | 81,942 | 24 | 163,884 |
Yes | output | 1 | 81,942 | 24 | 163,885 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp has a string s[1 ... n] of length n consisting of decimal digits. Polycarp performs the following operation with the string s no more than once (i.e. he can perform operation 0 or 1 tim... | instruction | 0 | 81,943 | 24 | 163,886 |
Yes | output | 1 | 81,943 | 24 | 163,887 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp has a string s[1 ... n] of length n consisting of decimal digits. Polycarp performs the following operation with the string s no more than once (i.e. he can perform operation 0 or 1 tim... | instruction | 0 | 81,944 | 24 | 163,888 |
Yes | output | 1 | 81,944 | 24 | 163,889 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp has a string s[1 ... n] of length n consisting of decimal digits. Polycarp performs the following operation with the string s no more than once (i.e. he can perform operation 0 or 1 tim... | instruction | 0 | 81,945 | 24 | 163,890 |
Yes | output | 1 | 81,945 | 24 | 163,891 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp has a string s[1 ... n] of length n consisting of decimal digits. Polycarp performs the following operation with the string s no more than once (i.e. he can perform operation 0 or 1 tim... | instruction | 0 | 81,946 | 24 | 163,892 |
No | output | 1 | 81,946 | 24 | 163,893 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp has a string s[1 ... n] of length n consisting of decimal digits. Polycarp performs the following operation with the string s no more than once (i.e. he can perform operation 0 or 1 tim... | instruction | 0 | 81,947 | 24 | 163,894 |
No | output | 1 | 81,947 | 24 | 163,895 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp has a string s[1 ... n] of length n consisting of decimal digits. Polycarp performs the following operation with the string s no more than once (i.e. he can perform operation 0 or 1 tim... | instruction | 0 | 81,948 | 24 | 163,896 |
No | output | 1 | 81,948 | 24 | 163,897 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polycarp has a string s[1 ... n] of length n consisting of decimal digits. Polycarp performs the following operation with the string s no more than once (i.e. he can perform operation 0 or 1 tim... | instruction | 0 | 81,949 | 24 | 163,898 |
No | output | 1 | 81,949 | 24 | 163,899 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The only difference between easy and hard versions is the constraints.
Polycarp has to write a coursework. The coursework consists of m pages.
Polycarp also has n cups of coffee. The coffee in the i-th cup has a_i caffeine in it. Polycarp ... | instruction | 0 | 82,628 | 24 | 165,256 |
Tags: brute force, greedy
Correct Solution:
```
n,s = list(map(int ,input().split()))
a = list(map(int, input().split()))
a.sort(reverse = True)
t = 0
for i in range(1,n+1) :
t = 0
for j in range (n) :
t += max(0, a[j] - j//i)
if t >= s :
print(i)
exit(0)
print(-1)
``` | output | 1 | 82,628 | 24 | 165,257 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The only difference between easy and hard versions is the constraints.
Polycarp has to write a coursework. The coursework consists of m pages.
Polycarp also has n cups of coffee. The coffee in the i-th cup has a_i caffeine in it. Polycarp ... | instruction | 0 | 82,629 | 24 | 165,258 |
Tags: brute force, greedy
Correct Solution:
```
n, m = map(int, input().split())
l = list(map(int,input().split()))
l.sort(reverse = True)
left = 1
right = n
def check(k,m):
if m > 0:
lef = 0
z = 0
for i in range(n):
m -= max(0, l[i]-lef)
z += 1
if z == k:
z = 0
lef +... | output | 1 | 82,629 | 24 | 165,259 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The only difference between easy and hard versions is the constraints.
Polycarp has to write a coursework. The coursework consists of m pages.
Polycarp also has n cups of coffee. The coffee in the i-th cup has a_i caffeine in it. Polycarp ... | instruction | 0 | 82,630 | 24 | 165,260 |
Tags: brute force, greedy
Correct Solution:
```
'''
Auther: ghoshashis545 Ashis Ghosh
College: jalpaiguri Govt Enggineering College
'''
from os import path
import sys
from functools import cmp_to_key as ctk
from collections import deque,defaultdict as dd
from bisect import bisect,bisect_left,bisect_right,inso... | output | 1 | 82,630 | 24 | 165,261 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The only difference between easy and hard versions is the constraints.
Polycarp has to write a coursework. The coursework consists of m pages.
Polycarp also has n cups of coffee. The coffee in the i-th cup has a_i caffeine in it. Polycarp ... | instruction | 0 | 82,631 | 24 | 165,262 |
Tags: brute force, greedy
Correct Solution:
```
def fastio():
import sys
from io import StringIO
from atexit import register
global input
sys.stdin = StringIO(sys.stdin.read())
input = lambda : sys.stdin.readline().rstrip('\r\n')
sys.stdout = StringIO()
register(lambda : sys.__stdout__.write(sys.stdout.getvalu... | output | 1 | 82,631 | 24 | 165,263 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The only difference between easy and hard versions is the constraints.
Polycarp has to write a coursework. The coursework consists of m pages.
Polycarp also has n cups of coffee. The coffee in the i-th cup has a_i caffeine in it. Polycarp ... | instruction | 0 | 82,632 | 24 | 165,264 |
Tags: brute force, greedy
Correct Solution:
```
n, m = map(int, input().split())
coffees = sorted(map(int, input().split()), reverse=True)
total = sum(coffees)
if total < m:
print(-1)
exit()
for div in range(1, n):
a = [0] * div
index = 0
for pena in range(n):
for d in range(div):
... | output | 1 | 82,632 | 24 | 165,265 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The only difference between easy and hard versions is the constraints.
Polycarp has to write a coursework. The coursework consists of m pages.
Polycarp also has n cups of coffee. The coffee in the i-th cup has a_i caffeine in it. Polycarp ... | instruction | 0 | 82,633 | 24 | 165,266 |
Tags: brute force, greedy
Correct Solution:
```
l=input().split()
n=int(l[0])
m=int(l[1])
l=input().split()
li=[int(i) for i in l]
li.sort()
li.reverse()
if(sum(li)<m):
print(-1)
else:
ans=0
for i in range(1,n+1):
arr=list(li)
sumi=0
for j in range(n):
sumi+=max(arr[j]-(j... | output | 1 | 82,633 | 24 | 165,267 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The only difference between easy and hard versions is the constraints.
Polycarp has to write a coursework. The coursework consists of m pages.
Polycarp also has n cups of coffee. The coffee in the i-th cup has a_i caffeine in it. Polycarp ... | instruction | 0 | 82,634 | 24 | 165,268 |
Tags: brute force, greedy
Correct Solution:
```
nb_cups, nb_task = [int(x) for x in input().split()]
caffines = sorted([int(x) for x in input().split()], reverse=True)
def check(d):
done = 0
for i, v in enumerate(caffines):
done += max(0, v - i // d)
return done >= nb_task
if sum(caffines) < nb_t... | output | 1 | 82,634 | 24 | 165,269 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The only difference between easy and hard versions is the constraints.
Polycarp has to write a coursework. The coursework consists of m pages.
Polycarp also has n cups of coffee. The coffee in the i-th cup has a_i caffeine in it. Polycarp ... | instruction | 0 | 82,635 | 24 | 165,270 |
Tags: brute force, greedy
Correct Solution:
```
def check(d, a):
ans = 0
for q in range(len(a)):
ans += max(a[q]-q//d, 0)
return ans
n, m = map(int, input().split())
a = sorted(list(map(int, input().split())), reverse=True)
if sum(a) < m:
print(-1)
else:
l, r = 0, n
while r-l > 1:
... | output | 1 | 82,635 | 24 | 165,271 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The only difference between easy and hard versions is the constraints.
Polycarp has to write a coursework. The coursework consists of m pages.
Polycarp also has n cups of coffee. The coffee in... | instruction | 0 | 82,636 | 24 | 165,272 |
Yes | output | 1 | 82,636 | 24 | 165,273 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The only difference between easy and hard versions is the constraints.
Polycarp has to write a coursework. The coursework consists of m pages.
Polycarp also has n cups of coffee. The coffee in... | instruction | 0 | 82,637 | 24 | 165,274 |
Yes | output | 1 | 82,637 | 24 | 165,275 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The only difference between easy and hard versions is the constraints.
Polycarp has to write a coursework. The coursework consists of m pages.
Polycarp also has n cups of coffee. The coffee in... | instruction | 0 | 82,638 | 24 | 165,276 |
Yes | output | 1 | 82,638 | 24 | 165,277 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The only difference between easy and hard versions is the constraints.
Polycarp has to write a coursework. The coursework consists of m pages.
Polycarp also has n cups of coffee. The coffee in... | instruction | 0 | 82,639 | 24 | 165,278 |
Yes | output | 1 | 82,639 | 24 | 165,279 |
Evaluate the correctness of the submitted Python 2 solution to the coding contest problem. Provide a "Yes" or "No" response.
The only difference between easy and hard versions is the constraints.
Polycarp has to write a coursework. The coursework consists of m pages.
Polycarp also has n cups of coffee. The coffee in... | instruction | 0 | 82,640 | 24 | 165,280 |
Yes | output | 1 | 82,640 | 24 | 165,281 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The only difference between easy and hard versions is the constraints.
Polycarp has to write a coursework. The coursework consists of m pages.
Polycarp also has n cups of coffee. The coffee in... | instruction | 0 | 82,641 | 24 | 165,282 |
No | output | 1 | 82,641 | 24 | 165,283 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.