message stringlengths 2 30.5k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 237 109k | cluster float64 10 10 | __index_level_0__ int64 474 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Create a program that reads the sales unit price and sales quantity and outputs the total sales amount and the average sales quantity.
Input
The input is given in the following format:
Sal... | instruction | 0 | 28,989 | 10 | 57,978 |
Yes | output | 1 | 28,989 | 10 | 57,979 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Create a program that reads the sales unit price and sales quantity and outputs the total sales amount and the average sales quantity.
Input
The input is given in the following format:
Sal... | instruction | 0 | 28,990 | 10 | 57,980 |
Yes | output | 1 | 28,990 | 10 | 57,981 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Create a program that reads the sales unit price and sales quantity and outputs the total sales amount and the average sales quantity.
Input
The input is given in the following format:
Sal... | instruction | 0 | 28,991 | 10 | 57,982 |
Yes | output | 1 | 28,991 | 10 | 57,983 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Create a program that reads the sales unit price and sales quantity and outputs the total sales amount and the average sales quantity.
Input
The input is given in the following format:
Sal... | instruction | 0 | 28,992 | 10 | 57,984 |
Yes | output | 1 | 28,992 | 10 | 57,985 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Create a program that reads the sales unit price and sales quantity and outputs the total sales amount and the average sales quantity.
Input
The input is given in the following format:
Sal... | instruction | 0 | 28,993 | 10 | 57,986 |
No | output | 1 | 28,993 | 10 | 57,987 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Create a program that reads the sales unit price and sales quantity and outputs the total sales amount and the average sales quantity.
Input
The input is given in the following format:
Sal... | instruction | 0 | 28,994 | 10 | 57,988 |
No | output | 1 | 28,994 | 10 | 57,989 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Create a program that reads the sales unit price and sales quantity and outputs the total sales amount and the average sales quantity.
Input
The input is given in the following format:
Sal... | instruction | 0 | 28,995 | 10 | 57,990 |
No | output | 1 | 28,995 | 10 | 57,991 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Create a program that reads the sales unit price and sales quantity and outputs the total sales amount and the average sales quantity.
Input
The input is given in the following format:
Sal... | instruction | 0 | 28,996 | 10 | 57,992 |
No | output | 1 | 28,996 | 10 | 57,993 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In this task you need to process a set of stock exchange orders and use them to create order book.
An order is an instruction of some participant to buy or sell stocks on stock exchange. The order number i has price pi, direction di — buy o... | instruction | 0 | 29,557 | 10 | 59,114 |
Tags: data structures, greedy, implementation, sortings
Correct Solution:
```
n,s = map(int, input().split())
sell = {}
buy = {}
for i in range(n):
type, price, vol = input().split()
price = int(price)
vol = int(vol)
if type == 'S':
sell[price] = sell.get(price, 0) + vol
else:
buy[... | output | 1 | 29,557 | 10 | 59,115 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In this task you need to process a set of stock exchange orders and use them to create order book.
An order is an instruction of some participant to buy or sell stocks on stock exchange. The order number i has price pi, direction di — buy o... | instruction | 0 | 29,558 | 10 | 59,116 |
Tags: data structures, greedy, implementation, sortings
Correct Solution:
```
def search(a, key):
for i in range(len(a)):
if key == a[i].price:
return i
return -1
def insert_max(a, key):
size = len(a)
i = 0
while i < size:
if key.price > a[i].price:
brea... | output | 1 | 29,558 | 10 | 59,117 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In this task you need to process a set of stock exchange orders and use them to create order book.
An order is an instruction of some participant to buy or sell stocks on stock exchange. The order number i has price pi, direction di — buy o... | instruction | 0 | 29,559 | 10 | 59,118 |
Tags: data structures, greedy, implementation, sortings
Correct Solution:
```
n = [int(i) for i in input().split()]
buy = []
buyP = []
sell = []
sellP = []
for i in range(n[0]):
l = input().split()
l[1] = int(l[1])
l[2] = int(l[2])
if l[0] == 'B':
l.pop(0)
buy.append(l)
buyP.appe... | output | 1 | 29,559 | 10 | 59,119 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In this task you need to process a set of stock exchange orders and use them to create order book.
An order is an instruction of some participant to buy or sell stocks on stock exchange. The order number i has price pi, direction di — buy o... | instruction | 0 | 29,560 | 10 | 59,120 |
Tags: data structures, greedy, implementation, sortings
Correct Solution:
```
import sys
import os
def getint():
return list(map(int,input().split(' ')))
n,s=getint()
dic={'B':{},'S':{}}
for i in range(n):
d,p,q=list(input().split(' '))
p=int(p)
q=int(q)
dic[d][p]=dic[d].get(p,0)+q
for key in sorted... | output | 1 | 29,560 | 10 | 59,121 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In this task you need to process a set of stock exchange orders and use them to create order book.
An order is an instruction of some participant to buy or sell stocks on stock exchange. The order number i has price pi, direction di — buy o... | instruction | 0 | 29,561 | 10 | 59,122 |
Tags: data structures, greedy, implementation, sortings
Correct Solution:
```
from sys import stdin,stdout
input = stdin.readline
b = {}
s = {}
n, l = map(int,input().split(' '))
for i in range(n):
d,p,q = input().split(' ')
p,q = int(p),int(q)
if d == 'B':
try:
b[p] += q
excep... | output | 1 | 29,561 | 10 | 59,123 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In this task you need to process a set of stock exchange orders and use them to create order book.
An order is an instruction of some participant to buy or sell stocks on stock exchange. The order number i has price pi, direction di — buy o... | instruction | 0 | 29,562 | 10 | 59,124 |
Tags: data structures, greedy, implementation, sortings
Correct Solution:
```
from sys import argv
from collections import defaultdict
import sys
def convert(line):
ret = []
for e in line:
try:
ret.append(int(e))
except:
ret.append(e)
return ret
def reader():
for line in sys.stdin:
yield convert(line.... | output | 1 | 29,562 | 10 | 59,125 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In this task you need to process a set of stock exchange orders and use them to create order book.
An order is an instruction of some participant to buy or sell stocks on stock exchange. The order number i has price pi, direction di — buy o... | instruction | 0 | 29,563 | 10 | 59,126 |
Tags: data structures, greedy, implementation, sortings
Correct Solution:
```
def main():
n, s = map(int, input().split())
tot = {"S": {}, "B": {}}
for _ in range(n):
tmp = input().split()
t, p, q = tot[tmp[0]], int(tmp[1]), int(tmp[2])
t[p] = t.get(p, 0) + q
for c in "S", "B":
... | output | 1 | 29,563 | 10 | 59,127 |
Provide tags and a correct Python 3 solution for this coding contest problem.
In this task you need to process a set of stock exchange orders and use them to create order book.
An order is an instruction of some participant to buy or sell stocks on stock exchange. The order number i has price pi, direction di — buy o... | instruction | 0 | 29,564 | 10 | 59,128 |
Tags: data structures, greedy, implementation, sortings
Correct Solution:
```
import operator
n,s=map(int,input().split())
orders=[]
for i in range(n):
orders.append(tuple(map(str,input().split()))) #d,p,q
aggr={}
for order in orders:
key=(order[0][0],int(order[1]))
if key not in aggr:
aggr[key]=0
aggr[key]+=in... | output | 1 | 29,564 | 10 | 59,129 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this task you need to process a set of stock exchange orders and use them to create order book.
An order is an instruction of some participant to buy or sell stocks on stock exchange. The or... | instruction | 0 | 29,565 | 10 | 59,130 |
Yes | output | 1 | 29,565 | 10 | 59,131 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this task you need to process a set of stock exchange orders and use them to create order book.
An order is an instruction of some participant to buy or sell stocks on stock exchange. The or... | instruction | 0 | 29,566 | 10 | 59,132 |
Yes | output | 1 | 29,566 | 10 | 59,133 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this task you need to process a set of stock exchange orders and use them to create order book.
An order is an instruction of some participant to buy or sell stocks on stock exchange. The or... | instruction | 0 | 29,567 | 10 | 59,134 |
Yes | output | 1 | 29,567 | 10 | 59,135 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this task you need to process a set of stock exchange orders and use them to create order book.
An order is an instruction of some participant to buy or sell stocks on stock exchange. The or... | instruction | 0 | 29,568 | 10 | 59,136 |
Yes | output | 1 | 29,568 | 10 | 59,137 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this task you need to process a set of stock exchange orders and use them to create order book.
An order is an instruction of some participant to buy or sell stocks on stock exchange. The or... | instruction | 0 | 29,569 | 10 | 59,138 |
No | output | 1 | 29,569 | 10 | 59,139 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this task you need to process a set of stock exchange orders and use them to create order book.
An order is an instruction of some participant to buy or sell stocks on stock exchange. The or... | instruction | 0 | 29,570 | 10 | 59,140 |
No | output | 1 | 29,570 | 10 | 59,141 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this task you need to process a set of stock exchange orders and use them to create order book.
An order is an instruction of some participant to buy or sell stocks on stock exchange. The or... | instruction | 0 | 29,571 | 10 | 59,142 |
No | output | 1 | 29,571 | 10 | 59,143 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
In this task you need to process a set of stock exchange orders and use them to create order book.
An order is an instruction of some participant to buy or sell stocks on stock exchange. The or... | instruction | 0 | 29,572 | 10 | 59,144 |
No | output | 1 | 29,572 | 10 | 59,145 |
Provide a correct Python 3 solution for this coding contest problem.
500-yen Saving
"500-yen Saving" is one of Japanese famous methods to save money. The method is quite simple; whenever you receive a 500-yen coin in your change of shopping, put the coin to your 500-yen saving box. Typically, you will find more than ... | instruction | 0 | 29,957 | 10 | 59,914 |
"Correct Solution:
```
from copy import deepcopy
from operator import itemgetter
def buy(p, cr):
cnt, rem = cr
r1000 = p % 1000
r500 = p % 500
m500 = 500 - r500
m1000 = 1000 - r1000
if r1000 == 0:
if rem < 500:
return ((cnt, rem),)
else:
return ((cnt+1, r... | output | 1 | 29,957 | 10 | 59,915 |
Provide a correct Python 3 solution for this coding contest problem.
500-yen Saving
"500-yen Saving" is one of Japanese famous methods to save money. The method is quite simple; whenever you receive a 500-yen coin in your change of shopping, put the coin to your 500-yen saving box. Typically, you will find more than ... | instruction | 0 | 29,958 | 10 | 59,916 |
"Correct Solution:
```
from collections import defaultdict
def main(n):
m = n * 499 + 1
dp = defaultdict(list)
dp[0] = [0, 0]
for _ in range(n):
ndp = defaultdict(lambda:[-1,-1])
for key, value in dp.items():
ndp[key] = value[:]
p = int(input())
a = -p % 1000... | output | 1 | 29,958 | 10 | 59,917 |
Provide a correct Python 3 solution for this coding contest problem.
500-yen Saving
"500-yen Saving" is one of Japanese famous methods to save money. The method is quite simple; whenever you receive a 500-yen coin in your change of shopping, put the coin to your 500-yen saving box. Typically, you will find more than ... | instruction | 0 | 29,959 | 10 | 59,918 |
"Correct Solution:
```
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**13
mod = 10**9+9
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]
def LI(): return [int... | output | 1 | 29,959 | 10 | 59,919 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
500-yen Saving
"500-yen Saving" is one of Japanese famous methods to save money. The method is quite simple; whenever you receive a 500-yen coin in your change of shopping, put the coin to your... | instruction | 0 | 29,960 | 10 | 59,920 |
No | output | 1 | 29,960 | 10 | 59,921 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
500-yen Saving
"500-yen Saving" is one of Japanese famous methods to save money. The method is quite simple; whenever you receive a 500-yen coin in your change of shopping, put the coin to your... | instruction | 0 | 29,961 | 10 | 59,922 |
No | output | 1 | 29,961 | 10 | 59,923 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
500-yen Saving
"500-yen Saving" is one of Japanese famous methods to save money. The method is quite simple; whenever you receive a 500-yen coin in your change of shopping, put the coin to your... | instruction | 0 | 29,962 | 10 | 59,924 |
No | output | 1 | 29,962 | 10 | 59,925 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
500-yen Saving
"500-yen Saving" is one of Japanese famous methods to save money. The method is quite simple; whenever you receive a 500-yen coin in your change of shopping, put the coin to your... | instruction | 0 | 29,963 | 10 | 59,926 |
No | output | 1 | 29,963 | 10 | 59,927 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A group of n schoolboys decided to ride bikes. As nobody of them has a bike, the boys need to rent them.
The renting site offered them m bikes. The renting price is different for different bikes, renting the j-th bike costs pj rubles.
In t... | instruction | 0 | 30,398 | 10 | 60,796 |
Tags: binary search, greedy
Correct Solution:
```
def readn():
return map(int, input().split())
n,m,a=readn()#map(int,input().split())
b,p=sorted(map(int,input().split()))[-min(n,m):],sorted(map(int,input().split()))
r=min(n,m)
mm=r
l=0
while l<=r:
mid=l+(r-l)//2
pri=sum([max(0,p[i]-b[mm-mid+i]) for i in rang... | output | 1 | 30,398 | 10 | 60,797 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A group of n schoolboys decided to ride bikes. As nobody of them has a bike, the boys need to rent them.
The renting site offered them m bikes. The renting price is different for different bikes, renting the j-th bike costs pj rubles.
In t... | instruction | 0 | 30,399 | 10 | 60,798 |
Tags: binary search, greedy
Correct Solution:
```
import sys
input = sys.stdin.readline
def check(val,money):
j = 0
for i in range(n-val,n):
if b[i] >= p[j]:
j += 1
continue
diff = p[j]-b[i]
if money-diff < 0:
return 0
money -= diff
j... | output | 1 | 30,399 | 10 | 60,799 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A group of n schoolboys decided to ride bikes. As nobody of them has a bike, the boys need to rent them.
The renting site offered them m bikes. The renting price is different for different bikes, renting the j-th bike costs pj rubles.
In t... | instruction | 0 | 30,400 | 10 | 60,800 |
Tags: binary search, greedy
Correct Solution:
```
n, m, a = map(int, input().split())
b, p = sorted(map(int, input().split())), sorted(map(int, input().split()))
def f(k): return sum(max(0, p[i] - b[n - k + i]) for i in range(k))
def g(k): return sum(min(b[n - k + i], p[i]) for i in range(k))
x, y, d = 0, min(n, m) + 1... | output | 1 | 30,400 | 10 | 60,801 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A group of n schoolboys decided to ride bikes. As nobody of them has a bike, the boys need to rent them.
The renting site offered them m bikes. The renting price is different for different bikes, renting the j-th bike costs pj rubles.
In t... | instruction | 0 | 30,401 | 10 | 60,802 |
Tags: binary search, greedy
Correct Solution:
```
import math
# import collections
# from itertools import permutations
# from itertools import combinations
# import sys
# sys.stdin = open('input.txt', 'r')
# sys.stdout = open('output.txt', 'w')
'''def is_prime(n):
j=2
while j*j<=n:
if n%j==0:
... | output | 1 | 30,401 | 10 | 60,803 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A group of n schoolboys decided to ride bikes. As nobody of them has a bike, the boys need to rent them.
The renting site offered them m bikes. The renting price is different for different bikes, renting the j-th bike costs pj rubles.
In t... | instruction | 0 | 30,402 | 10 | 60,804 |
Tags: binary search, greedy
Correct Solution:
```
# author : Tapan Goyal
# MNIT Jaipur
import math
import bisect
import itertools
import sys
I=lambda : sys.stdin.readline()
one=lambda : int(I())
more=lambda : map(int,I().split())
linput=lambda : list(more())
mod=10**9 +7
inf=10**18 + 1
'''fact=[1]*100001
... | output | 1 | 30,402 | 10 | 60,805 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A group of n schoolboys decided to ride bikes. As nobody of them has a bike, the boys need to rent them.
The renting site offered them m bikes. The renting price is different for different bikes, renting the j-th bike costs pj rubles.
In t... | instruction | 0 | 30,403 | 10 | 60,806 |
Tags: binary search, greedy
Correct Solution:
```
#!/usr/bin/python3
def readn():
return map(int, input().split())
n, m, a = readn()
n = min(n, m)
m = n
b = sorted(readn())[-n:]
p = sorted(readn())
r = 0
while r < n:
t = (r+1 + n)//2
a1 = sum([max(0, p[i]-b[m+i-t]) for i in range(t)])
if a1 <= a:
r = t
else:
... | output | 1 | 30,403 | 10 | 60,807 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A group of n schoolboys decided to ride bikes. As nobody of them has a bike, the boys need to rent them.
The renting site offered them m bikes. The renting price is different for different bikes, renting the j-th bike costs pj rubles.
In t... | instruction | 0 | 30,404 | 10 | 60,808 |
Tags: binary search, greedy
Correct Solution:
```
# Legends Always Come Up with Solution
# Author: Manvir Singh
import os
from io import BytesIO, IOBase
import sys
from collections import defaultdict, deque, Counter
from math import sqrt, pi, ceil, log, inf, gcd, floor
from itertools import combinations
from bisect im... | output | 1 | 30,404 | 10 | 60,809 |
Provide tags and a correct Python 3 solution for this coding contest problem.
A group of n schoolboys decided to ride bikes. As nobody of them has a bike, the boys need to rent them.
The renting site offered them m bikes. The renting price is different for different bikes, renting the j-th bike costs pj rubles.
In t... | instruction | 0 | 30,405 | 10 | 60,810 |
Tags: binary search, greedy
Correct Solution:
```
K = int(input().split()[2])
A = list(map(int, input().split())) #[8, 1, 1, 2]
B = list(map(int, input().split())) #[6, 3, 7, 5, 2]
def canMake(partA, partB, K):
for a, b in zip(partA, partB):
if a >= b:
pass
else:
K -= b - a
... | output | 1 | 30,405 | 10 | 60,811 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A group of n schoolboys decided to ride bikes. As nobody of them has a bike, the boys need to rent them.
The renting site offered them m bikes. The renting price is different for different bike... | instruction | 0 | 30,406 | 10 | 60,812 |
Yes | output | 1 | 30,406 | 10 | 60,813 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A group of n schoolboys decided to ride bikes. As nobody of them has a bike, the boys need to rent them.
The renting site offered them m bikes. The renting price is different for different bike... | instruction | 0 | 30,407 | 10 | 60,814 |
Yes | output | 1 | 30,407 | 10 | 60,815 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A group of n schoolboys decided to ride bikes. As nobody of them has a bike, the boys need to rent them.
The renting site offered them m bikes. The renting price is different for different bike... | instruction | 0 | 30,408 | 10 | 60,816 |
Yes | output | 1 | 30,408 | 10 | 60,817 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A group of n schoolboys decided to ride bikes. As nobody of them has a bike, the boys need to rent them.
The renting site offered them m bikes. The renting price is different for different bike... | instruction | 0 | 30,409 | 10 | 60,818 |
Yes | output | 1 | 30,409 | 10 | 60,819 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A group of n schoolboys decided to ride bikes. As nobody of them has a bike, the boys need to rent them.
The renting site offered them m bikes. The renting price is different for different bike... | instruction | 0 | 30,410 | 10 | 60,820 |
No | output | 1 | 30,410 | 10 | 60,821 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A group of n schoolboys decided to ride bikes. As nobody of them has a bike, the boys need to rent them.
The renting site offered them m bikes. The renting price is different for different bike... | instruction | 0 | 30,411 | 10 | 60,822 |
No | output | 1 | 30,411 | 10 | 60,823 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A group of n schoolboys decided to ride bikes. As nobody of them has a bike, the boys need to rent them.
The renting site offered them m bikes. The renting price is different for different bike... | instruction | 0 | 30,412 | 10 | 60,824 |
No | output | 1 | 30,412 | 10 | 60,825 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A group of n schoolboys decided to ride bikes. As nobody of them has a bike, the boys need to rent them.
The renting site offered them m bikes. The renting price is different for different bike... | instruction | 0 | 30,413 | 10 | 60,826 |
No | output | 1 | 30,413 | 10 | 60,827 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Vasya went to the supermarket to get some groceries. He walked about the supermarket for a long time and got a basket full of products. Now he needs to choose the cashier to pay for the products.
There are n cashiers at the exit from... | instruction | 0 | 30,430 | 10 | 60,860 |
Tags: implementation
Correct Solution:
```
n = int(input())
k = [int(x) for x in input().split()]
ans = 10 ** 10
for i in range(n):
ans = min(ans, sum(int(x) for x in input().split()) * 5 + k[i] * 15)
print(ans)
``` | output | 1 | 30,430 | 10 | 60,861 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Vasya went to the supermarket to get some groceries. He walked about the supermarket for a long time and got a basket full of products. Now he needs to choose the cashier to pay for the products.
There are n cashiers at the exit from... | instruction | 0 | 30,431 | 10 | 60,862 |
Tags: implementation
Correct Solution:
```
n=int(input())
k=input()
l=[]
mini=1e9
for i in range(n):
l.append(list(map(int,input().split(' '))))
# print(sum(l[i])*5+len(l[i])*15)
mini=min(mini,sum(l[i])*5+len(l[i])*15)
print(mini)
``` | output | 1 | 30,431 | 10 | 60,863 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Little Vasya went to the supermarket to get some groceries. He walked about the supermarket for a long time and got a basket full of products. Now he needs to choose the cashier to pay for the products.
There are n cashiers at the exit from... | instruction | 0 | 30,432 | 10 | 60,864 |
Tags: implementation
Correct Solution:
```
n=int(input())
k=[]
k=input().split()
for i in range(0,n):
k[i]=int(k[i])
m=[]
for i in range(0,n):
m.append([int(j)for j in input().split()])
t=[]
for i in range(0,n):
x=k[i]
time=0
for j in range(0,x):
time=time+(m[i][j]*5)
time=time+(k[i]*15)... | output | 1 | 30,432 | 10 | 60,865 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.