message stringlengths 2 48.6k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 318 108k | cluster float64 8 8 | __index_level_0__ int64 636 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day you wanted to read something, so you went to your bookshelf to grab some book. But when you saw how messy the bookshelf was you decided to clean it up first.
<image>
There are n books ... | instruction | 0 | 103,118 | 8 | 206,236 |
Yes | output | 1 | 103,118 | 8 | 206,237 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day you wanted to read something, so you went to your bookshelf to grab some book. But when you saw how messy the bookshelf was you decided to clean it up first.
<image>
There are n books ... | instruction | 0 | 103,119 | 8 | 206,238 |
Yes | output | 1 | 103,119 | 8 | 206,239 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day you wanted to read something, so you went to your bookshelf to grab some book. But when you saw how messy the bookshelf was you decided to clean it up first.
<image>
There are n books ... | instruction | 0 | 103,120 | 8 | 206,240 |
No | output | 1 | 103,120 | 8 | 206,241 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day you wanted to read something, so you went to your bookshelf to grab some book. But when you saw how messy the bookshelf was you decided to clean it up first.
<image>
There are n books ... | instruction | 0 | 103,121 | 8 | 206,242 |
No | output | 1 | 103,121 | 8 | 206,243 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day you wanted to read something, so you went to your bookshelf to grab some book. But when you saw how messy the bookshelf was you decided to clean it up first.
<image>
There are n books ... | instruction | 0 | 103,122 | 8 | 206,244 |
No | output | 1 | 103,122 | 8 | 206,245 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
One day you wanted to read something, so you went to your bookshelf to grab some book. But when you saw how messy the bookshelf was you decided to clean it up first.
<image>
There are n books ... | instruction | 0 | 103,123 | 8 | 206,246 |
No | output | 1 | 103,123 | 8 | 206,247 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It's been long after the events of the previous problems, and Karen has now moved on from student life and is looking to relocate to a new neighborhood.
<image>
The neighborhood consists of n ... | instruction | 0 | 103,379 | 8 | 206,758 |
No | output | 1 | 103,379 | 8 | 206,759 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It's been long after the events of the previous problems, and Karen has now moved on from student life and is looking to relocate to a new neighborhood.
<image>
The neighborhood consists of n ... | instruction | 0 | 103,380 | 8 | 206,760 |
No | output | 1 | 103,380 | 8 | 206,761 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It's been long after the events of the previous problems, and Karen has now moved on from student life and is looking to relocate to a new neighborhood.
<image>
The neighborhood consists of n ... | instruction | 0 | 103,381 | 8 | 206,762 |
No | output | 1 | 103,381 | 8 | 206,763 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It's been long after the events of the previous problems, and Karen has now moved on from student life and is looking to relocate to a new neighborhood.
<image>
The neighborhood consists of n ... | instruction | 0 | 103,382 | 8 | 206,764 |
No | output | 1 | 103,382 | 8 | 206,765 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sonya decided that having her own hotel business is the best way of earning money because she can profit and rest wherever she wants.
The country where Sonya lives is an endless line. There is a city in each integer coordinate on this line.... | instruction | 0 | 103,665 | 8 | 207,330 |
Tags: implementation
Correct Solution:
```
# import sys
# sys.stdin = open("test.in","r")
# sys.stdout = open("test.out","w")
n,d=map(int,input().split())
a=list(map(int,input().split()))
c=0
for i in range(n-1):
if a[i+1]-a[i]>2*d:
c+=2
elif a[i+1]-a[i]==2*d:
c+=1
print(c+2)
``` | output | 1 | 103,665 | 8 | 207,331 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sonya decided that having her own hotel business is the best way of earning money because she can profit and rest wherever she wants.
The country where Sonya lives is an endless line. There is a city in each integer coordinate on this line.... | instruction | 0 | 103,668 | 8 | 207,336 |
Tags: implementation
Correct Solution:
```
n,d=map(int,input().split())
a=list(map(int,input().split()))
ans=0
for i in range(n-1):
if a[i]+d<=a[i+1]-d:
ans+=1
if a[i+1]-d>a[i]+d:
ans+=1
ans+=2
print(ans)
``` | output | 1 | 103,668 | 8 | 207,337 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sonya decided that having her own hotel business is the best way of earning money because she can profit and rest wherever she wants.
The country where Sonya lives is an endless line. There is a city in each integer coordinate on this line.... | instruction | 0 | 103,669 | 8 | 207,338 |
Tags: implementation
Correct Solution:
```
s=input().split()
n=int(s[0])
d=int(s[1])
t=input().split()
ans=0
ans=ans+2
l=len(t)
for i in range(l):
t[i]=int(t[i])
q=0
d2=2*d
for i in range(1,l):
q=t[i]-t[i-1]
if q > d2:
ans+=2
elif q == d2:
ans+=1
print(ans)
``` | output | 1 | 103,669 | 8 | 207,339 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sonya decided that having her own hotel business is the best way of earning money because she can profit and rest wherever she wants.
The country where Sonya lives is an endless line. There is a city in each integer coordinate on this line.... | instruction | 0 | 103,671 | 8 | 207,342 |
Tags: implementation
Correct Solution:
```
n,k=map(int,input().split())
l=[int(i) for i in input().split()]
c=2
for i in range(1,n):
if l[i]-l[i-1]>2*k:
c+=2
elif l[i]-l[i-1]==2*k:
c+=1
print(c)
``` | output | 1 | 103,671 | 8 | 207,343 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sonya decided that having her own hotel business is the best way of earning money because she can profit and rest wherever she wants.
The country where Sonya lives is an endless line. There is a city in each integer coordinate on this line.... | instruction | 0 | 103,672 | 8 | 207,344 |
Tags: implementation
Correct Solution:
```
input1 = input()
n = int(input1.split()[0])
d = int(input1.split()[1])
coor = [int(num) for num in input().split()]
sum = 0
for i in range(n-1):
if(coor[i+1]-coor[i] == 2*d):
sum = sum+1
if(coor[i+1]-coor[i] > 2*d):
sum = sum+2
print(sum+2)
``` | output | 1 | 103,672 | 8 | 207,345 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sonya decided that having her own hotel business is the best way of earning money because she can profit and rest wherever she wants.
The country where Sonya lives is an endless line. There is ... | instruction | 0 | 103,673 | 8 | 207,346 |
Yes | output | 1 | 103,673 | 8 | 207,347 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sonya decided that having her own hotel business is the best way of earning money because she can profit and rest wherever she wants.
The country where Sonya lives is an endless line. There is ... | instruction | 0 | 103,674 | 8 | 207,348 |
Yes | output | 1 | 103,674 | 8 | 207,349 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sonya decided that having her own hotel business is the best way of earning money because she can profit and rest wherever she wants.
The country where Sonya lives is an endless line. There is ... | instruction | 0 | 103,675 | 8 | 207,350 |
Yes | output | 1 | 103,675 | 8 | 207,351 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sonya decided that having her own hotel business is the best way of earning money because she can profit and rest wherever she wants.
The country where Sonya lives is an endless line. There is ... | instruction | 0 | 103,676 | 8 | 207,352 |
Yes | output | 1 | 103,676 | 8 | 207,353 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sonya decided that having her own hotel business is the best way of earning money because she can profit and rest wherever she wants.
The country where Sonya lives is an endless line. There is ... | instruction | 0 | 103,677 | 8 | 207,354 |
No | output | 1 | 103,677 | 8 | 207,355 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sonya decided that having her own hotel business is the best way of earning money because she can profit and rest wherever she wants.
The country where Sonya lives is an endless line. There is ... | instruction | 0 | 103,678 | 8 | 207,356 |
No | output | 1 | 103,678 | 8 | 207,357 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sonya decided that having her own hotel business is the best way of earning money because she can profit and rest wherever she wants.
The country where Sonya lives is an endless line. There is ... | instruction | 0 | 103,679 | 8 | 207,358 |
No | output | 1 | 103,679 | 8 | 207,359 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sonya decided that having her own hotel business is the best way of earning money because she can profit and rest wherever she wants.
The country where Sonya lives is an endless line. There is ... | instruction | 0 | 103,680 | 8 | 207,360 |
No | output | 1 | 103,680 | 8 | 207,361 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You work as a system administrator in a dormitory, which has n rooms one after another along a straight hallway. Rooms are numbered from 1 to n.
You have to connect all n rooms to the Internet.
You can connect each room to the Internet dir... | instruction | 0 | 103,789 | 8 | 207,578 |
Tags: data structures, dp, greedy
Correct Solution:
```
def main():
while True:
try:
n, m = map(int, input().strip().split())
s = str(input())
print(getAns(n, m, s))
except EOFError:
break
def getAns(n, k, s):
ans = [0] * (n + 10)
s = '0'... | output | 1 | 103,789 | 8 | 207,579 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You work as a system administrator in a dormitory, which has n rooms one after another along a straight hallway. Rooms are numbered from 1 to n.
You have to connect all n rooms to the Internet.
You can connect each room to the Internet dir... | instruction | 0 | 103,790 | 8 | 207,580 |
Tags: data structures, dp, greedy
Correct Solution:
```
def find(roomcount,radius,string):
zero_roomcount=[0]*(roomcount+1)
binary_move=1<<1000#сдвиг двоичной единицы на 1000 влево или любое число
for i in range(roomcount,0,-1):
if string[i-1]=='1':
binary_move=i
zero_roomcount[i... | output | 1 | 103,790 | 8 | 207,581 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You work as a system administrator in a dormitory, which has n rooms one after another along a straight hallway. Rooms are numbered from 1 to n.
You have to connect all n rooms to the Internet.
You can connect each room to the Internet dir... | instruction | 0 | 103,791 | 8 | 207,582 |
Tags: data structures, dp, greedy
Correct Solution:
```
import sys
input = sys.stdin.readline
n,k=map(int,input().split())
s=input().strip()
seg_el=1<<((n+k+1).bit_length())# Segment treeの台の要素数
SEG=[1<<40]*(2*seg_el)# 1-indexedなので、要素数2*seg_el.Segment treeの初期値で初期化
def getvalue(n,seg_el):
i=n+seg_el
ANS=1<<40... | output | 1 | 103,791 | 8 | 207,583 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You work as a system administrator in a dormitory, which has n rooms one after another along a straight hallway. Rooms are numbered from 1 to n.
You have to connect all n rooms to the Internet.
You can connect each room to the Internet dir... | instruction | 0 | 103,792 | 8 | 207,584 |
Tags: data structures, dp, greedy
Correct Solution:
```
import io, os
input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline
# input = io.StringIO(os.read(0, os.fstat(0).st_size).decode()).readline
ii=lambda:int(input())
kk=lambda:map(int,input().split())
ll=lambda:list(kk())
n,k=kk()
s = input()
curr = n+k+1
lmr... | output | 1 | 103,792 | 8 | 207,585 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You work as a system administrator in a dormitory, which has n rooms one after another along a straight hallway. Rooms are numbered from 1 to n.
You have to connect all n rooms to the Internet.
You can connect each room to the Internet dir... | instruction | 0 | 103,793 | 8 | 207,586 |
Tags: data structures, dp, greedy
Correct Solution:
```
if __name__ == '__main__':
n, dist = map(int, input().split())
light = input().strip()
right_cover = 0
left_most = [-1]*(n)
for idx, ele in enumerate(light):
if ele == '1':
for i in range(max(right_cover, idx-dist), min(idx ... | output | 1 | 103,793 | 8 | 207,587 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You work as a system administrator in a dormitory, which has n rooms one after another along a straight hallway. Rooms are numbered from 1 to n.
You have to connect all n rooms to the Internet.
You can connect each room to the Internet dir... | instruction | 0 | 103,794 | 8 | 207,588 |
Tags: data structures, dp, greedy
Correct Solution:
```
n, k = tuple(map(int, input().rstrip().split()))
s = input().rstrip()
cur = int((2*pow(10,5)) * (2*pow(10,5) + 1) / 2) + 1
cost = [0] * (n+1)
dp = [0]
for i in range(n, 0, -1):
if s[i-1] == '1':
cur=i
cost[i]=cur
for i in range(1, n+1):
dp.a... | output | 1 | 103,794 | 8 | 207,589 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You work as a system administrator in a dormitory, which has n rooms one after another along a straight hallway. Rooms are numbered from 1 to n.
You have to connect all n rooms to the Internet.
You can connect each room to the Internet dir... | instruction | 0 | 103,795 | 8 | 207,590 |
Tags: data structures, dp, greedy
Correct Solution:
```
n, k = map(int, input().split())
mask = list(map(int, input()))
dp = [0] * (n + 2)
nxt = [1 << 31] * (n + 2)
for i in range(n, 0, -1):
nxt[i] = i if mask[i - 1] is 1 else nxt[i + 1]
for i in range(1, n + 1):
dp[i] = dp[i - 1] + i
idx = nxt[max(1, i... | output | 1 | 103,795 | 8 | 207,591 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You work as a system administrator in a dormitory, which has n rooms one after another along a straight hallway. Rooms are numbered from 1 to n.
You have to connect all n rooms to the Internet.
You can connect each room to the Internet dir... | instruction | 0 | 103,796 | 8 | 207,592 |
Tags: data structures, dp, greedy
Correct Solution:
```
import heapq
n, k = list(map(int, input().split()))
s = input()
mostRecent = n
best = []
for room in range(n-1, -1, -1):
if s[room] == '1':
mostRecent = room
best.append(mostRecent)
best = best[::-1]
dp = [0]
vals = [(0,0)]
for room in range(... | output | 1 | 103,796 | 8 | 207,593 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You work as a system administrator in a dormitory, which has n rooms one after another along a straight hallway. Rooms are numbered from 1 to n.
You have to connect all n rooms to the Internet.... | instruction | 0 | 103,797 | 8 | 207,594 |
Yes | output | 1 | 103,797 | 8 | 207,595 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You work as a system administrator in a dormitory, which has n rooms one after another along a straight hallway. Rooms are numbered from 1 to n.
You have to connect all n rooms to the Internet.... | instruction | 0 | 103,798 | 8 | 207,596 |
Yes | output | 1 | 103,798 | 8 | 207,597 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You work as a system administrator in a dormitory, which has n rooms one after another along a straight hallway. Rooms are numbered from 1 to n.
You have to connect all n rooms to the Internet.... | instruction | 0 | 103,799 | 8 | 207,598 |
Yes | output | 1 | 103,799 | 8 | 207,599 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You work as a system administrator in a dormitory, which has n rooms one after another along a straight hallway. Rooms are numbered from 1 to n.
You have to connect all n rooms to the Internet.... | instruction | 0 | 103,800 | 8 | 207,600 |
Yes | output | 1 | 103,800 | 8 | 207,601 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You work as a system administrator in a dormitory, which has n rooms one after another along a straight hallway. Rooms are numbered from 1 to n.
You have to connect all n rooms to the Internet.... | instruction | 0 | 103,801 | 8 | 207,602 |
No | output | 1 | 103,801 | 8 | 207,603 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You work as a system administrator in a dormitory, which has n rooms one after another along a straight hallway. Rooms are numbered from 1 to n.
You have to connect all n rooms to the Internet.... | instruction | 0 | 103,802 | 8 | 207,604 |
No | output | 1 | 103,802 | 8 | 207,605 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You work as a system administrator in a dormitory, which has n rooms one after another along a straight hallway. Rooms are numbered from 1 to n.
You have to connect all n rooms to the Internet.... | instruction | 0 | 103,803 | 8 | 207,606 |
No | output | 1 | 103,803 | 8 | 207,607 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You work as a system administrator in a dormitory, which has n rooms one after another along a straight hallway. Rooms are numbered from 1 to n.
You have to connect all n rooms to the Internet.... | instruction | 0 | 103,804 | 8 | 207,608 |
No | output | 1 | 103,804 | 8 | 207,609 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are asked to watch your nephew who likes to play with toy blocks in a strange way.
He has n boxes and the i-th box has a_i blocks. His game consists of two steps:
1. he chooses an arbitrary box i;
2. he tries to move all blocks f... | instruction | 0 | 103,887 | 8 | 207,774 |
Tags: binary search, greedy, math, sortings
Correct Solution:
```
for _ in range(int(input())):
n = int(input())
l = list(map(int,input().split()))
a = 0
s = sum(l)
if s%(n-1)==0:
m = max(l)
if m>s//(n-1):
print(a+(m-s//(n-1))*(n-1))
else:
print(a)
... | output | 1 | 103,887 | 8 | 207,775 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are asked to watch your nephew who likes to play with toy blocks in a strange way.
He has n boxes and the i-th box has a_i blocks. His game consists of two steps:
1. he chooses an arbitrary box i;
2. he tries to move all blocks f... | instruction | 0 | 103,888 | 8 | 207,776 |
Tags: binary search, greedy, math, sortings
Correct Solution:
```
#!/usr/bin/env python
import os
import sys
from io import BytesIO, IOBase
import math
def main():
for _ in range(int(input())):
n = int(input())
a = list(map(int,input().split()))
print(max(max(a),math.ceil(float(sum(a))/(n-... | output | 1 | 103,888 | 8 | 207,777 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are asked to watch your nephew who likes to play with toy blocks in a strange way.
He has n boxes and the i-th box has a_i blocks. His game consists of two steps:
1. he chooses an arbitrary box i;
2. he tries to move all blocks f... | instruction | 0 | 103,889 | 8 | 207,778 |
Tags: binary search, greedy, math, sortings
Correct Solution:
```
p=int(input())
for i in range(p):
n=int(input())
minn=0
maxx=0
sm=0
k=list(map(int,input().split()))
for i in range(n):
if i==0:
minn=k[i]
maxx=k[i]
else:
if minn>k[i]:
minn=k[i]
if maxx<k[i]:
maxx=k[i]
sm+=k[i]
r=maxx*(n... | output | 1 | 103,889 | 8 | 207,779 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are asked to watch your nephew who likes to play with toy blocks in a strange way.
He has n boxes and the i-th box has a_i blocks. His game consists of two steps:
1. he chooses an arbitrary box i;
2. he tries to move all blocks f... | instruction | 0 | 103,890 | 8 | 207,780 |
Tags: binary search, greedy, math, sortings
Correct Solution:
```
import math
t = int(input())
while t:
n = int(input())
a = list(map(int,input().split()))
total = sum(a)
k = max(math.ceil(total/(n-1)), max(a))
ans = (n-1)*k - total
print(ans)
t-=1
``` | output | 1 | 103,890 | 8 | 207,781 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are asked to watch your nephew who likes to play with toy blocks in a strange way.
He has n boxes and the i-th box has a_i blocks. His game consists of two steps:
1. he chooses an arbitrary box i;
2. he tries to move all blocks f... | instruction | 0 | 103,891 | 8 | 207,782 |
Tags: binary search, greedy, math, sortings
Correct Solution:
```
# cook your dish here
import math
t = int(input())
for i in range(t):
n = int(input())
a = list(map(int,input().split()))
s,m = sum(a),max(a)
ans = max(m,math.ceil(s/(n-1)))*(n-1)-s
print(ans)
``` | output | 1 | 103,891 | 8 | 207,783 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are asked to watch your nephew who likes to play with toy blocks in a strange way.
He has n boxes and the i-th box has a_i blocks. His game consists of two steps:
1. he chooses an arbitrary box i;
2. he tries to move all blocks f... | instruction | 0 | 103,892 | 8 | 207,784 |
Tags: binary search, greedy, math, sortings
Correct Solution:
```
import sys
import math
from collections import Counter
from collections import OrderedDict
from collections import defaultdict
from functools import reduce
#from itertools import groupby
sys.setrecursionlimit(10**6)
def inputt():
return sys.stdin.rea... | output | 1 | 103,892 | 8 | 207,785 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are asked to watch your nephew who likes to play with toy blocks in a strange way.
He has n boxes and the i-th box has a_i blocks. His game consists of two steps:
1. he chooses an arbitrary box i;
2. he tries to move all blocks f... | instruction | 0 | 103,893 | 8 | 207,786 |
Tags: binary search, greedy, math, sortings
Correct Solution:
```
t = int(input())
for _ in range(t):
n = int(input())
a = list(map(int,input().split()))
x = max(a)*(n-1)
s = sum(a)
q = s//(n-1)
r = s%(n-1)
if r>0:
q+=1
print(max(max(a),q)*(n-1)-s)
``` | output | 1 | 103,893 | 8 | 207,787 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are asked to watch your nephew who likes to play with toy blocks in a strange way.
He has n boxes and the i-th box has a_i blocks. His game consists of two steps:
1. he chooses an arbitrary box i;
2. he tries to move all blocks f... | instruction | 0 | 103,894 | 8 | 207,788 |
Tags: binary search, greedy, math, sortings
Correct Solution:
```
import sys
input = sys.stdin.readline
from collections import *
t = int(input())
for _ in range(t):
n = int(input())
a = list(map(int, input().split()))
M = (n-1)*max(a)
S = sum(a)
if S<=M:
#print('a')
print(M-S... | output | 1 | 103,894 | 8 | 207,789 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are asked to watch your nephew who likes to play with toy blocks in a strange way.
He has n boxes and the i-th box has a_i blocks. His game consists of two steps:
1. he chooses an arbit... | instruction | 0 | 103,895 | 8 | 207,790 |
Yes | output | 1 | 103,895 | 8 | 207,791 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are asked to watch your nephew who likes to play with toy blocks in a strange way.
He has n boxes and the i-th box has a_i blocks. His game consists of two steps:
1. he chooses an arbit... | instruction | 0 | 103,896 | 8 | 207,792 |
Yes | output | 1 | 103,896 | 8 | 207,793 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are asked to watch your nephew who likes to play with toy blocks in a strange way.
He has n boxes and the i-th box has a_i blocks. His game consists of two steps:
1. he chooses an arbit... | instruction | 0 | 103,897 | 8 | 207,794 |
Yes | output | 1 | 103,897 | 8 | 207,795 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.