message stringlengths 2 65.1k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 0 108k | cluster float64 14 14 | __index_level_0__ int64 0 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
As you have noticed, there are lovely girls in Arpa’s land.
People in Arpa's land are numbered from 1 to n. Everyone has exactly one crush, i-th person's crush is person with the number crushi.
<image>
Someday Arpa shouted Owf loudly from... | instruction | 0 | 104,103 | 14 | 208,206 |
Tags: dfs and similar, math
Correct Solution:
```
from fractions import gcd
def nok(a,b):
return a*b//gcd(a,b)
n=int(input())
a=[0]+[int(i) for i in input().split()]
ans=1
for i in range(1,1+n):
if a[i]!=i:
now=i
res=-1
for j in range(n):
now=a[now]
if now==i:
... | output | 1 | 104,103 | 14 | 208,207 |
Provide tags and a correct Python 3 solution for this coding contest problem.
As you have noticed, there are lovely girls in Arpa’s land.
People in Arpa's land are numbered from 1 to n. Everyone has exactly one crush, i-th person's crush is person with the number crushi.
<image>
Someday Arpa shouted Owf loudly from... | instruction | 0 | 104,104 | 14 | 208,208 |
Tags: dfs and similar, math
Correct Solution:
```
def gcd(a, b):
while b != 0:
a, b = b, a % b
return a
n = int(input())
crash = list(map(int, input().split()))
s = set()
t = 1
for i in range(n):
counter = 1
j = crash[i] - 1
while j != i and counter <= n:
counter += 1
... | output | 1 | 104,104 | 14 | 208,209 |
Provide tags and a correct Python 3 solution for this coding contest problem.
As you have noticed, there are lovely girls in Arpa’s land.
People in Arpa's land are numbered from 1 to n. Everyone has exactly one crush, i-th person's crush is person with the number crushi.
<image>
Someday Arpa shouted Owf loudly from... | instruction | 0 | 104,105 | 14 | 208,210 |
Tags: dfs and similar, math
Correct Solution:
```
n = int(input())
adj = [int(x) - 1 for x in input().split()]
ans = 1
from fractions import gcd
lcm = lambda x, y : (x * y) // gcd(x, y)
for i in range(n):
visited = [0] * n
visited[i] = 1
j = adj[i]
while visited[j] == 0:
visited[j] = 1
... | output | 1 | 104,105 | 14 | 208,211 |
Provide tags and a correct Python 3 solution for this coding contest problem.
As you have noticed, there are lovely girls in Arpa’s land.
People in Arpa's land are numbered from 1 to n. Everyone has exactly one crush, i-th person's crush is person with the number crushi.
<image>
Someday Arpa shouted Owf loudly from... | instruction | 0 | 104,106 | 14 | 208,212 |
Tags: dfs and similar, math
Correct Solution:
```
def gcd(a, b):
if b == 0:
return a
return gcd(b, a % b)
def solve():
n = int(input())
arr = list(map(int, input().split()))
memarr = []
for i in range(n):
arr[i] -= 1
for i in range(n):
if arr[i] == -1:
c... | output | 1 | 104,106 | 14 | 208,213 |
Provide tags and a correct Python 3 solution for this coding contest problem.
As you have noticed, there are lovely girls in Arpa’s land.
People in Arpa's land are numbered from 1 to n. Everyone has exactly one crush, i-th person's crush is person with the number crushi.
<image>
Someday Arpa shouted Owf loudly from... | instruction | 0 | 104,107 | 14 | 208,214 |
Tags: dfs and similar, math
Correct Solution:
```
def gcd(a, b):
if b == 0:
return a
return gcd(b, a % b)
n = int(input())
a = list(map(int, input().split()))
for i in range(len(a)):
a[i] -= 1
lens = []
for i in range(len(a)):
now = i
l = 0
for j in range(3 * n):
l += 1
... | output | 1 | 104,107 | 14 | 208,215 |
Provide tags and a correct Python 3 solution for this coding contest problem.
As you have noticed, there are lovely girls in Arpa’s land.
People in Arpa's land are numbered from 1 to n. Everyone has exactly one crush, i-th person's crush is person with the number crushi.
<image>
Someday Arpa shouted Owf loudly from... | instruction | 0 | 104,108 | 14 | 208,216 |
Tags: dfs and similar, math
Correct Solution:
```
import sys, math
n, c = int(input()), list(map(int, input().split()))
n += 1
c.insert(0, 0)
done, t = [False] * n, []
for i in range(1, n):
a, ct = i, 0
while not done[a]:
done[a] = True
ct, a = ct + 1, c[a]
if a is not i:
print(-1)
... | output | 1 | 104,108 | 14 | 208,217 |
Provide tags and a correct Python 3 solution for this coding contest problem.
As you have noticed, there are lovely girls in Arpa’s land.
People in Arpa's land are numbered from 1 to n. Everyone has exactly one crush, i-th person's crush is person with the number crushi.
<image>
Someday Arpa shouted Owf loudly from... | instruction | 0 | 104,109 | 14 | 208,218 |
Tags: dfs and similar, math
Correct Solution:
```
def gcd(a,b):
while b:
a,b=b,a%b
return a
def lcm(arr):
if len(arr)==1:
return arr[0]
else:
a=arr.pop()
b=arr.pop()
arr.append(a*b//gcd(a,b))
return lcm(arr)
n=int(input())
lv=[(int(z)-1) for z in input()... | output | 1 | 104,109 | 14 | 208,219 |
Provide tags and a correct Python 3 solution for this coding contest problem.
As you have noticed, there are lovely girls in Arpa’s land.
People in Arpa's land are numbered from 1 to n. Everyone has exactly one crush, i-th person's crush is person with the number crushi.
<image>
Someday Arpa shouted Owf loudly from... | instruction | 0 | 104,110 | 14 | 208,220 |
Tags: dfs and similar, math
Correct Solution:
```
def make_function(n, crushes):
def f(original_node):
node = original_node
x = 0
for i in range(n):
node = crushes[node]
x += 1
if node == original_node:
break
else:
retur... | output | 1 | 104,110 | 14 | 208,221 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As you have noticed, there are lovely girls in Arpa’s land.
People in Arpa's land are numbered from 1 to n. Everyone has exactly one crush, i-th person's crush is person with the number crushi.... | instruction | 0 | 104,111 | 14 | 208,222 |
Yes | output | 1 | 104,111 | 14 | 208,223 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As you have noticed, there are lovely girls in Arpa’s land.
People in Arpa's land are numbered from 1 to n. Everyone has exactly one crush, i-th person's crush is person with the number crushi.... | instruction | 0 | 104,112 | 14 | 208,224 |
Yes | output | 1 | 104,112 | 14 | 208,225 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As you have noticed, there are lovely girls in Arpa’s land.
People in Arpa's land are numbered from 1 to n. Everyone has exactly one crush, i-th person's crush is person with the number crushi.... | instruction | 0 | 104,113 | 14 | 208,226 |
Yes | output | 1 | 104,113 | 14 | 208,227 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As you have noticed, there are lovely girls in Arpa’s land.
People in Arpa's land are numbered from 1 to n. Everyone has exactly one crush, i-th person's crush is person with the number crushi.... | instruction | 0 | 104,114 | 14 | 208,228 |
Yes | output | 1 | 104,114 | 14 | 208,229 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As you have noticed, there are lovely girls in Arpa’s land.
People in Arpa's land are numbered from 1 to n. Everyone has exactly one crush, i-th person's crush is person with the number crushi.... | instruction | 0 | 104,115 | 14 | 208,230 |
No | output | 1 | 104,115 | 14 | 208,231 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As you have noticed, there are lovely girls in Arpa’s land.
People in Arpa's land are numbered from 1 to n. Everyone has exactly one crush, i-th person's crush is person with the number crushi.... | instruction | 0 | 104,116 | 14 | 208,232 |
No | output | 1 | 104,116 | 14 | 208,233 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As you have noticed, there are lovely girls in Arpa’s land.
People in Arpa's land are numbered from 1 to n. Everyone has exactly one crush, i-th person's crush is person with the number crushi.... | instruction | 0 | 104,117 | 14 | 208,234 |
No | output | 1 | 104,117 | 14 | 208,235 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
As you have noticed, there are lovely girls in Arpa’s land.
People in Arpa's land are numbered from 1 to n. Everyone has exactly one crush, i-th person's crush is person with the number crushi.... | instruction | 0 | 104,118 | 14 | 208,236 |
No | output | 1 | 104,118 | 14 | 208,237 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Noora is a student of one famous high school. It's her final year in school — she is going to study in university next year. However, she has to get an «A» graduation certificate in order to apply to a prestigious one.
In school, where Noor... | instruction | 0 | 104,120 | 14 | 208,240 |
Tags: implementation, math
Correct Solution:
```
n,k=list(map(int,input().split()))
p=list(map(int,input().split()))
tad=k
tom=(k-1)+0.5
lol=sum(p)
s=0
for x in range(55555555):
if (lol/n)>=tom:
print(s)
break
else:
n+=1
if ((lol+k)/(n))<tom:
k+=tad
s+=1
... | output | 1 | 104,120 | 14 | 208,241 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Noora is a student of one famous high school. It's her final year in school — she is going to study in university next year. However, she has to get an «A» graduation certificate in order to apply to a prestigious one.
In school, where Noor... | instruction | 0 | 104,121 | 14 | 208,242 |
Tags: implementation, math
Correct Solution:
```
a,b=map(int,input().split())
c=list(map(int,input().split()))
i=0
d=0
j=len(c)
for i in range(j):
d+=c[i]
p=((b-0.5)*a-d)*2
if(p<0):
print(0)
else:
print(int(p))
``` | output | 1 | 104,121 | 14 | 208,243 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Noora is a student of one famous high school. It's her final year in school — she is going to study in university next year. However, she has to get an «A» graduation certificate in order to apply to a prestigious one.
In school, where Noor... | instruction | 0 | 104,122 | 14 | 208,244 |
Tags: implementation, math
Correct Solution:
```
n, k = map(int, input().split())
m = list(map(int, input().split()))
def av(m):
return sum(m)/len(m)
s = sum(m)
def ro(x):
xx = int(x)
if x - xx >= 0.5:
return xx + 1
else:
return xx
pren = n
while s/n < k - 0.5:
s+= k
n+=1
print(n - pren)
``` | output | 1 | 104,122 | 14 | 208,245 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Noora is a student of one famous high school. It's her final year in school — she is going to study in university next year. However, she has to get an «A» graduation certificate in order to apply to a prestigious one.
In school, where Noor... | instruction | 0 | 104,123 | 14 | 208,246 |
Tags: implementation, math
Correct Solution:
```
from math import ceil
n,k=map(int,input().split())
li=list(map(int,input().split()))
count=0
count2=0
def round1(n):
k=int(n)
b=n-k
if b>=0.5:
return ceil(n)
return k
while round1(sum(li)/len(li))!=k:
li.append(k)
count+=1
print((count))
``` | output | 1 | 104,123 | 14 | 208,247 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Noora is a student of one famous high school. It's her final year in school — she is going to study in university next year. However, she has to get an «A» graduation certificate in order to apply to a prestigious one.
In school, where Noor... | instruction | 0 | 104,124 | 14 | 208,248 |
Tags: implementation, math
Correct Solution:
```
n,k = map(int, input().split())
a = list(map(int, input().split()))
sumA = sum(a)
res = 0
while round(sumA / n + 1e-13) < k:
sumA += k
n += 1
res += 1
print(res)
``` | output | 1 | 104,124 | 14 | 208,249 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Noora is a student of one famous high school. It's her final year in school — she is going to study in university next year. However, she has to get an «A» graduation certificate in order to apply to a prestigious one.
In school, where Noor... | instruction | 0 | 104,125 | 14 | 208,250 |
Tags: implementation, math
Correct Solution:
```
n,m = [int(i) for i in input().split()]
l = [int(i) for i in input().split()]
avg = sum(l)
t = 0
while avg < (t+n)*(m-0.5) :
avg = avg+m
t+=1
print(t)
``` | output | 1 | 104,125 | 14 | 208,251 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Noora is a student of one famous high school. It's her final year in school — she is going to study in university next year. However, she has to get an «A» graduation certificate in order to apply to a prestigious one.
In school, where Noor... | instruction | 0 | 104,126 | 14 | 208,252 |
Tags: implementation, math
Correct Solution:
```
import math
n, k = map(int, input().split())
s = sum(map(int, input().split()))
print(max(0, (2 * k - 1) * n - 2 * s))
``` | output | 1 | 104,126 | 14 | 208,253 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Noora is a student of one famous high school. It's her final year in school — she is going to study in university next year. However, she has to get an «A» graduation certificate in order to apply to a prestigious one.
In school, where Noor... | instruction | 0 | 104,127 | 14 | 208,254 |
Tags: implementation, math
Correct Solution:
```
x,y=map(int,input().split())
a=list(map(int,input().split()))
n=0
d=0
for i in range(x):
n=n+a[i]
while round((n+0.01)/x)!=y:
n=n+y
x=x+1
d+=1
print(d)
``` | output | 1 | 104,127 | 14 | 208,255 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Two famous competing companies ChemForces and TopChemist decided to show their sets of recently discovered chemical elements on an exhibition. However they know that no element should be present in the sets of both companies.
In order to av... | instruction | 0 | 104,171 | 14 | 208,342 |
Tags: sortings
Correct Solution:
```
n=int(input())
d=dict()
for i in range(n):
a,b=list(map(int,input().split()))
try:
d[a]=max(d[a],b)
except:
d.update({a:b})
m=int(input())
for i in range(m):
a,b=list(map(int,input().split()))
try:
d[a]=max(d[a],b)
except:
d.up... | output | 1 | 104,171 | 14 | 208,343 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Two famous competing companies ChemForces and TopChemist decided to show their sets of recently discovered chemical elements on an exhibition. However they know that no element should be present in the sets of both companies.
In order to av... | instruction | 0 | 104,172 | 14 | 208,344 |
Tags: sortings
Correct Solution:
```
n = int(input())
c1 = {}
set1 = set()
for _ in range(n):
t1,t2 = map(int, input().split())
c1[t1] = t2
set1.add(t1)
m = int(input())
for __ in range(m):
t3,t4 = map(int, input().split())
if t3 in set1:
c1[t3] = max(c1[t3],t4)
else:
c1[t3] = t4... | output | 1 | 104,172 | 14 | 208,345 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Two famous competing companies ChemForces and TopChemist decided to show their sets of recently discovered chemical elements on an exhibition. However they know that no element should be present in the sets of both companies.
In order to av... | instruction | 0 | 104,173 | 14 | 208,346 |
Tags: sortings
Correct Solution:
```
a_m = {}
ret = 0
n = int(input())
for i in range(n):
a, v = list(map(int, input().strip().split()))
a_m[a] = v
ret += v
m = int(input())
for j in range(m):
b, v = list(map(int, input().split()))
if b in a_m:
if v > a_m[b]:
ret += v-a_m[b]
... | output | 1 | 104,173 | 14 | 208,347 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Two famous competing companies ChemForces and TopChemist decided to show their sets of recently discovered chemical elements on an exhibition. However they know that no element should be present in the sets of both companies.
In order to av... | instruction | 0 | 104,174 | 14 | 208,348 |
Tags: sortings
Correct Solution:
```
def main():
dict = {}
for j in range(2):
n = int(input())
for i in range(n):
x, y = map(int, input().split())
if x in dict:
dict[x] = max(dict[x], y)
else:
dict[x] = y
print(sum(dict.val... | output | 1 | 104,174 | 14 | 208,349 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Two famous competing companies ChemForces and TopChemist decided to show their sets of recently discovered chemical elements on an exhibition. However they know that no element should be present in the sets of both companies.
In order to av... | instruction | 0 | 104,175 | 14 | 208,350 |
Tags: sortings
Correct Solution:
```
from array import array
database = {}
result = 0
n = int(input())
i = 0
while i < n:
i += 1
[a, x] = [int(x) for x in input().split()]
result += x
database[a] = x
m = int(input())
i = 0
while i < m:
i += 1
[b, y] = [int(x) for x in input().split()]
x = database.get(... | output | 1 | 104,175 | 14 | 208,351 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Two famous competing companies ChemForces and TopChemist decided to show their sets of recently discovered chemical elements on an exhibition. However they know that no element should be present in the sets of both companies.
In order to av... | instruction | 0 | 104,176 | 14 | 208,352 |
Tags: sortings
Correct Solution:
```
n = int(input())
a = {}
for _ in range(n):
aa, xx = [int(v) for v in input().split()]
a[aa] = xx
m = int(input())
b = {}
for _ in range(m):
bb, yy = [int(v) for v in input().split()]
b[bb] = yy
sa = set(a.keys())
sb = set(b.keys())
both = sa & sb
print(
sum(ma... | output | 1 | 104,176 | 14 | 208,353 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Two famous competing companies ChemForces and TopChemist decided to show their sets of recently discovered chemical elements on an exhibition. However they know that no element should be present in the sets of both companies.
In order to av... | instruction | 0 | 104,177 | 14 | 208,354 |
Tags: sortings
Correct Solution:
```
n1 = int(input())
item_pair = {}
for i in range(0, n1):
item_price = input().split()
item = item_price[0]
price = item_price[1]
item_pair[item] = int(price)
n2 = int(input())
for i in range(0, n2):
item_price = input().split()
item = item_price[0]
p... | output | 1 | 104,177 | 14 | 208,355 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Two famous competing companies ChemForces and TopChemist decided to show their sets of recently discovered chemical elements on an exhibition. However they know that no element should be present in the sets of both companies.
In order to av... | instruction | 0 | 104,178 | 14 | 208,356 |
Tags: sortings
Correct Solution:
```
n = int(input())
chemForces = dict()
allSum = 0
for i in range(n):
newChem = input().split()
i,k = int(newChem[0]), int(newChem[1])
allSum += k
chemForces.update({i:k})
m = int(input())
topChemist = dict()
for j in range(m):
newTop = input().split()
j, t... | output | 1 | 104,178 | 14 | 208,357 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have a playlist consisting of n songs. The i-th song is characterized by two numbers t_i and b_i — its length and beauty respectively. The pleasure of listening to set of songs is equal to the total length of the songs in the set multipl... | instruction | 0 | 104,455 | 14 | 208,910 |
Tags: brute force, data structures, sortings
Correct Solution:
```
from copy import deepcopy
class PriorityQueue():
def __init__(self):
self.elements = [(0, None)]
self.size = 0
self.capacity = 1000
def push(self, item):
# the first element of item is the index, it must be digi... | output | 1 | 104,455 | 14 | 208,911 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have a playlist consisting of n songs. The i-th song is characterized by two numbers t_i and b_i — its length and beauty respectively. The pleasure of listening to set of songs is equal to the total length of the songs in the set multipl... | instruction | 0 | 104,456 | 14 | 208,912 |
Tags: brute force, data structures, sortings
Correct Solution:
```
import sys
import heapq
input = sys.stdin.readline
n, k = map(int, input().split())
l = []
for i in range(n):
a, b = map(int, input().split())
l.append((a,b))
l.sort(key = lambda x: x[1], reverse = True)
best = 0
curr = 0
q = []
for i in range... | output | 1 | 104,456 | 14 | 208,913 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have a playlist consisting of n songs. The i-th song is characterized by two numbers t_i and b_i — its length and beauty respectively. The pleasure of listening to set of songs is equal to the total length of the songs in the set multipl... | instruction | 0 | 104,457 | 14 | 208,914 |
Tags: brute force, data structures, sortings
Correct Solution:
```
#import resource
import sys
#resource.setrlimit(resource.RLIMIT_STACK, [0x100000000, resource.RLIM_INFINITY])
mod=(10**9)+7
#fact=[1]
#for i in range(1,1001):
# fact.append((fact[-1]*i)%mod)
#ifact=[0]*1001
#ifact[1000]=pow(fact[1000],mod-2,mod)
#for... | output | 1 | 104,457 | 14 | 208,915 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have a playlist consisting of n songs. The i-th song is characterized by two numbers t_i and b_i — its length and beauty respectively. The pleasure of listening to set of songs is equal to the total length of the songs in the set multipl... | instruction | 0 | 104,458 | 14 | 208,916 |
Tags: brute force, data structures, sortings
Correct Solution:
```
from heapq import heappush, heappop
N, K = [int(s) for s in input().split()]
songs = []
for _ in range(N):
t, b = [int(s) for s in input().split()]
songs.append((t, b))
songs.sort(key= lambda x: x[1], reverse=True)
max_pleasure = 0
total_length... | output | 1 | 104,458 | 14 | 208,917 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have a playlist consisting of n songs. The i-th song is characterized by two numbers t_i and b_i — its length and beauty respectively. The pleasure of listening to set of songs is equal to the total length of the songs in the set multipl... | instruction | 0 | 104,459 | 14 | 208,918 |
Tags: brute force, data structures, sortings
Correct Solution:
```
# -*- coding: utf-8 -*-
# @Date : 2019-03-23 09:28:20
# @Author : raj lath (oorja.halt@gmail.com)
# @Link : link
# @Version : 1.0.0
import sys
import heapq
sys.setrecursionlimit(10**5+1)
inf = int(10 ** 20)
max_val = inf
min_val = -inf
... | output | 1 | 104,459 | 14 | 208,919 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have a playlist consisting of n songs. The i-th song is characterized by two numbers t_i and b_i — its length and beauty respectively. The pleasure of listening to set of songs is equal to the total length of the songs in the set multipl... | instruction | 0 | 104,460 | 14 | 208,920 |
Tags: brute force, data structures, sortings
Correct Solution:
```
import heapq
arr = input()
N,K = [int(x) for x in arr.split(' ')]
data = [[0]*2 for _ in range(N)]
for i in range(N):
arr = input()
L,B = [int(x) for x in arr.split(' ')]
data[i][0] = B
data[i][1] = L
data.sort(reverse=True)... | output | 1 | 104,460 | 14 | 208,921 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have a playlist consisting of n songs. The i-th song is characterized by two numbers t_i and b_i — its length and beauty respectively. The pleasure of listening to set of songs is equal to the total length of the songs in the set multipl... | instruction | 0 | 104,461 | 14 | 208,922 |
Tags: brute force, data structures, sortings
Correct Solution:
```
import heapq
d=[]
n,k=[int(x) for x in input().split()]
c=[]
lena=0
for i in range(n):
a,b=[int(x) for x in input().split()]
c.append((b,a))
c.sort(reverse=True)
answer=[]
summa=0
for item in c:
if lena>=k:
a=heapq.heappop(d)
... | output | 1 | 104,461 | 14 | 208,923 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You have a playlist consisting of n songs. The i-th song is characterized by two numbers t_i and b_i — its length and beauty respectively. The pleasure of listening to set of songs is equal to the total length of the songs in the set multipl... | instruction | 0 | 104,462 | 14 | 208,924 |
Tags: brute force, data structures, sortings
Correct Solution:
```
# -*- coding: utf-8 -*-
"""
Spyder Editor
This is a temporary script file.
"""
from heapq import *
n,k=map(int,input().split())
a=[]
for i in range(n):
y,x=map(int,input().split())
a.append([x,y])
a.sort(reverse=True)
ans=0
s=0
hp=[]
for i in r... | output | 1 | 104,462 | 14 | 208,925 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have a playlist consisting of n songs. The i-th song is characterized by two numbers t_i and b_i — its length and beauty respectively. The pleasure of listening to set of songs is equal to t... | instruction | 0 | 104,463 | 14 | 208,926 |
Yes | output | 1 | 104,463 | 14 | 208,927 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have a playlist consisting of n songs. The i-th song is characterized by two numbers t_i and b_i — its length and beauty respectively. The pleasure of listening to set of songs is equal to t... | instruction | 0 | 104,464 | 14 | 208,928 |
Yes | output | 1 | 104,464 | 14 | 208,929 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have a playlist consisting of n songs. The i-th song is characterized by two numbers t_i and b_i — its length and beauty respectively. The pleasure of listening to set of songs is equal to t... | instruction | 0 | 104,465 | 14 | 208,930 |
Yes | output | 1 | 104,465 | 14 | 208,931 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have a playlist consisting of n songs. The i-th song is characterized by two numbers t_i and b_i — its length and beauty respectively. The pleasure of listening to set of songs is equal to t... | instruction | 0 | 104,466 | 14 | 208,932 |
Yes | output | 1 | 104,466 | 14 | 208,933 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have a playlist consisting of n songs. The i-th song is characterized by two numbers t_i and b_i — its length and beauty respectively. The pleasure of listening to set of songs is equal to t... | instruction | 0 | 104,467 | 14 | 208,934 |
No | output | 1 | 104,467 | 14 | 208,935 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have a playlist consisting of n songs. The i-th song is characterized by two numbers t_i and b_i — its length and beauty respectively. The pleasure of listening to set of songs is equal to t... | instruction | 0 | 104,468 | 14 | 208,936 |
No | output | 1 | 104,468 | 14 | 208,937 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have a playlist consisting of n songs. The i-th song is characterized by two numbers t_i and b_i — its length and beauty respectively. The pleasure of listening to set of songs is equal to t... | instruction | 0 | 104,469 | 14 | 208,938 |
No | output | 1 | 104,469 | 14 | 208,939 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You have a playlist consisting of n songs. The i-th song is characterized by two numbers t_i and b_i — its length and beauty respectively. The pleasure of listening to set of songs is equal to t... | instruction | 0 | 104,470 | 14 | 208,940 |
No | output | 1 | 104,470 | 14 | 208,941 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Masha works in an advertising agency. In order to promote the new brand, she wants to conclude contracts with some bloggers. In total, Masha has connections of n different bloggers. Blogger numbered i has a_i followers.
Since Masha has a li... | instruction | 0 | 104,665 | 14 | 209,330 |
Tags: combinatorics, math, sortings
Correct Solution:
```
def cnk_mod(max_n, m):
cnk = [[1]]
for n in range(1, max_n + 1):
tmp = [1]
for k in range(1, n):
tmp.append((cnk[n - 1][k - 1] + cnk[n - 1][k]) % m)
tmp.append(1)
cnk.append(tmp)
return cnk
'''
if k == 0 or k == n:
return 1
r = cnk_mod(n - 1... | output | 1 | 104,665 | 14 | 209,331 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Masha works in an advertising agency. In order to promote the new brand, she wants to conclude contracts with some bloggers. In total, Masha has connections of n different bloggers. Blogger numbered i has a_i followers.
Since Masha has a li... | instruction | 0 | 104,666 | 14 | 209,332 |
Tags: combinatorics, math, sortings
Correct Solution:
```
"""
#If FastIO not needed, use this and don't forget to strip
#import sys, math
#input = sys.stdin.readline
"""
import os
import sys
from io import BytesIO, IOBase
import heapq as h
from bisect import bisect_left, bisect_right
import time
from types import Ge... | output | 1 | 104,666 | 14 | 209,333 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.