message stringlengths 2 30.5k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 237 109k | cluster float64 10 10 | __index_level_0__ int64 474 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dora the explorer has decided to use her money after several years of juicy royalties to go shopping. What better place to shop than Nlogonia?
There are n stores numbered from 1 to n in Nlogoni... | instruction | 0 | 46,288 | 10 | 92,576 |
Yes | output | 1 | 46,288 | 10 | 92,577 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dora the explorer has decided to use her money after several years of juicy royalties to go shopping. What better place to shop than Nlogonia?
There are n stores numbered from 1 to n in Nlogoni... | instruction | 0 | 46,289 | 10 | 92,578 |
Yes | output | 1 | 46,289 | 10 | 92,579 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dora the explorer has decided to use her money after several years of juicy royalties to go shopping. What better place to shop than Nlogonia?
There are n stores numbered from 1 to n in Nlogoni... | instruction | 0 | 46,290 | 10 | 92,580 |
Yes | output | 1 | 46,290 | 10 | 92,581 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dora the explorer has decided to use her money after several years of juicy royalties to go shopping. What better place to shop than Nlogonia?
There are n stores numbered from 1 to n in Nlogoni... | instruction | 0 | 46,291 | 10 | 92,582 |
No | output | 1 | 46,291 | 10 | 92,583 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dora the explorer has decided to use her money after several years of juicy royalties to go shopping. What better place to shop than Nlogonia?
There are n stores numbered from 1 to n in Nlogoni... | instruction | 0 | 46,292 | 10 | 92,584 |
No | output | 1 | 46,292 | 10 | 92,585 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dora the explorer has decided to use her money after several years of juicy royalties to go shopping. What better place to shop than Nlogonia?
There are n stores numbered from 1 to n in Nlogoni... | instruction | 0 | 46,293 | 10 | 92,586 |
No | output | 1 | 46,293 | 10 | 92,587 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Dora the explorer has decided to use her money after several years of juicy royalties to go shopping. What better place to shop than Nlogonia?
There are n stores numbered from 1 to n in Nlogoni... | instruction | 0 | 46,294 | 10 | 92,588 |
No | output | 1 | 46,294 | 10 | 92,589 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a rooted tree. Each vertex contains a_i tons of gold, which costs c_i per one ton. Initially, the tree consists only a root numbered 0 with a_0 tons of gold and price c_0 per ton.
There are q queries. Each query has one of two... | instruction | 0 | 46,528 | 10 | 93,056 |
Tags: binary search, data structures, dp, greedy, interactive, trees
Correct Solution:
```
import os, sys
input = sys.stdin.buffer.readline
def main():
(Q, A0, C0) = [int(x) for x in input().split()];N = Q + 2;A = [0] * N;C = [0] * N;P = [0] * N;pref = [0] * N
anc = [None for i in range(N)];anc[-1] = [-1] * 20;... | output | 1 | 46,528 | 10 | 93,057 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a rooted tree. Each vertex contains a_i tons of gold, which costs c_i per one ton. Initially, the tree consists only a root numbered 0 with a_0 tons of gold and price c_0 per ton.
There are q queries. Each query has one of two... | instruction | 0 | 46,529 | 10 | 93,058 |
Tags: binary search, data structures, dp, greedy, interactive, trees
Correct Solution:
```
import os, sys
input = sys.stdin.buffer.readline
def main():
(Q, A0, C0) = [int(x) for x in input().split()];N = Q + 2;A = [0] * N;C = [0] * N;P = [0] * N;pref = [0] * N
anc = [None for i in range(N)];anc[-1] = [-1] * 20;... | output | 1 | 46,529 | 10 | 93,059 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a rooted tree. Each vertex contains a_i tons of gold, which costs c_i per one ton. Initially, the tree consists only a root numbered 0 with a_0 tons of gold and price c_0 per ton.
There are q queries. Each query has one of two... | instruction | 0 | 46,530 | 10 | 93,060 |
Tags: binary search, data structures, dp, greedy, interactive, trees
Correct Solution:
```
import os
import sys
input = sys.stdin.buffer.readline
LG = 20
a = [0]
c = [0]
q, a[0], c[0] = map(int, input().split())
a += [0] * q
c += [0] * q
par = [[] for i in range(q + 1)]
for qi in range(1, q + 1):
query = map(i... | output | 1 | 46,530 | 10 | 93,061 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a rooted tree. Each vertex contains a_i tons of gold, which costs c_i per one ton. Initially, the tree consists only a root numbered 0 with a_0 tons of gold and price c_0 per ton.
There are q queries. Each query has one of two... | instruction | 0 | 46,531 | 10 | 93,062 |
Tags: binary search, data structures, dp, greedy, interactive, trees
Correct Solution:
```
import os
import sys
input = sys.stdin.buffer.readline
def main():
(Q, A0, C0) = [int(x) for x in input().split()]
N = Q + 2
A = [0] * N
C = [0] * N
P = [0] * N
pref = [0] * N # pref[u] is sum of A f... | output | 1 | 46,531 | 10 | 93,063 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a rooted tree. Each vertex contains a_i tons of gold, which costs c_i per one ton. Initially, the tree consists only a root numbered 0 with a_0 tons of gold and price c_0 per ton.
There are q queries. Each query has one of two... | instruction | 0 | 46,532 | 10 | 93,064 |
Tags: binary search, data structures, dp, greedy, interactive, trees
Correct Solution:
```
# https://codeforces.com/contest/1535/submission/118470981
import os
import sys
input = sys.stdin.buffer.readline
def main():
Q, A0, C0 = [int(x) for x in input().split()]
N = Q + 2
A = [0] * N
C = [0] * N
... | output | 1 | 46,532 | 10 | 93,065 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a rooted tree. Each vertex contains a_i tons of gold, which costs c_i per one ton. Initially, the tree consists only a root numbered 0 with a_0 tons of gold and price c_0 per ton.
There are q queries. Each query has one of two... | instruction | 0 | 46,533 | 10 | 93,066 |
Tags: binary search, data structures, dp, greedy, interactive, trees
Correct Solution:
```
import os
import sys
input = sys.stdin.buffer.readline
def main():
(Q, A0, C0) = [int(x) for x in input().split()]
N = Q + 2
A = [0] * N
C = [0] * N
P = [0] * N
pref = [0] * N # pref[u] is sum of A f... | output | 1 | 46,533 | 10 | 93,067 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a rooted tree. Each vertex contains a_i tons of gold, which costs c_i per one ton. Initially, the tree consists only a root numbered 0 with a_0 tons of gold and price c_0 per ton.
There are q queries. Each query has one of two... | instruction | 0 | 46,534 | 10 | 93,068 |
Tags: binary search, data structures, dp, greedy, interactive, trees
Correct Solution:
```
import os
import sys
input = sys.stdin.buffer.readline
def main():
(Q, A0, C0) = [int(x) for x in input().split()]
N = Q + 2
A = [0] * N
C = [0] * N
P = [0] * N
pref = [0] * N # pref[u] is sum of A f... | output | 1 | 46,534 | 10 | 93,069 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Once Bob got to a sale of old TV sets. There were n TV sets at that sale. TV set with index i costs ai bellars. Some TV sets have a negative price — their owners are ready to pay Bob if he buys their useless apparatus. Bob can «buy» any TV s... | instruction | 0 | 46,592 | 10 | 93,184 |
Tags: greedy, sortings
Correct Solution:
```
n,m=map(int,input().split(" "))
x=[int(p) for p in input().split(" ")]
c=[]
for i in range(n):
if (x[i]<0):
c.append(x[i])
if (len(c)>0):
c.sort()
s=0
j=0
while(j<min(len(c),m)):
s+=c[j]
j=j+1
print(abs(s))
else:
p... | output | 1 | 46,592 | 10 | 93,185 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Once Bob got to a sale of old TV sets. There were n TV sets at that sale. TV set with index i costs ai bellars. Some TV sets have a negative price — their owners are ready to pay Bob if he buys their useless apparatus. Bob can «buy» any TV s... | instruction | 0 | 46,593 | 10 | 93,186 |
Tags: greedy, sortings
Correct Solution:
```
n,m = map(int,input().split())
li = list(map(int,input().split()))
li.sort()
s = 0
for i in range(m):
if li[i]<=0:
s+=abs(li[i])
print(s)
``` | output | 1 | 46,593 | 10 | 93,187 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Once Bob got to a sale of old TV sets. There were n TV sets at that sale. TV set with index i costs ai bellars. Some TV sets have a negative price — their owners are ready to pay Bob if he buys their useless apparatus. Bob can «buy» any TV s... | instruction | 0 | 46,594 | 10 | 93,188 |
Tags: greedy, sortings
Correct Solution:
```
x,y = map(int,input().split())
z = map(int,input().split())
print(abs(sum(sorted(x for x in z if x < 0)[:y])))
``` | output | 1 | 46,594 | 10 | 93,189 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Once Bob got to a sale of old TV sets. There were n TV sets at that sale. TV set with index i costs ai bellars. Some TV sets have a negative price — their owners are ready to pay Bob if he buys their useless apparatus. Bob can «buy» any TV s... | instruction | 0 | 46,595 | 10 | 93,190 |
Tags: greedy, sortings
Correct Solution:
```
n,m = map(int,input().split())
p = list(map(int,input().split()))
p.sort()
tot = 0
for i in range(m):
if p[i] < 0:
tot+=p[i]
else:
break
print(-1*tot)
``` | output | 1 | 46,595 | 10 | 93,191 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Once Bob got to a sale of old TV sets. There were n TV sets at that sale. TV set with index i costs ai bellars. Some TV sets have a negative price — their owners are ready to pay Bob if he buys their useless apparatus. Bob can «buy» any TV s... | instruction | 0 | 46,596 | 10 | 93,192 |
Tags: greedy, sortings
Correct Solution:
```
nk=input().split()
n=int(nk[0])
k=int(nk[1])
s=list(map(int,input().rstrip().split()))
s.sort()
a=0
for i in range (k):
if s[i]<0 :
a=a+abs(s[i])
print(a)
``` | output | 1 | 46,596 | 10 | 93,193 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Once Bob got to a sale of old TV sets. There were n TV sets at that sale. TV set with index i costs ai bellars. Some TV sets have a negative price — their owners are ready to pay Bob if he buys their useless apparatus. Bob can «buy» any TV s... | instruction | 0 | 46,597 | 10 | 93,194 |
Tags: greedy, sortings
Correct Solution:
```
n,m=map(int,input().split())
l=list(map(int,input().split()))
ln=[]
lp=[]
for i in l:
if i<0:
ln.append(abs(i))
else:
lp.append(i)
ln.sort(reverse=True)
lp.sort()
su=0
for i in range(len(ln)):
su+=ln[i]
if(i+1>=m):
break
print(su)
``` | output | 1 | 46,597 | 10 | 93,195 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Once Bob got to a sale of old TV sets. There were n TV sets at that sale. TV set with index i costs ai bellars. Some TV sets have a negative price — their owners are ready to pay Bob if he buys their useless apparatus. Bob can «buy» any TV s... | instruction | 0 | 46,598 | 10 | 93,196 |
Tags: greedy, sortings
Correct Solution:
```
m,k=map(int,input().split())
l=sorted(list(map(int,input().split())))
s=0
n=1
for q in range(m):
#print(n,k)
if n>k:
break
if l[q]>0:
break
s+=-1*l[q]
n+=1
print(s)
``` | output | 1 | 46,598 | 10 | 93,197 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Once Bob got to a sale of old TV sets. There were n TV sets at that sale. TV set with index i costs ai bellars. Some TV sets have a negative price — their owners are ready to pay Bob if he buys their useless apparatus. Bob can «buy» any TV s... | instruction | 0 | 46,599 | 10 | 93,198 |
Tags: greedy, sortings
Correct Solution:
```
import sys
n,m=map(int,input().split())
l=list(map(int,input().split()))
l.sort()
if(l[0]>=0):
print(0)
sys.exit()
l=l[:m]
r=m
for i in range(m):
if(l[i]>=0):
r=i
break
s=sum(l[:r])
print(abs(s))
``` | output | 1 | 46,599 | 10 | 93,199 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Once Bob got to a sale of old TV sets. There were n TV sets at that sale. TV set with index i costs ai bellars. Some TV sets have a negative price — their owners are ready to pay Bob if he buys ... | instruction | 0 | 46,600 | 10 | 93,200 |
Yes | output | 1 | 46,600 | 10 | 93,201 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Once Bob got to a sale of old TV sets. There were n TV sets at that sale. TV set with index i costs ai bellars. Some TV sets have a negative price — their owners are ready to pay Bob if he buys ... | instruction | 0 | 46,601 | 10 | 93,202 |
Yes | output | 1 | 46,601 | 10 | 93,203 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Once Bob got to a sale of old TV sets. There were n TV sets at that sale. TV set with index i costs ai bellars. Some TV sets have a negative price — their owners are ready to pay Bob if he buys ... | instruction | 0 | 46,602 | 10 | 93,204 |
Yes | output | 1 | 46,602 | 10 | 93,205 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Once Bob got to a sale of old TV sets. There were n TV sets at that sale. TV set with index i costs ai bellars. Some TV sets have a negative price — their owners are ready to pay Bob if he buys ... | instruction | 0 | 46,603 | 10 | 93,206 |
Yes | output | 1 | 46,603 | 10 | 93,207 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Once Bob got to a sale of old TV sets. There were n TV sets at that sale. TV set with index i costs ai bellars. Some TV sets have a negative price — their owners are ready to pay Bob if he buys ... | instruction | 0 | 46,604 | 10 | 93,208 |
No | output | 1 | 46,604 | 10 | 93,209 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Once Bob got to a sale of old TV sets. There were n TV sets at that sale. TV set with index i costs ai bellars. Some TV sets have a negative price — their owners are ready to pay Bob if he buys ... | instruction | 0 | 46,605 | 10 | 93,210 |
No | output | 1 | 46,605 | 10 | 93,211 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Once Bob got to a sale of old TV sets. There were n TV sets at that sale. TV set with index i costs ai bellars. Some TV sets have a negative price — their owners are ready to pay Bob if he buys ... | instruction | 0 | 46,606 | 10 | 93,212 |
No | output | 1 | 46,606 | 10 | 93,213 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Once Bob got to a sale of old TV sets. There were n TV sets at that sale. TV set with index i costs ai bellars. Some TV sets have a negative price — their owners are ready to pay Bob if he buys ... | instruction | 0 | 46,607 | 10 | 93,214 |
No | output | 1 | 46,607 | 10 | 93,215 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Xenia is a girl being born a noble. Due to the inflexibility and harshness of her family, Xenia has to find some ways to amuse herself.
<image>
Recently Xenia has bought n_r red gems, n_g gree... | instruction | 0 | 47,149 | 10 | 94,298 |
Yes | output | 1 | 47,149 | 10 | 94,299 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Xenia is a girl being born a noble. Due to the inflexibility and harshness of her family, Xenia has to find some ways to amuse herself.
<image>
Recently Xenia has bought n_r red gems, n_g gree... | instruction | 0 | 47,150 | 10 | 94,300 |
Yes | output | 1 | 47,150 | 10 | 94,301 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Xenia is a girl being born a noble. Due to the inflexibility and harshness of her family, Xenia has to find some ways to amuse herself.
<image>
Recently Xenia has bought n_r red gems, n_g gree... | instruction | 0 | 47,151 | 10 | 94,302 |
Yes | output | 1 | 47,151 | 10 | 94,303 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Xenia is a girl being born a noble. Due to the inflexibility and harshness of her family, Xenia has to find some ways to amuse herself.
<image>
Recently Xenia has bought n_r red gems, n_g gree... | instruction | 0 | 47,152 | 10 | 94,304 |
Yes | output | 1 | 47,152 | 10 | 94,305 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Xenia is a girl being born a noble. Due to the inflexibility and harshness of her family, Xenia has to find some ways to amuse herself.
<image>
Recently Xenia has bought n_r red gems, n_g gree... | instruction | 0 | 47,153 | 10 | 94,306 |
No | output | 1 | 47,153 | 10 | 94,307 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Xenia is a girl being born a noble. Due to the inflexibility and harshness of her family, Xenia has to find some ways to amuse herself.
<image>
Recently Xenia has bought n_r red gems, n_g gree... | instruction | 0 | 47,154 | 10 | 94,308 |
No | output | 1 | 47,154 | 10 | 94,309 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Xenia is a girl being born a noble. Due to the inflexibility and harshness of her family, Xenia has to find some ways to amuse herself.
<image>
Recently Xenia has bought n_r red gems, n_g gree... | instruction | 0 | 47,155 | 10 | 94,310 |
No | output | 1 | 47,155 | 10 | 94,311 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Xenia is a girl being born a noble. Due to the inflexibility and harshness of her family, Xenia has to find some ways to amuse herself.
<image>
Recently Xenia has bought n_r red gems, n_g gree... | instruction | 0 | 47,156 | 10 | 94,312 |
No | output | 1 | 47,156 | 10 | 94,313 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n types of coins in Byteland. Conveniently, the denomination of the coin type k divides the denomination of the coin type k + 1, the denomination of the coin type 1 equals 1 tugrick. T... | instruction | 0 | 47,576 | 10 | 95,152 |
No | output | 1 | 47,576 | 10 | 95,153 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have a set of items, each having some integer weight not greater than 8. You denote that a subset of items is good if total weight of items in the subset does not exceed W.
You want to calculate the maximum possible weight of a good sub... | instruction | 0 | 47,984 | 10 | 95,968 |
Tags: dfs and similar, dp, greedy
Correct Solution:
```
from math import gcd
from itertools import product
w = int(input())
c = list(map(int,input().split()))
sm = sum([c[i]*(i+1) for i in range(8)])
per = 1
if sm < w:
print(sm)
exit()
elif sm < w+64:
ans = 0
ls = [list(range(0,min(c[i]+1,8))) for i in range(8)... | output | 1 | 47,984 | 10 | 95,969 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have a set of items, each having some integer weight not greater than 8. You denote that a subset of items is good if total weight of items in the subset does not exceed W.
You want to calculate the maximum possible weight of a good sub... | instruction | 0 | 47,985 | 10 | 95,970 |
Tags: dfs and similar, dp, greedy
Correct Solution:
```
import os
import sys
from functools import lru_cache, reduce
from io import BytesIO
sys.setrecursionlimit(30000)
input = BytesIO(os.read(0, os.fstat(0).st_size)).readline
print = lambda x: os.write(1, str(x).encode())
def main():
init_w = int(input())
... | output | 1 | 47,985 | 10 | 95,971 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Do you like summer? Residents of Berland do. They especially love eating ice cream in the hot summer. So this summer day a large queue of n Berland residents lined up in front of the ice cream stall. We know that each of them has a certain a... | instruction | 0 | 48,334 | 10 | 96,668 |
Tags: constructive algorithms, greedy, sortings
Correct Solution:
```
import math
import sys
input = sys.stdin.readline
n = int(input())
a = [int(_) for _ in input().split()]
for i in range(n):
a[i] += i
a.sort()
for i in range(n):
a[i] -= i
for i in range(n):
if a[i] < 0 or (i > 0 and a[i - 1] > a[i]):
... | output | 1 | 48,334 | 10 | 96,669 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Do you like summer? Residents of Berland do. They especially love eating ice cream in the hot summer. So this summer day a large queue of n Berland residents lined up in front of the ice cream stall. We know that each of them has a certain a... | instruction | 0 | 48,335 | 10 | 96,670 |
Tags: constructive algorithms, greedy, sortings
Correct Solution:
```
n = int(input())
line = [int(i) for i in input().split()]
for i in range(len(line)):
line[i]+=i
line.sort()
for i in range(len(line)):
line[i]-=i
impossivel = False
for i in range(len(line)-1):
if(line[i]>line[i+1]):
impossivel ... | output | 1 | 48,335 | 10 | 96,671 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Do you like summer? Residents of Berland do. They especially love eating ice cream in the hot summer. So this summer day a large queue of n Berland residents lined up in front of the ice cream stall. We know that each of them has a certain a... | instruction | 0 | 48,336 | 10 | 96,672 |
Tags: constructive algorithms, greedy, sortings
Correct Solution:
```
N = int(input().strip())
nums = list(map(int, input().strip().split(' ')))
modified_nums = []
for i in range(N):
modified_nums.append(nums[i] - (N - i))
modified_nums.sort()
for i in range(N):
modified_nums[i] += (N - i)
ordered = True
for... | output | 1 | 48,336 | 10 | 96,673 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Do you like summer? Residents of Berland do. They especially love eating ice cream in the hot summer. So this summer day a large queue of n Berland residents lined up in front of the ice cream stall. We know that each of them has a certain a... | instruction | 0 | 48,337 | 10 | 96,674 |
Tags: constructive algorithms, greedy, sortings
Correct Solution:
```
#E - Happy Line
import sys
nLine = int(input())
nMoney = list(map(int, input().split()))
invariante = []
for i in range(len(nMoney)):
invariante.append(nMoney[i] + i)
invariante.sort()
res = [0] * nLine
for i in range(nLine):
res[i] = in... | output | 1 | 48,337 | 10 | 96,675 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Do you like summer? Residents of Berland do. They especially love eating ice cream in the hot summer. So this summer day a large queue of n Berland residents lined up in front of the ice cream stall. We know that each of them has a certain a... | instruction | 0 | 48,338 | 10 | 96,676 |
Tags: constructive algorithms, greedy, sortings
Correct Solution:
```
import sys
class Person:
def __init__(self, dollars, index):
self.dollars = dollars
self.index = index
def solve():
n = int(input())
given = list(map(int, input().split()))
people = list()
for i in range(n):
... | output | 1 | 48,338 | 10 | 96,677 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Do you like summer? Residents of Berland do. They especially love eating ice cream in the hot summer. So this summer day a large queue of n Berland residents lined up in front of the ice cream stall. We know that each of them has a certain a... | instruction | 0 | 48,339 | 10 | 96,678 |
Tags: constructive algorithms, greedy, sortings
Correct Solution:
```
n = int(input())
a = list(map(int,input().split()))
for i in range(n):
a[i] += i
a = sorted(list(set(a)))
if n > len(a):
print(':(')
else:
for i in range(len(a)):
a[i] -= i
print (" ".join(map(str, a)))
``` | output | 1 | 48,339 | 10 | 96,679 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Do you like summer? Residents of Berland do. They especially love eating ice cream in the hot summer. So this summer day a large queue of n Berland residents lined up in front of the ice cream stall. We know that each of them has a certain a... | instruction | 0 | 48,340 | 10 | 96,680 |
Tags: constructive algorithms, greedy, sortings
Correct Solution:
```
import math,string,itertools,fractions,heapq,collections,re,array,bisect,copy
from itertools import chain, dropwhile, permutations, combinations
from collections import defaultdict, deque
def VI(): return list(map(int,input().split()))
def run(n,a)... | output | 1 | 48,340 | 10 | 96,681 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Do you like summer? Residents of Berland do. They especially love eating ice cream in the hot summer. So this summer day a large queue of n Berland residents lined up in front of the ice cream stall. We know that each of them has a certain a... | instruction | 0 | 48,341 | 10 | 96,682 |
Tags: constructive algorithms, greedy, sortings
Correct Solution:
```
n=int(input().strip())
a=list(map(int,input().strip().split()))
for i in range(n):
a[i]=a[i]-(n-i)
a.sort()
for i in range(n):
a[i]=a[i]+(n-i)
ans=True
for i in range(n-1):
if (a[i]>a[i+1]):
ans=False
break
if (ans):
f... | output | 1 | 48,341 | 10 | 96,683 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Do you like summer? Residents of Berland do. They especially love eating ice cream in the hot summer. So this summer day a large queue of n Berland residents lined up in front of the ice cream s... | instruction | 0 | 48,342 | 10 | 96,684 |
Yes | output | 1 | 48,342 | 10 | 96,685 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.