message stringlengths 2 20.1k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 1.95k 109k | cluster float64 17 17 | __index_level_0__ int64 3.91k 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
Professor GukiZ likes programming contests. He especially likes to rate his students on the contests he prepares. Now, he has decided to prepare a new contest.
In total, n students will attend, and before the start, every one of them has s... | instruction | 0 | 26,926 | 17 | 53,852 |
Tags: brute force, implementation, sortings
Correct Solution:
```
n=int(input());
num=input()
lst=list(map(int,num.split()))
for i in range (0,n,1):
k=1
for j in range (0,n,1):
if(lst[i]<lst[j]):
k+=1
print(k,end=" ")
``` | output | 1 | 26,926 | 17 | 53,853 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Professor GukiZ likes programming contests. He especially likes to rate his students on the contests he prepares. Now, he has decided to prepare a new contest.
In total, n students will attend, and before the start, every one of them has s... | instruction | 0 | 26,927 | 17 | 53,854 |
Tags: brute force, implementation, sortings
Correct Solution:
```
n=int(input())
l2=list(map(int,input().split()))
l=sorted(l2,reverse=True)
s=sorted(list(set(l)),reverse=True)
c=1
l1=[]
for i in s:
for j in range(l.count(i)):
l1.append(c)
c+=l.count(i)
d={}
for k in range(len(l)):
d[l[k]]=l1[k]
for... | output | 1 | 26,927 | 17 | 53,855 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Professor GukiZ likes programming contests. He especially likes to rate his students on the contests he prepares. Now, he has decided to prepare a new contest.
In total, n students will attend, and before the start, every one of them has s... | instruction | 0 | 26,928 | 17 | 53,856 |
Tags: brute force, implementation, sortings
Correct Solution:
```
n=int(input())
l = list(map(int,input().split()))
b =l.copy()
l.sort()
l.reverse()
for i in b:
print(l.index(i)+1,end = " ")
``` | output | 1 | 26,928 | 17 | 53,857 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Everybody knows that the m-coder Tournament will happen soon. m schools participate in the tournament, and only one student from each school participates.
There are a total of n students in those schools. Before the tournament, all students... | instruction | 0 | 27,461 | 17 | 54,922 |
Tags: implementation, sortings
Correct Solution:
```
from collections import defaultdict
n, m, k = map(int, input().split())
p = list(map(int, input().split()))
s = list(map(int, input().split()))
c = list(map(int, input().split()))
schools = defaultdict(lambda : [])
for i in range(0, n):
schools[s[i]].append((p[... | output | 1 | 27,461 | 17 | 54,923 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Everybody knows that the m-coder Tournament will happen soon. m schools participate in the tournament, and only one student from each school participates.
There are a total of n students in those schools. Before the tournament, all students... | instruction | 0 | 27,462 | 17 | 54,924 |
Tags: implementation, sortings
Correct Solution:
```
import sys
input = sys.stdin.readline
n, m, k = map(int, input().split())
p = list(map(int, input().split()))
schools = {}
for i in range(1, m+1):
schools[i] = []
s = list(map(int, input().split()))
for i in range(len(s)):
schools[s[i]].append((p[i], i+1... | output | 1 | 27,462 | 17 | 54,925 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Everybody knows that the m-coder Tournament will happen soon. m schools participate in the tournament, and only one student from each school participates.
There are a total of n students in those schools. Before the tournament, all students... | instruction | 0 | 27,463 | 17 | 54,926 |
Tags: implementation, sortings
Correct Solution:
```
from sys import stdin,stdout
import math
# stdin = open("input.txt", "r");
# stdout = open("output.txt", "w");
n,m,k=stdin.readline().strip().split(' ')
n,m,k=int(n),int(m),int(k)
power =list(map(int,stdin.readline().strip().split(' ')))
school =list(map... | output | 1 | 27,463 | 17 | 54,927 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Everybody knows that the m-coder Tournament will happen soon. m schools participate in the tournament, and only one student from each school participates.
There are a total of n students in those schools. Before the tournament, all students... | instruction | 0 | 27,464 | 17 | 54,928 |
Tags: implementation, sortings
Correct Solution:
```
n, m, k = list(map(int, input().split()))
arr = list(map(int, input().split()))
arr2 = list(map(int, input().split()))
arr3 = list(map(int, input().split()))
ans = {}
count = 0
for z in range(n):
if arr2[z] in ans:
ans[arr2[z]].append([arr[z], z+1])
e... | output | 1 | 27,464 | 17 | 54,929 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Everybody knows that the m-coder Tournament will happen soon. m schools participate in the tournament, and only one student from each school participates.
There are a total of n students in those schools. Before the tournament, all students... | instruction | 0 | 27,465 | 17 | 54,930 |
Tags: implementation, sortings
Correct Solution:
```
n, m, k = map(int, input().split())
powers = list(map(int, input().split()))
schools = list(map(int, input().split()))
choosenones = list(map(int, input().split()))
most_power = [0] * (m+1)
students = zip(powers, schools)
for power, school in students:
most_pow... | output | 1 | 27,465 | 17 | 54,931 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Everybody knows that the m-coder Tournament will happen soon. m schools participate in the tournament, and only one student from each school participates.
There are a total of n students in those schools. Before the tournament, all students... | instruction | 0 | 27,466 | 17 | 54,932 |
Tags: implementation, sortings
Correct Solution:
```
def get_maxPower_fromSchool(school_num):
max_ = 0
max_index = 0
for j in range(n):
if (school_array[j] == school_num and power_array[j] > max_):
max_ = power_array[j]
max_index = j
return max_
n, m, k = input().split(... | output | 1 | 27,466 | 17 | 54,933 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Everybody knows that the m-coder Tournament will happen soon. m schools participate in the tournament, and only one student from each school participates.
There are a total of n students in those schools. Before the tournament, all students... | instruction | 0 | 27,467 | 17 | 54,934 |
Tags: implementation, sortings
Correct Solution:
```
def TechnogobletofFire(n,m,k,p,s,c):
maxId = [0] * (m+1)
maxPower = [0] * (m+1)
i=0
while i<n:
if(maxPower[s[i]]<p[i]):
maxPower[s[i]] = p[i]
maxId[s[i]] = i+1
i+=1
res = 0
for element in c:
if element in maxId:
continue
else:
res+=1
re... | output | 1 | 27,467 | 17 | 54,935 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Everybody knows that the m-coder Tournament will happen soon. m schools participate in the tournament, and only one student from each school participates.
There are a total of n students in those schools. Before the tournament, all students... | instruction | 0 | 27,468 | 17 | 54,936 |
Tags: implementation, sortings
Correct Solution:
```
import sys
import math
from collections import defaultdict
def solve(n, m, k, p, s, c):
best = [float('-inf')] * m
for i in range(n):
best[s[i] - 1] = max(best[s[i] - 1], p[i])
res = 0
for ci in c:
if best[s[ci - 1] - 1] != p[ci - 1]... | output | 1 | 27,468 | 17 | 54,937 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Everybody knows that the m-coder Tournament will happen soon. m schools participate in the tournament, and only one student from each school participates.
There are a total of n students in tho... | instruction | 0 | 27,469 | 17 | 54,938 |
Yes | output | 1 | 27,469 | 17 | 54,939 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Everybody knows that the m-coder Tournament will happen soon. m schools participate in the tournament, and only one student from each school participates.
There are a total of n students in tho... | instruction | 0 | 27,470 | 17 | 54,940 |
Yes | output | 1 | 27,470 | 17 | 54,941 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Everybody knows that the m-coder Tournament will happen soon. m schools participate in the tournament, and only one student from each school participates.
There are a total of n students in tho... | instruction | 0 | 27,471 | 17 | 54,942 |
Yes | output | 1 | 27,471 | 17 | 54,943 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Everybody knows that the m-coder Tournament will happen soon. m schools participate in the tournament, and only one student from each school participates.
There are a total of n students in tho... | instruction | 0 | 27,472 | 17 | 54,944 |
Yes | output | 1 | 27,472 | 17 | 54,945 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Everybody knows that the m-coder Tournament will happen soon. m schools participate in the tournament, and only one student from each school participates.
There are a total of n students in tho... | instruction | 0 | 27,473 | 17 | 54,946 |
No | output | 1 | 27,473 | 17 | 54,947 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Everybody knows that the m-coder Tournament will happen soon. m schools participate in the tournament, and only one student from each school participates.
There are a total of n students in tho... | instruction | 0 | 27,474 | 17 | 54,948 |
No | output | 1 | 27,474 | 17 | 54,949 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Everybody knows that the m-coder Tournament will happen soon. m schools participate in the tournament, and only one student from each school participates.
There are a total of n students in tho... | instruction | 0 | 27,475 | 17 | 54,950 |
No | output | 1 | 27,475 | 17 | 54,951 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Everybody knows that the m-coder Tournament will happen soon. m schools participate in the tournament, and only one student from each school participates.
There are a total of n students in tho... | instruction | 0 | 27,476 | 17 | 54,952 |
No | output | 1 | 27,476 | 17 | 54,953 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The biggest event of the year β Cota 2 world championship "The Innernational" is right around the corner. 2^n teams will compete in a double-elimination format (please, carefully read problem st... | instruction | 0 | 27,561 | 17 | 55,122 |
No | output | 1 | 27,561 | 17 | 55,123 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The biggest event of the year β Cota 2 world championship "The Innernational" is right around the corner. 2^n teams will compete in a double-elimination format (please, carefully read problem st... | instruction | 0 | 27,562 | 17 | 55,124 |
No | output | 1 | 27,562 | 17 | 55,125 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Another programming contest is over. You got hold of the contest's final results table. The table has the following data. For each team we are shown two numbers: the number of problems and the total penalty time. However, for no team we are ... | instruction | 0 | 27,697 | 17 | 55,394 |
Tags: binary search, implementation, sortings
Correct Solution:
```
n,k=map(int,input().split())
a=tuple()
for i in range(n):
x,y=map(int,input().split())
a+=((x,y),)
a=sorted(a,key = lambda x: x[1])
a=a[::-1]
a=sorted(a,key = lambda x: x[0])
a=a[::-1]
c=a.count(a[k-1])
print(c)
``` | output | 1 | 27,697 | 17 | 55,395 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Another programming contest is over. You got hold of the contest's final results table. The table has the following data. For each team we are shown two numbers: the number of problems and the total penalty time. However, for no team we are ... | instruction | 0 | 27,698 | 17 | 55,396 |
Tags: binary search, implementation, sortings
Correct Solution:
```
import os
import sys
from io import BytesIO, IOBase
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd = file.fileno()
self.buffer = BytesIO()
self.writable = "x" in file.mode or "r"... | output | 1 | 27,698 | 17 | 55,397 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Another programming contest is over. You got hold of the contest's final results table. The table has the following data. For each team we are shown two numbers: the number of problems and the total penalty time. However, for no team we are ... | instruction | 0 | 27,699 | 17 | 55,398 |
Tags: binary search, implementation, sortings
Correct Solution:
```
n, k = map(int, input().split())
p = []
t = []
for i in range(n):
pi, ti = map(int, input().split())
p.append(pi)
t.append(ti)
for j in range(len(p)):
if pi > p[j]:
p.insert(j, pi)
p.pop()
t.insert(j, ti)
t.pop()
break
elif pi ... | output | 1 | 27,699 | 17 | 55,399 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Another programming contest is over. You got hold of the contest's final results table. The table has the following data. For each team we are shown two numbers: the number of problems and the total penalty time. However, for no team we are ... | instruction | 0 | 27,700 | 17 | 55,400 |
Tags: binary search, implementation, sortings
Correct Solution:
```
n, k = map(int, input().split())
t = []
for _ in range(n):
x, y = map(int, input().split())
t.append((x, y))
t = sorted(t, key = lambda x: x[1], reverse = True)
t = sorted(t, key = lambda x: x[0])
t.reverse()
compare = t[k-1]
count = 0
for x in... | output | 1 | 27,700 | 17 | 55,401 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Another programming contest is over. You got hold of the contest's final results table. The table has the following data. For each team we are shown two numbers: the number of problems and the total penalty time. However, for no team we are ... | instruction | 0 | 27,701 | 17 | 55,402 |
Tags: binary search, implementation, sortings
Correct Solution:
```
import sys
def quicksort(lista,low,high):
if high-low>0:
p=partition(lista,low,high)
quicksort(lista,low,p-1)
quicksort(lista,p+1,high)
return lista
def partition(lista,low,high):
divider,pivot=low,high
for i in range(low,high):
... | output | 1 | 27,701 | 17 | 55,403 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Another programming contest is over. You got hold of the contest's final results table. The table has the following data. For each team we are shown two numbers: the number of problems and the total penalty time. However, for no team we are ... | instruction | 0 | 27,702 | 17 | 55,404 |
Tags: binary search, implementation, sortings
Correct Solution:
```
n,k=map(int,input().split())
l=[]
for i in range(n):
x,y=map(int,input().split())
l.append((x,-y))
l.sort(reverse=True)
#print(l)
#r=l.index(k)
s=k-1
e=k-1
count=0
#print(l[e+1][1])
while(s!=-1 or e!=-1):
if s>=0:
if l[s][0]==l[k-1]... | output | 1 | 27,702 | 17 | 55,405 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Another programming contest is over. You got hold of the contest's final results table. The table has the following data. For each team we are shown two numbers: the number of problems and the total penalty time. However, for no team we are ... | instruction | 0 | 27,703 | 17 | 55,406 |
Tags: binary search, implementation, sortings
Correct Solution:
```
from functools import cmp_to_key
def result_comparator(result1, result2):
if result1[0] > result2[0]:
return -1
elif result1[0] == result2[0]:
return result1[1] - result2[1]
else:
return 1
num_teams, required_pos... | output | 1 | 27,703 | 17 | 55,407 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Another programming contest is over. You got hold of the contest's final results table. The table has the following data. For each team we are shown two numbers: the number of problems and the total penalty time. However, for no team we are ... | instruction | 0 | 27,704 | 17 | 55,408 |
Tags: binary search, implementation, sortings
Correct Solution:
```
def swap1(i):
temp=b[i]
b[i]=b[i+1]
b[i+1]=temp
l = list(map(int, input().rstrip().split()))
b=[]
c=[]
for i in range (l[0]):
a=list(map(int, input().rstrip().split()))
b.append(a)
b.sort(reverse=True)
for j in range(len(b)-1):
... | output | 1 | 27,704 | 17 | 55,409 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Another programming contest is over. You got hold of the contest's final results table. The table has the following data. For each team we are shown two numbers: the number of problems and the t... | instruction | 0 | 27,705 | 17 | 55,410 |
Yes | output | 1 | 27,705 | 17 | 55,411 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Another programming contest is over. You got hold of the contest's final results table. The table has the following data. For each team we are shown two numbers: the number of problems and the t... | instruction | 0 | 27,706 | 17 | 55,412 |
Yes | output | 1 | 27,706 | 17 | 55,413 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Another programming contest is over. You got hold of the contest's final results table. The table has the following data. For each team we are shown two numbers: the number of problems and the t... | instruction | 0 | 27,707 | 17 | 55,414 |
Yes | output | 1 | 27,707 | 17 | 55,415 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Another programming contest is over. You got hold of the contest's final results table. The table has the following data. For each team we are shown two numbers: the number of problems and the t... | instruction | 0 | 27,708 | 17 | 55,416 |
Yes | output | 1 | 27,708 | 17 | 55,417 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Another programming contest is over. You got hold of the contest's final results table. The table has the following data. For each team we are shown two numbers: the number of problems and the t... | instruction | 0 | 27,709 | 17 | 55,418 |
No | output | 1 | 27,709 | 17 | 55,419 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Another programming contest is over. You got hold of the contest's final results table. The table has the following data. For each team we are shown two numbers: the number of problems and the t... | instruction | 0 | 27,710 | 17 | 55,420 |
No | output | 1 | 27,710 | 17 | 55,421 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Another programming contest is over. You got hold of the contest's final results table. The table has the following data. For each team we are shown two numbers: the number of problems and the t... | instruction | 0 | 27,711 | 17 | 55,422 |
No | output | 1 | 27,711 | 17 | 55,423 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Another programming contest is over. You got hold of the contest's final results table. The table has the following data. For each team we are shown two numbers: the number of problems and the t... | instruction | 0 | 27,712 | 17 | 55,424 |
No | output | 1 | 27,712 | 17 | 55,425 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Three swimmers decided to organize a party in the swimming pool! At noon, they started to swim from the left side of the pool.
It takes the first swimmer exactly a minutes to swim across the en... | instruction | 0 | 28,482 | 17 | 56,964 |
Yes | output | 1 | 28,482 | 17 | 56,965 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Three swimmers decided to organize a party in the swimming pool! At noon, they started to swim from the left side of the pool.
It takes the first swimmer exactly a minutes to swim across the en... | instruction | 0 | 28,483 | 17 | 56,966 |
Yes | output | 1 | 28,483 | 17 | 56,967 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Three swimmers decided to organize a party in the swimming pool! At noon, they started to swim from the left side of the pool.
It takes the first swimmer exactly a minutes to swim across the en... | instruction | 0 | 28,484 | 17 | 56,968 |
Yes | output | 1 | 28,484 | 17 | 56,969 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Three swimmers decided to organize a party in the swimming pool! At noon, they started to swim from the left side of the pool.
It takes the first swimmer exactly a minutes to swim across the en... | instruction | 0 | 28,485 | 17 | 56,970 |
Yes | output | 1 | 28,485 | 17 | 56,971 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Three swimmers decided to organize a party in the swimming pool! At noon, they started to swim from the left side of the pool.
It takes the first swimmer exactly a minutes to swim across the en... | instruction | 0 | 28,486 | 17 | 56,972 |
No | output | 1 | 28,486 | 17 | 56,973 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Three swimmers decided to organize a party in the swimming pool! At noon, they started to swim from the left side of the pool.
It takes the first swimmer exactly a minutes to swim across the en... | instruction | 0 | 28,487 | 17 | 56,974 |
No | output | 1 | 28,487 | 17 | 56,975 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Three swimmers decided to organize a party in the swimming pool! At noon, they started to swim from the left side of the pool.
It takes the first swimmer exactly a minutes to swim across the en... | instruction | 0 | 28,488 | 17 | 56,976 |
No | output | 1 | 28,488 | 17 | 56,977 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Three swimmers decided to organize a party in the swimming pool! At noon, they started to swim from the left side of the pool.
It takes the first swimmer exactly a minutes to swim across the en... | instruction | 0 | 28,489 | 17 | 56,978 |
No | output | 1 | 28,489 | 17 | 56,979 |
Provide a correct Python 3 solution for this coding contest problem.
problem
Five students, Taro, Jiro, Saburo, Shiro, and Hanako, participated in the JOI High School class.
In this class, a final exam was conducted. All five people took the final exam. For students with a final exam score of 40 or higher, the final... | instruction | 0 | 29,018 | 17 | 58,036 |
"Correct Solution:
```
s=0
y=[]
for i in range(1,6):
x=int(input())
if x>=40:
y.append(x)
else:
y.append(40)
for i in range(0,5):
s+=y[i]
print(int(s/5))
``` | output | 1 | 29,018 | 17 | 58,037 |
Provide a correct Python 3 solution for this coding contest problem.
problem
Five students, Taro, Jiro, Saburo, Shiro, and Hanako, participated in the JOI High School class.
In this class, a final exam was conducted. All five people took the final exam. For students with a final exam score of 40 or higher, the final... | instruction | 0 | 29,019 | 17 | 58,038 |
"Correct Solution:
```
point=[int(input())for i in range(5)]
t=0
for p in point:
if p<40:t+=40
else:t+=p
print(t//5)
``` | output | 1 | 29,019 | 17 | 58,039 |
Provide a correct Python 3 solution for this coding contest problem.
problem
Five students, Taro, Jiro, Saburo, Shiro, and Hanako, participated in the JOI High School class.
In this class, a final exam was conducted. All five people took the final exam. For students with a final exam score of 40 or higher, the final... | instruction | 0 | 29,020 | 17 | 58,040 |
"Correct Solution:
```
seiseki = []
for a in range(5):
seiseki.append(int(input()))
for b in range(5):
if seiseki[b] < 40:
seiseki[b] = 40
print(sum(seiseki)//5)
``` | output | 1 | 29,020 | 17 | 58,041 |
Provide a correct Python 3 solution for this coding contest problem.
problem
Five students, Taro, Jiro, Saburo, Shiro, and Hanako, participated in the JOI High School class.
In this class, a final exam was conducted. All five people took the final exam. For students with a final exam score of 40 or higher, the final... | instruction | 0 | 29,021 | 17 | 58,042 |
"Correct Solution:
```
def is_odd(n):
return(n<40)
a=int(input())
b=int(input())
c=int(input())
d=int(input())
e=int(input())
m=[a, b, c, d, e]
k=filter(is_odd, m)
t=list(k)
f=len(t)
def is_odd(x):
return(x>=40)
s=filter(is_odd, m)
l=list(s)
print((sum(l)+f*40)//5)
``` | output | 1 | 29,021 | 17 | 58,043 |
Provide a correct Python 3 solution for this coding contest problem.
problem
Five students, Taro, Jiro, Saburo, Shiro, and Hanako, participated in the JOI High School class.
In this class, a final exam was conducted. All five people took the final exam. For students with a final exam score of 40 or higher, the final... | instruction | 0 | 29,022 | 17 | 58,044 |
"Correct Solution:
```
x=0
for i in range(5):
n=int(input())
if n<40:
n=40
#print(n)
x+=n
print(
format(x/5,'.0f')
)
``` | output | 1 | 29,022 | 17 | 58,045 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.