message stringlengths 2 22.7k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 145 109k | cluster float64 9 9 | __index_level_0__ int64 290 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have n gifts and you want to give all of them to children. Of course, you don't want to offend anyone, so all gifts should be equal between each other. The i-th gift consists of a_i candies ... | instruction | 0 | 41,442 | 9 | 82,884 |
Yes | output | 1 | 41,442 | 9 | 82,885 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have n gifts and you want to give all of them to children. Of course, you don't want to offend anyone, so all gifts should be equal between each other. The i-th gift consists of a_i candies ... | instruction | 0 | 41,443 | 9 | 82,886 |
Yes | output | 1 | 41,443 | 9 | 82,887 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have n gifts and you want to give all of them to children. Of course, you don't want to offend anyone, so all gifts should be equal between each other. The i-th gift consists of a_i candies ... | instruction | 0 | 41,444 | 9 | 82,888 |
Yes | output | 1 | 41,444 | 9 | 82,889 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have n gifts and you want to give all of them to children. Of course, you don't want to offend anyone, so all gifts should be equal between each other. The i-th gift consists of a_i candies ... | instruction | 0 | 41,445 | 9 | 82,890 |
No | output | 1 | 41,445 | 9 | 82,891 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have n gifts and you want to give all of them to children. Of course, you don't want to offend anyone, so all gifts should be equal between each other. The i-th gift consists of a_i candies ... | instruction | 0 | 41,446 | 9 | 82,892 |
No | output | 1 | 41,446 | 9 | 82,893 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have n gifts and you want to give all of them to children. Of course, you don't want to offend anyone, so all gifts should be equal between each other. The i-th gift consists of a_i candies ... | instruction | 0 | 41,447 | 9 | 82,894 |
No | output | 1 | 41,447 | 9 | 82,895 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have n gifts and you want to give all of them to children. Of course, you don't want to offend anyone, so all gifts should be equal between each other. The i-th gift consists of a_i candies ... | instruction | 0 | 41,448 | 9 | 82,896 |
No | output | 1 | 41,448 | 9 | 82,897 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Students Vasya and Petya are studying at the BSU (Byteland State University). At one of the breaks they decided to order a pizza. In this problem pizza is a circle of some radius. The pizza was delivered already cut into n pieces. The i-th p... | instruction | 0 | 41,784 | 9 | 83,568 |
Tags: brute force, implementation
Correct Solution:
```
#n,k = map(int, input().strip().split(' '))
n=int(input())
lst = list(map(int, input().strip().split(' ')))
if n==1:
print(lst[0])
elif n==2:
print(abs(lst[1]-lst[0]))
else:
s=360
m=360
lst=lst*2
for i in range(n):
p=0
for... | output | 1 | 41,784 | 9 | 83,569 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Students Vasya and Petya are studying at the BSU (Byteland State University). At one of the breaks they decided to order a pizza. In this problem pizza is a circle of some radius. The pizza was delivered already cut into n pieces. The i-th p... | instruction | 0 | 41,785 | 9 | 83,570 |
Tags: brute force, implementation
Correct Solution:
```
n=int(input())
a=list(map(int,input().split()))
print(2*min(abs(180-sum(a[l:r])) for l in range(n) for r in range(l,n)))
``` | output | 1 | 41,785 | 9 | 83,571 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Students Vasya and Petya are studying at the BSU (Byteland State University). At one of the breaks they decided to order a pizza. In this problem pizza is a circle of some radius. The pizza was delivered already cut into n pieces. The i-th p... | instruction | 0 | 41,786 | 9 | 83,572 |
Tags: brute force, implementation
Correct Solution:
```
n = int(input())
a = list(map(int, input().split()))
maxv = 0
minv = 360
for i in range(0, n):
sum = 0
for j in range(i, n):
sum = sum + a[j]
if(sum > maxv and sum <= 180):
maxv = sum
if(sum < minv and sum >= 180):
minv = sum
print(min(360 - 2 ... | output | 1 | 41,786 | 9 | 83,573 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Students Vasya and Petya are studying at the BSU (Byteland State University). At one of the breaks they decided to order a pizza. In this problem pizza is a circle of some radius. The pizza was delivered already cut into n pieces. The i-th p... | instruction | 0 | 41,787 | 9 | 83,574 |
Tags: brute force, implementation
Correct Solution:
```
n = int(input())
l = [int(x) for x in input().split()]
ans = 360
for i in range(n):
for j in range(i + 1, n):
ans = min(ans, abs(180 - sum(l[i:j])) * 2)
print(ans)
``` | output | 1 | 41,787 | 9 | 83,575 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Students Vasya and Petya are studying at the BSU (Byteland State University). At one of the breaks they decided to order a pizza. In this problem pizza is a circle of some radius. The pizza was delivered already cut into n pieces. The i-th p... | instruction | 0 | 41,788 | 9 | 83,576 |
Tags: brute force, implementation
Correct Solution:
```
n=int(input())
a=list(map(int,input().split()))
#a.sort(reverse=True)
l=0
ans=360
sum1=0
for k in a:
sum1=sum1+k
while(sum1>=180):
ans=min(ans,2*abs(180-sum1))
sum1=sum1-a[l]
l=l+1
ans=min(ans,2*abs(180-sum1))
print(ans)
``... | output | 1 | 41,788 | 9 | 83,577 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Students Vasya and Petya are studying at the BSU (Byteland State University). At one of the breaks they decided to order a pizza. In this problem pizza is a circle of some radius. The pizza was delivered already cut into n pieces. The i-th p... | instruction | 0 | 41,789 | 9 | 83,578 |
Tags: brute force, implementation
Correct Solution:
```
import math
a = int(input())
b = list(map(int, input().split()))
e = 361
if b[0] == 360:
print(360)
else:
for c in range(a - 1):
for d in range(a - 1):
if math.fabs(180 - sum(b[c: -(a - 1 - d)])) * 2 < e:
e = math.fabs(1... | output | 1 | 41,789 | 9 | 83,579 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Students Vasya and Petya are studying at the BSU (Byteland State University). At one of the breaks they decided to order a pizza. In this problem pizza is a circle of some radius. The pizza was delivered already cut into n pieces. The i-th p... | instruction | 0 | 41,790 | 9 | 83,580 |
Tags: brute force, implementation
Correct Solution:
```
n = int(input())
best = 360
tab = list(map(int, input().split()))
pre_sum = [0]
for i in range(1, len(tab) + 1):
pre_sum += [tab[i - 1] + pre_sum[-1]]
for i in range(n + 1):
for j in range(i, n + 1):
best = min([best, 2 * abs(180 - (pre_sum[j]... | output | 1 | 41,790 | 9 | 83,581 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Students Vasya and Petya are studying at the BSU (Byteland State University). At one of the breaks they decided to order a pizza. In this problem pizza is a circle of some radius. The pizza was delivered already cut into n pieces. The i-th p... | instruction | 0 | 41,791 | 9 | 83,582 |
Tags: brute force, implementation
Correct Solution:
```
n = int(input())
l = list(map(int, input().split()))
s = [0]
r_s = [0]
for i in range(n):
s.append(s[-1] + l[i])
r_s.append(r_s[-1] + l[n-1-i])
m = float("inf")
for right_end in range(n):
for left_end in range(n-right_end+1):
if... | output | 1 | 41,791 | 9 | 83,583 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Students Vasya and Petya are studying at the BSU (Byteland State University). At one of the breaks they decided to order a pizza. In this problem pizza is a circle of some radius. The pizza was ... | instruction | 0 | 41,792 | 9 | 83,584 |
Yes | output | 1 | 41,792 | 9 | 83,585 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Students Vasya and Petya are studying at the BSU (Byteland State University). At one of the breaks they decided to order a pizza. In this problem pizza is a circle of some radius. The pizza was ... | instruction | 0 | 41,793 | 9 | 83,586 |
Yes | output | 1 | 41,793 | 9 | 83,587 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Students Vasya and Petya are studying at the BSU (Byteland State University). At one of the breaks they decided to order a pizza. In this problem pizza is a circle of some radius. The pizza was ... | instruction | 0 | 41,794 | 9 | 83,588 |
Yes | output | 1 | 41,794 | 9 | 83,589 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Students Vasya and Petya are studying at the BSU (Byteland State University). At one of the breaks they decided to order a pizza. In this problem pizza is a circle of some radius. The pizza was ... | instruction | 0 | 41,795 | 9 | 83,590 |
Yes | output | 1 | 41,795 | 9 | 83,591 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Students Vasya and Petya are studying at the BSU (Byteland State University). At one of the breaks they decided to order a pizza. In this problem pizza is a circle of some radius. The pizza was ... | instruction | 0 | 41,796 | 9 | 83,592 |
No | output | 1 | 41,796 | 9 | 83,593 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Students Vasya and Petya are studying at the BSU (Byteland State University). At one of the breaks they decided to order a pizza. In this problem pizza is a circle of some radius. The pizza was ... | instruction | 0 | 41,797 | 9 | 83,594 |
No | output | 1 | 41,797 | 9 | 83,595 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Students Vasya and Petya are studying at the BSU (Byteland State University). At one of the breaks they decided to order a pizza. In this problem pizza is a circle of some radius. The pizza was ... | instruction | 0 | 41,798 | 9 | 83,596 |
No | output | 1 | 41,798 | 9 | 83,597 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Students Vasya and Petya are studying at the BSU (Byteland State University). At one of the breaks they decided to order a pizza. In this problem pizza is a circle of some radius. The pizza was ... | instruction | 0 | 41,799 | 9 | 83,598 |
No | output | 1 | 41,799 | 9 | 83,599 |
Provide a correct Python 3 solution for this coding contest problem.
There are N pieces of sushi. Each piece has two parameters: "kind of topping" t_i and "deliciousness" d_i. You are choosing K among these N pieces to eat. Your "satisfaction" here will be calculated as follows:
* The satisfaction is the sum of the "... | instruction | 0 | 42,704 | 9 | 85,408 |
"Correct Solution:
```
N, K = [int(_) for _ in input().split()]
TD = [[int(_) for _ in input().split()] for i in range(N)]
# print(TD)
xs = sorted(TD, key=lambda x:-x[1])
#print(xs)
baset = 0
ts = set()
ds = []
for t, d in xs[:K]:
baset += d
if not t in ts:
ts.add(t)
else:
ds.appen... | output | 1 | 42,704 | 9 | 85,409 |
Provide a correct Python 3 solution for this coding contest problem.
There are N pieces of sushi. Each piece has two parameters: "kind of topping" t_i and "deliciousness" d_i. You are choosing K among these N pieces to eat. Your "satisfaction" here will be calculated as follows:
* The satisfaction is the sum of the "... | instruction | 0 | 42,705 | 9 | 85,410 |
"Correct Solution:
```
N,K=map(int,input().split())
l=[] # 寿司リスト。ただし，「おいしさ」を第1要素にする
m=[] # 寿司タプルをそのまま入れる
s=set()
for i in range(N):
t,d=map(int,input().split())
l.append((d,t))
l.sort(reverse=True)
ans=K**2
t=0 # 既に食べたことのある種類の寿司を更に食べた回数
i=0 # l内を走査する際の添字
j=0 # m内を操作する際の添え字
for _ in range(K): # _番目に食べる寿司につ... | output | 1 | 42,705 | 9 | 85,411 |
Provide a correct Python 3 solution for this coding contest problem.
There are N pieces of sushi. Each piece has two parameters: "kind of topping" t_i and "deliciousness" d_i. You are choosing K among these N pieces to eat. Your "satisfaction" here will be calculated as follows:
* The satisfaction is the sum of the "... | instruction | 0 | 42,706 | 9 | 85,412 |
"Correct Solution:
```
import heapq
from operator import itemgetter
n, k = map(int, input().split())
sushi = [tuple(map(int, input().split())) for _ in range(n)]
sushi.sort(key=itemgetter(1), reverse=True)
que = []
kind = set()
res = 0
for t, d in sushi[:k]:
if t in kind:
heapq.heappush(que, d)
else:
... | output | 1 | 42,706 | 9 | 85,413 |
Provide a correct Python 3 solution for this coding contest problem.
There are N pieces of sushi. Each piece has two parameters: "kind of topping" t_i and "deliciousness" d_i. You are choosing K among these N pieces to eat. Your "satisfaction" here will be calculated as follows:
* The satisfaction is the sum of the "... | instruction | 0 | 42,707 | 9 | 85,414 |
"Correct Solution:
```
import heapq as h;I=lambda:list(map(int,input().split()));n,k=I();z=[i*2+1for i in range(n)];s=sorted([I()for _ in[0]*n],key=lambda x:-x[1]);q=[];v=A=0;l=[0]*-~n
for a,b in s[:k]:
if l[a]:h.heappush(q,b)
else:A+=z[v];v+=1
l[a]=1;A+=b
T=A
for a,b in s[k:]:
if l[a]^1and q:l[a]=1;T+=b+z[v]-h.hea... | output | 1 | 42,707 | 9 | 85,415 |
Provide a correct Python 3 solution for this coding contest problem.
There are N pieces of sushi. Each piece has two parameters: "kind of topping" t_i and "deliciousness" d_i. You are choosing K among these N pieces to eat. Your "satisfaction" here will be calculated as follows:
* The satisfaction is the sum of the "... | instruction | 0 | 42,708 | 9 | 85,416 |
"Correct Solution:
```
N, K = map(int, input().split())
td = [list(map(int, input().split()))
for _ in range(N)]
td.sort(key=lambda x: -x[1])
q = []
v = set()
sd = 0
for t, d in td[:K]:
sd += d
if t in v:
q.append(d)
v.add(t)
ans = len(v) ** 2 + sd
for t, d in td[K:]:
if 0 >= len(q):
... | output | 1 | 42,708 | 9 | 85,417 |
Provide a correct Python 3 solution for this coding contest problem.
There are N pieces of sushi. Each piece has two parameters: "kind of topping" t_i and "deliciousness" d_i. You are choosing K among these N pieces to eat. Your "satisfaction" here will be calculated as follows:
* The satisfaction is the sum of the "... | instruction | 0 | 42,709 | 9 | 85,418 |
"Correct Solution:
```
N, K = map(int, input().split())
menu_ = []
for i in range(N):
t, d = map(int, input().split())
menu_.append((t, d))
menu = sorted(menu_, key = lambda x:x[1], reverse=True)
neta = set()
duplicates = []
for m in menu[:K]:
if m[0] in neta:
duplicates.append(m[1])
else:
... | output | 1 | 42,709 | 9 | 85,419 |
Provide a correct Python 3 solution for this coding contest problem.
There are N pieces of sushi. Each piece has two parameters: "kind of topping" t_i and "deliciousness" d_i. You are choosing K among these N pieces to eat. Your "satisfaction" here will be calculated as follows:
* The satisfaction is the sum of the "... | instruction | 0 | 42,710 | 9 | 85,420 |
"Correct Solution:
```
n,k=map(int,input().split())
TD=[]
for i in range(n):
t,d=map(int,input().split())
TD.append([t,d])
TD.sort(key=lambda x:x[1],reverse=True)
V=set()
S=[]
ans=0
for t,d in TD[:k]:
ans+=d
if t in V:
S.append(d)
else:
V.add(t)
ans+=len(V)**2
x=ans
for t,d in TD[k:]:
if S==[]:
... | output | 1 | 42,710 | 9 | 85,421 |
Provide a correct Python 3 solution for this coding contest problem.
There are N pieces of sushi. Each piece has two parameters: "kind of topping" t_i and "deliciousness" d_i. You are choosing K among these N pieces to eat. Your "satisfaction" here will be calculated as follows:
* The satisfaction is the sum of the "... | instruction | 0 | 42,711 | 9 | 85,422 |
"Correct Solution:
```
n,k=[int(x) for x in input().split()]
A=[]
for i in range(n):
a,b=[int(x) for x in input().split()]
A.append([b,a,True])
A.sort(reverse=True)
typ=set()
for i in range(n):
if A[i][1] in typ:
A[i][2]=False
else:
typ.add(A[i][1])
num=0
for j in range(k):
if A[j][2]==True:
... | output | 1 | 42,711 | 9 | 85,423 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N pieces of sushi. Each piece has two parameters: "kind of topping" t_i and "deliciousness" d_i. You are choosing K among these N pieces to eat. Your "satisfaction" here will be calcul... | instruction | 0 | 42,712 | 9 | 85,424 |
Yes | output | 1 | 42,712 | 9 | 85,425 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N pieces of sushi. Each piece has two parameters: "kind of topping" t_i and "deliciousness" d_i. You are choosing K among these N pieces to eat. Your "satisfaction" here will be calcul... | instruction | 0 | 42,713 | 9 | 85,426 |
Yes | output | 1 | 42,713 | 9 | 85,427 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N pieces of sushi. Each piece has two parameters: "kind of topping" t_i and "deliciousness" d_i. You are choosing K among these N pieces to eat. Your "satisfaction" here will be calcul... | instruction | 0 | 42,714 | 9 | 85,428 |
Yes | output | 1 | 42,714 | 9 | 85,429 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N pieces of sushi. Each piece has two parameters: "kind of topping" t_i and "deliciousness" d_i. You are choosing K among these N pieces to eat. Your "satisfaction" here will be calcul... | instruction | 0 | 42,715 | 9 | 85,430 |
Yes | output | 1 | 42,715 | 9 | 85,431 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N pieces of sushi. Each piece has two parameters: "kind of topping" t_i and "deliciousness" d_i. You are choosing K among these N pieces to eat. Your "satisfaction" here will be calcul... | instruction | 0 | 42,716 | 9 | 85,432 |
No | output | 1 | 42,716 | 9 | 85,433 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N pieces of sushi. Each piece has two parameters: "kind of topping" t_i and "deliciousness" d_i. You are choosing K among these N pieces to eat. Your "satisfaction" here will be calcul... | instruction | 0 | 42,717 | 9 | 85,434 |
No | output | 1 | 42,717 | 9 | 85,435 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N pieces of sushi. Each piece has two parameters: "kind of topping" t_i and "deliciousness" d_i. You are choosing K among these N pieces to eat. Your "satisfaction" here will be calcul... | instruction | 0 | 42,718 | 9 | 85,436 |
No | output | 1 | 42,718 | 9 | 85,437 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N pieces of sushi. Each piece has two parameters: "kind of topping" t_i and "deliciousness" d_i. You are choosing K among these N pieces to eat. Your "satisfaction" here will be calcul... | instruction | 0 | 42,719 | 9 | 85,438 |
No | output | 1 | 42,719 | 9 | 85,439 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
problem
At the JOI pasta shop, the recommended pasta for lunch and the set menu of freshly squeezed juice are popular. When ordering this set menu, choose one from each of the three pasta and t... | instruction | 0 | 42,839 | 9 | 85,678 |
Yes | output | 1 | 42,839 | 9 | 85,679 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
problem
At the JOI pasta shop, the recommended pasta for lunch and the set menu of freshly squeezed juice are popular. When ordering this set menu, choose one from each of the three pasta and t... | instruction | 0 | 42,842 | 9 | 85,684 |
Yes | output | 1 | 42,842 | 9 | 85,685 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Vasya loves orange juice very much. That's why any food and drink in his kitchen necessarily contains orange juice. There are n drinks in his fridge, the volume fraction of orange juice in the i-th drink equals pi percent.
One day Va... | instruction | 0 | 44,092 | 9 | 88,184 |
Tags: implementation, math
Correct Solution:
```
n = int(input())
a = [int(x) for x in input().split()]
print('{:.12f}'.format(sum(a)/n))
``` | output | 1 | 44,092 | 9 | 88,185 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Vasya loves orange juice very much. That's why any food and drink in his kitchen necessarily contains orange juice. There are n drinks in his fridge, the volume fraction of orange juice in the i-th drink equals pi percent.
One day Va... | instruction | 0 | 44,093 | 9 | 88,186 |
Tags: implementation, math
Correct Solution:
```
n=int(input())
l=[int(x) for x in input().rstrip().split(' ')]
x=0
for i in range(n):
x=x+(l[i]/100)
x=(x/n)*100
print('%.12f'%x)
``` | output | 1 | 44,093 | 9 | 88,187 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Vasya loves orange juice very much. That's why any food and drink in his kitchen necessarily contains orange juice. There are n drinks in his fridge, the volume fraction of orange juice in the i-th drink equals pi percent.
One day Va... | instruction | 0 | 44,094 | 9 | 88,188 |
Tags: implementation, math
Correct Solution:
```
n=int(input())
x=list(map(int,input().split()))
tp=0
for i in x:
tp+=i/100
tot=(tp/n)*100
print('%.10f'%tot)
``` | output | 1 | 44,094 | 9 | 88,189 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Vasya loves orange juice very much. That's why any food and drink in his kitchen necessarily contains orange juice. There are n drinks in his fridge, the volume fraction of orange juice in the i-th drink equals pi percent.
One day Va... | instruction | 0 | 44,095 | 9 | 88,190 |
Tags: implementation, math
Correct Solution:
```
a = int(input())
l = list(map(int, input().split()))
print(round(sum(l) / a, 6))
``` | output | 1 | 44,095 | 9 | 88,191 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Vasya loves orange juice very much. That's why any food and drink in his kitchen necessarily contains orange juice. There are n drinks in his fridge, the volume fraction of orange juice in the i-th drink equals pi percent.
One day Va... | instruction | 0 | 44,096 | 9 | 88,192 |
Tags: implementation, math
Correct Solution:
```
n = int(input())
li = list(map(int, input().split()))
avg = sum(li) / (len(li) * 100)
print('{0:.12f}'.format(round(avg * 100, 12)))
``` | output | 1 | 44,096 | 9 | 88,193 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Vasya loves orange juice very much. That's why any food and drink in his kitchen necessarily contains orange juice. There are n drinks in his fridge, the volume fraction of orange juice in the i-th drink equals pi percent.
One day Va... | instruction | 0 | 44,097 | 9 | 88,194 |
Tags: implementation, math
Correct Solution:
```
n=input()
n=int(n)
a=input().split()
s=0
for i in range (0,n):
s=s+int(a[i])
print(format(s/n,'.5f'))
``` | output | 1 | 44,097 | 9 | 88,195 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Vasya loves orange juice very much. That's why any food and drink in his kitchen necessarily contains orange juice. There are n drinks in his fridge, the volume fraction of orange juice in the i-th drink equals pi percent.
One day Va... | instruction | 0 | 44,098 | 9 | 88,196 |
Tags: implementation, math
Correct Solution:
```
n=int(input())
a=[int(x) for x in input().split()]
print(sum(a)/n)
``` | output | 1 | 44,098 | 9 | 88,197 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Vasya loves orange juice very much. That's why any food and drink in his kitchen necessarily contains orange juice. There are n drinks in his fridge, the volume fraction of orange juice in the i-th drink equals pi percent.
One day Va... | instruction | 0 | 44,099 | 9 | 88,198 |
Tags: implementation, math
Correct Solution:
```
n=int(input())
arr=list(map(int,input().split()))
s=sum(arr)
print(s/n)
``` | output | 1 | 44,099 | 9 | 88,199 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Vasya loves orange juice very much. That's why any food and drink in his kitchen necessarily contains orange juice. There are n drinks in his fridge, the volume fraction of orange juice i... | instruction | 0 | 44,100 | 9 | 88,200 |
Yes | output | 1 | 44,100 | 9 | 88,201 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.