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 |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Two boys decided to compete in text typing on the site "Key races". During the competition, they have to type a text consisting of s characters. The first participant types one character in v1 m... | instruction | 0 | 60,329 | 17 | 120,658 |
No | output | 1 | 60,329 | 17 | 120,659 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Two boys decided to compete in text typing on the site "Key races". During the competition, they have to type a text consisting of s characters. The first participant types one character in v1 m... | instruction | 0 | 60,330 | 17 | 120,660 |
No | output | 1 | 60,330 | 17 | 120,661 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Two boys decided to compete in text typing on the site "Key races". During the competition, they have to type a text consisting of s characters. The first participant types one character in v1 m... | instruction | 0 | 60,331 | 17 | 120,662 |
No | output | 1 | 60,331 | 17 | 120,663 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The nation of Panel holds an annual show called The Number Games, where each district in the nation will be represented by one contestant.
The nation has n districts numbered from 1 to n, each ... | instruction | 0 | 60,369 | 17 | 120,738 |
No | output | 1 | 60,369 | 17 | 120,739 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The nation of Panel holds an annual show called The Number Games, where each district in the nation will be represented by one contestant.
The nation has n districts numbered from 1 to n, each ... | instruction | 0 | 60,370 | 17 | 120,740 |
No | output | 1 | 60,370 | 17 | 120,741 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The nation of Panel holds an annual show called The Number Games, where each district in the nation will be represented by one contestant.
The nation has n districts numbered from 1 to n, each ... | instruction | 0 | 60,371 | 17 | 120,742 |
No | output | 1 | 60,371 | 17 | 120,743 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The nation of Panel holds an annual show called The Number Games, where each district in the nation will be represented by one contestant.
The nation has n districts numbered from 1 to n, each ... | instruction | 0 | 60,372 | 17 | 120,744 |
No | output | 1 | 60,372 | 17 | 120,745 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Consider a football tournament where n teams participate. Each team has two football kits: for home games, and for away games. The kit for home games of the i-th team has color xi and the kit for away games of this team has color yi (xi ≠ yi... | instruction | 0 | 61,031 | 17 | 122,062 |
Tags: brute force, greedy, implementation
Correct Solution:
```
# -*- coding: utf-8 -*-
def main():
n = int(input())
teams = [input().split() for _ in range(n)]
ans = [list((0, 0)) for _ in range(n)]
home = dict()
for i in range(n):
home[teams[i][0]] = home.get(teams[i][0], 0) + 1
fo... | output | 1 | 61,031 | 17 | 122,063 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Consider a football tournament where n teams participate. Each team has two football kits: for home games, and for away games. The kit for home games of the i-th team has color xi and the kit for away games of this team has color yi (xi ≠ yi... | instruction | 0 | 61,032 | 17 | 122,064 |
Tags: brute force, greedy, implementation
Correct Solution:
```
from sys import stdin
n = int(stdin.readline().rstrip())
h= [0]*(10**5 + 6)
a = [0]*(n+1)
for i in range(n):
l = list(map(int, stdin.readline().rstrip().split(" ")))
h[l[0]]+=1
a[i+1]=l[1]
for i in range(1,n+1):
print(n-1 + h[a[i]] , 2*n ... | output | 1 | 61,032 | 17 | 122,065 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Consider a football tournament where n teams participate. Each team has two football kits: for home games, and for away games. The kit for home games of the i-th team has color xi and the kit for away games of this team has color yi (xi ≠ yi... | instruction | 0 | 61,033 | 17 | 122,066 |
Tags: brute force, greedy, implementation
Correct Solution:
```
import sys
import math
n = int(sys.stdin.readline())
a = [0] * 100000
d = []
for i in range(n):
h, g = [int(x) for x in (sys.stdin.readline()).split()]
d.append(g - 1)
a[h - 1] += 1
for i in d:
print(str((n - 1) + (a[i])) + " " + str... | output | 1 | 61,033 | 17 | 122,067 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Consider a football tournament where n teams participate. Each team has two football kits: for home games, and for away games. The kit for home games of the i-th team has color xi and the kit for away games of this team has color yi (xi ≠ yi... | instruction | 0 | 61,034 | 17 | 122,068 |
Tags: brute force, greedy, implementation
Correct Solution:
```
n = int(input())
i = 0
l1 = list()
l2 = list()
l3 = [0] + [0] * 10**5
l4 = [0] + [0] * 10**5
i = 0
while i < n:
x, y = map(int,input().split())
l1.append(x)
l2.append(y)
l3[x] += 1
l4[y] += 1
i += 1
i = 0
for i in range(n):
pri... | output | 1 | 61,034 | 17 | 122,069 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Consider a football tournament where n teams participate. Each team has two football kits: for home games, and for away games. The kit for home games of the i-th team has color xi and the kit for away games of this team has color yi (xi ≠ yi... | instruction | 0 | 61,035 | 17 | 122,070 |
Tags: brute force, greedy, implementation
Correct Solution:
```
n = int(input())
home_color_teams = [[] for _ in range(10**5 + 5)]
away_color_teams = [[] for _ in range(10**5 + 5)]
for i in range(n):
xi, yi = map(int, input().split())
home_color_teams[xi].append(i)
away_color_teams[yi].append(i)
home_color_count = ... | output | 1 | 61,035 | 17 | 122,071 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Consider a football tournament where n teams participate. Each team has two football kits: for home games, and for away games. The kit for home games of the i-th team has color xi and the kit for away games of this team has color yi (xi ≠ yi... | instruction | 0 | 61,036 | 17 | 122,072 |
Tags: brute force, greedy, implementation
Correct Solution:
```
from collections import Counter
n = int(input())
x, y = [], []
for i in range(n):
a, b = map(int, input().split())
x.append(a)
y.append(b)
home = Counter(x)
away = Counter(y)
ans = 0
mHome, mAway = [n-1]*n, [n-1]*n
for i in range(n):
if y[i... | output | 1 | 61,036 | 17 | 122,073 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Consider a football tournament where n teams participate. Each team has two football kits: for home games, and for away games. The kit for home games of the i-th team has color xi and the kit for away games of this team has color yi (xi ≠ yi... | instruction | 0 | 61,037 | 17 | 122,074 |
Tags: brute force, greedy, implementation
Correct Solution:
```
"""http://codeforces.com/problemset/problem/432/B"""
from collections import Counter
# from sys import stdin
# _data = iter(stdin.read().split('\n'))
# input = lambda: next(_data)
if __name__ == '__main__':
n = int(input())
# arr = [list(map(int,... | output | 1 | 61,037 | 17 | 122,075 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Consider a football tournament where n teams participate. Each team has two football kits: for home games, and for away games. The kit for home games of the i-th team has color xi and the kit for away games of this team has color yi (xi ≠ yi... | instruction | 0 | 61,038 | 17 | 122,076 |
Tags: brute force, greedy, implementation
Correct Solution:
```
n=int(input())
x=[]
for i in range(n):
x.append(list(map(int,input().split())))
h={}
a={}
for i in range(n):
if(h.get(str(x[i][0]))):
h[str(x[i][0])]+=1
else:
h[str(x[i][0])]=1
for i in range(n):
home=n-1
if(h.get... | output | 1 | 61,038 | 17 | 122,077 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider a football tournament where n teams participate. Each team has two football kits: for home games, and for away games. The kit for home games of the i-th team has color xi and the kit fo... | instruction | 0 | 61,039 | 17 | 122,078 |
Yes | output | 1 | 61,039 | 17 | 122,079 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider a football tournament where n teams participate. Each team has two football kits: for home games, and for away games. The kit for home games of the i-th team has color xi and the kit fo... | instruction | 0 | 61,040 | 17 | 122,080 |
Yes | output | 1 | 61,040 | 17 | 122,081 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider a football tournament where n teams participate. Each team has two football kits: for home games, and for away games. The kit for home games of the i-th team has color xi and the kit fo... | instruction | 0 | 61,041 | 17 | 122,082 |
Yes | output | 1 | 61,041 | 17 | 122,083 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider a football tournament where n teams participate. Each team has two football kits: for home games, and for away games. The kit for home games of the i-th team has color xi and the kit fo... | instruction | 0 | 61,042 | 17 | 122,084 |
Yes | output | 1 | 61,042 | 17 | 122,085 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider a football tournament where n teams participate. Each team has two football kits: for home games, and for away games. The kit for home games of the i-th team has color xi and the kit fo... | instruction | 0 | 61,043 | 17 | 122,086 |
No | output | 1 | 61,043 | 17 | 122,087 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider a football tournament where n teams participate. Each team has two football kits: for home games, and for away games. The kit for home games of the i-th team has color xi and the kit fo... | instruction | 0 | 61,044 | 17 | 122,088 |
No | output | 1 | 61,044 | 17 | 122,089 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider a football tournament where n teams participate. Each team has two football kits: for home games, and for away games. The kit for home games of the i-th team has color xi and the kit fo... | instruction | 0 | 61,045 | 17 | 122,090 |
No | output | 1 | 61,045 | 17 | 122,091 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider a football tournament where n teams participate. Each team has two football kits: for home games, and for away games. The kit for home games of the i-th team has color xi and the kit fo... | instruction | 0 | 61,046 | 17 | 122,092 |
No | output | 1 | 61,046 | 17 | 122,093 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The School №0 of the capital of Berland has n children studying in it. All the children in this school are gifted: some of them are good at programming, some are good at maths, others are good at PE (Physical Education). Hence, for each chil... | instruction | 0 | 61,824 | 17 | 123,648 |
Tags: greedy, implementation, sortings
Correct Solution:
```
x = int(input())
y = input().split()
team = min(y.count('1'),y.count('2'),y.count('3'))
print(team)
for i in range(team):
a = y.index('1')
b = y.index('2')
c = y.index('3')
print(a+1,b+1,c+1)
y[a] , y[b] , y[c] = 0,0,0
``` | output | 1 | 61,824 | 17 | 123,649 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The School №0 of the capital of Berland has n children studying in it. All the children in this school are gifted: some of them are good at programming, some are good at maths, others are good at PE (Physical Education). Hence, for each chil... | instruction | 0 | 61,825 | 17 | 123,650 |
Tags: greedy, implementation, sortings
Correct Solution:
```
import sys
n = sys.stdin.readline()
while n:
students = sys.stdin.readline().split()
s1 = []
s2 = []
s3 = []
total_1 = 0
total_2 = 0
total_3 = 0
for i, s in enumerate(students):
if s == '1':
s1.append(i+1)... | output | 1 | 61,825 | 17 | 123,651 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The School №0 of the capital of Berland has n children studying in it. All the children in this school are gifted: some of them are good at programming, some are good at maths, others are good at PE (Physical Education). Hence, for each chil... | instruction | 0 | 61,826 | 17 | 123,652 |
Tags: greedy, implementation, sortings
Correct Solution:
```
#!/usr/bin/env python
# coding=utf-8
input_s = int(input())
input_l = input().split(' ')
result_list = [[], [], []]
for (index, l) in enumerate(input_l):
num_l = int(l)
result_list[num_l - 1].append(index + 1)
j = min(len(result_list[0]), len(result_... | output | 1 | 61,826 | 17 | 123,653 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The School №0 of the capital of Berland has n children studying in it. All the children in this school are gifted: some of them are good at programming, some are good at maths, others are good at PE (Physical Education). Hence, for each chil... | instruction | 0 | 61,827 | 17 | 123,654 |
Tags: greedy, implementation, sortings
Correct Solution:
```
#X'OTWOD
t=int(input());a=[];b=[];c=[];o=[];
o=list(map(int,input().split()))
for j in range(1,t+1):
if o[j-1]==1:a.append(j)
elif o[j-1]==2:b.append(j)
else:c.append(j)
m=min(len(a),len(b),len(c))
print(m)
for i in range(m):
print(f'{a[i]} {b... | output | 1 | 61,827 | 17 | 123,655 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The School №0 of the capital of Berland has n children studying in it. All the children in this school are gifted: some of them are good at programming, some are good at maths, others are good at PE (Physical Education). Hence, for each chil... | instruction | 0 | 61,828 | 17 | 123,656 |
Tags: greedy, implementation, sortings
Correct Solution:
```
import sys
from collections import Counter
number=int(sys.stdin.readline().strip())
skill=list(map(int,sys.stdin.readline().strip().split()))
if len(set(skill))==3:
team=min(Counter(skill).values())
else:
team=0
Lst=[]
for k,n in enumerate(skill):
Lst.appe... | output | 1 | 61,828 | 17 | 123,657 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The School №0 of the capital of Berland has n children studying in it. All the children in this school are gifted: some of them are good at programming, some are good at maths, others are good at PE (Physical Education). Hence, for each chil... | instruction | 0 | 61,829 | 17 | 123,658 |
Tags: greedy, implementation, sortings
Correct Solution:
```
n = int(input())
arr = list(map(int, input().split()))
res = [[], [], []]
for j, i in enumerate(arr):
if i:
res[i-1].append(j + 1)
x = min(map(len, res))
print(x)
for i in range(x):
print(res[0][i], res[1][i], res[2][i])
``` | output | 1 | 61,829 | 17 | 123,659 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The School №0 of the capital of Berland has n children studying in it. All the children in this school are gifted: some of them are good at programming, some are good at maths, others are good at PE (Physical Education). Hence, for each chil... | instruction | 0 | 61,830 | 17 | 123,660 |
Tags: greedy, implementation, sortings
Correct Solution:
```
n=int(input())
t=list(map(int,input().split()))
a=min(t.count(1),t.count(2),t.count(3))
print(a)
l1=[]
l2=[]
l3=[]
for i in range(n):
if t[i]==1:
l1.append(i+1)
elif t[i]==2:
l2.append(i+1)
else:
l3.append(i+1)
if a>0:
... | output | 1 | 61,830 | 17 | 123,661 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The School №0 of the capital of Berland has n children studying in it. All the children in this school are gifted: some of them are good at programming, some are good at maths, others are good at PE (Physical Education). Hence, for each chil... | instruction | 0 | 61,831 | 17 | 123,662 |
Tags: greedy, implementation, sortings
Correct Solution:
```
import sys
import math
input = sys.stdin.readline
n = int(input())
a = map(int, input().split())
l = [[], [], []]
for i, ai in enumerate(a, 1):
l[ai-1].append(i)
print(min(len(l[0]),len(l[1]),len(l[2])))
for j in zip(*l):
print(' '.join(map(str, ... | output | 1 | 61,831 | 17 | 123,663 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The School №0 of the capital of Berland has n children studying in it. All the children in this school are gifted: some of them are good at programming, some are good at maths, others are good a... | instruction | 0 | 61,832 | 17 | 123,664 |
Yes | output | 1 | 61,832 | 17 | 123,665 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The School №0 of the capital of Berland has n children studying in it. All the children in this school are gifted: some of them are good at programming, some are good at maths, others are good a... | instruction | 0 | 61,833 | 17 | 123,666 |
Yes | output | 1 | 61,833 | 17 | 123,667 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The School №0 of the capital of Berland has n children studying in it. All the children in this school are gifted: some of them are good at programming, some are good at maths, others are good a... | instruction | 0 | 61,834 | 17 | 123,668 |
Yes | output | 1 | 61,834 | 17 | 123,669 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The School №0 of the capital of Berland has n children studying in it. All the children in this school are gifted: some of them are good at programming, some are good at maths, others are good a... | instruction | 0 | 61,835 | 17 | 123,670 |
Yes | output | 1 | 61,835 | 17 | 123,671 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The School №0 of the capital of Berland has n children studying in it. All the children in this school are gifted: some of them are good at programming, some are good at maths, others are good a... | instruction | 0 | 61,836 | 17 | 123,672 |
No | output | 1 | 61,836 | 17 | 123,673 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The School №0 of the capital of Berland has n children studying in it. All the children in this school are gifted: some of them are good at programming, some are good at maths, others are good a... | instruction | 0 | 61,837 | 17 | 123,674 |
No | output | 1 | 61,837 | 17 | 123,675 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The School №0 of the capital of Berland has n children studying in it. All the children in this school are gifted: some of them are good at programming, some are good at maths, others are good a... | instruction | 0 | 61,838 | 17 | 123,676 |
No | output | 1 | 61,838 | 17 | 123,677 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The School №0 of the capital of Berland has n children studying in it. All the children in this school are gifted: some of them are good at programming, some are good at maths, others are good a... | instruction | 0 | 61,839 | 17 | 123,678 |
No | output | 1 | 61,839 | 17 | 123,679 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Vova studies programming in an elite school. Vova and his classmates are supposed to write n progress tests, for each test they will get a mark from 1 to p. Vova is very smart and he can write every test for any mark, but he doesn't w... | instruction | 0 | 61,856 | 17 | 123,712 |
Tags: greedy, implementation
Correct Solution:
```
n, k, p, x, y = map(int, input().split())
s, g, l = 0, 0, []
for a in map(int, input().split()):
s += a
g += a >= y
for i in range(n - k):
c = 1 if g >= n // 2 + 1 else y
s += c
g += c == y
l.append(c)
print(' '.join(map(str, l)) if s <= x and g... | output | 1 | 61,856 | 17 | 123,713 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Vova studies programming in an elite school. Vova and his classmates are supposed to write n progress tests, for each test they will get a mark from 1 to p. Vova is very smart and he can write every test for any mark, but he doesn't w... | instruction | 0 | 61,857 | 17 | 123,714 |
Tags: greedy, implementation
Correct Solution:
```
def main():
n, k, p, x, y = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
median = int((n + 1) / 2)
less = 0
for i in range(len(a)):
if a[i] < y:
less += 1
#print(less, median)
if less >= medi... | output | 1 | 61,857 | 17 | 123,715 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Vova studies programming in an elite school. Vova and his classmates are supposed to write n progress tests, for each test they will get a mark from 1 to p. Vova is very smart and he can write every test for any mark, but he doesn't w... | instruction | 0 | 61,858 | 17 | 123,716 |
Tags: greedy, implementation
Correct Solution:
```
n,k,p,x,y=(int(x) for x in input().split())
a = [int(x) for x in input().split()]
if n == 1:
if y > x:
print(-1)
else:
print(y)
exit(0)
a.sort()
med_pos = n // 2
s = sum(a)
if (len(a) > med_pos) and (a[med_pos] < y):
print(-1)
exit... | output | 1 | 61,858 | 17 | 123,717 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Vova studies programming in an elite school. Vova and his classmates are supposed to write n progress tests, for each test they will get a mark from 1 to p. Vova is very smart and he can write every test for any mark, but he doesn't w... | instruction | 0 | 61,859 | 17 | 123,718 |
Tags: greedy, implementation
Correct Solution:
```
def main():
n, k, p, x, y = map(int, input().split())
L = list(map(int, input().split()))
[L.append(y) for _ in range(n-k)]
cnt = 0
for i in range(n):
if L[i] >= y:
cnt += 1
m = (n+1)/2
for i in range(k, n):
if cn... | output | 1 | 61,859 | 17 | 123,719 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Vova studies programming in an elite school. Vova and his classmates are supposed to write n progress tests, for each test they will get a mark from 1 to p. Vova is very smart and he can write every test for any mark, but he doesn't w... | instruction | 0 | 61,860 | 17 | 123,720 |
Tags: greedy, implementation
Correct Solution:
```
n, k, p, x, y=map(int, input().split())
s=list(map(int, input().split()))
s=sorted(s)
if p<y:
print(-1)
else:
kol=0
summ=0
for i in s: #������� ����� � ���������� ������� ��� y
summ+=i
if i>=y:
kol+=1
if k-kol>=n//2+1 or... | output | 1 | 61,860 | 17 | 123,721 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Vova studies programming in an elite school. Vova and his classmates are supposed to write n progress tests, for each test they will get a mark from 1 to p. Vova is very smart and he can write every test for any mark, but he doesn't w... | instruction | 0 | 61,861 | 17 | 123,722 |
Tags: greedy, implementation
Correct Solution:
```
n, k, p, x, y = map(int, input().split())
a = list(map(int, input().split()))
t = 0 # кол-во чисел, меньших y
for i in a:
if i < y:
t += 1
m = (n+1)//2
if t >= m:
print(-1)
else:
ans = []
ans += [y]*max(0, m-(k-t))
k += max(0, m-(k-t))
... | output | 1 | 61,861 | 17 | 123,723 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Vova studies programming in an elite school. Vova and his classmates are supposed to write n progress tests, for each test they will get a mark from 1 to p. Vova is very smart and he can write every test for any mark, but he doesn't w... | instruction | 0 | 61,862 | 17 | 123,724 |
Tags: greedy, implementation
Correct Solution:
```
n, k, p, x, y = map(int,input().split())
s = 0
kol = 0
sp = []
st = input().split()
for i in range(k):
s += int(st[i])
if int(st[i]) < y:
kol+=1
if (kol >= (n + 1)//2):
print(-1)
else:
if (k - kol) < (n + 1)//2:
for i in range(n - k - ((n+1)//2 - k + kol)):
... | output | 1 | 61,862 | 17 | 123,725 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Vova studies programming in an elite school. Vova and his classmates are supposed to write n progress tests, for each test they will get a mark from 1 to p. Vova is very smart and he can write every test for any mark, but he doesn't w... | instruction | 0 | 61,863 | 17 | 123,726 |
Tags: greedy, implementation
Correct Solution:
```
__author__ = 'emcenrue'
#n, k, p, x, y
#n: total tests to write
#k: total tests he has already written
#p: max score for a test
#x: max total points; if his total score is greater, then -1
#y: minimum median; if median is lower than this then -1
n, k, p, x, y = map(i... | output | 1 | 61,863 | 17 | 123,727 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Vova studies programming in an elite school. Vova and his classmates are supposed to write n progress tests, for each test they will get a mark from 1 to p. Vova is very smart and he can ... | instruction | 0 | 61,864 | 17 | 123,728 |
Yes | output | 1 | 61,864 | 17 | 123,729 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Vova studies programming in an elite school. Vova and his classmates are supposed to write n progress tests, for each test they will get a mark from 1 to p. Vova is very smart and he can ... | instruction | 0 | 61,865 | 17 | 123,730 |
Yes | output | 1 | 61,865 | 17 | 123,731 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Little Vova studies programming in an elite school. Vova and his classmates are supposed to write n progress tests, for each test they will get a mark from 1 to p. Vova is very smart and he can ... | instruction | 0 | 61,866 | 17 | 123,732 |
Yes | output | 1 | 61,866 | 17 | 123,733 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.