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 |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
Billy investigates the question of applying greedy algorithm to different spheres of life. At the moment he is studying the application of greedy algorithm to the problem about change. There is an amount of n coins of different face values, ... | instruction | 0 | 1,692 | 10 | 3,384 |
Tags: constructive algorithms
Correct Solution:
```
__author__ = 'Darren'
def solve():
n = int(input())
coins = list(map(int, input().split()))
def greedy(amount):
num = 0
for i in range(n):
num += amount // coins[i]
amount %= coins[i]
return num
resul... | output | 1 | 1,692 | 10 | 3,385 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Billy investigates the question of applying greedy algorithm to different spheres of life. At the moment he is studying the application of greedy algorithm to the problem about change. There is ... | instruction | 0 | 1,693 | 10 | 3,386 |
No | output | 1 | 1,693 | 10 | 3,387 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Billy investigates the question of applying greedy algorithm to different spheres of life. At the moment he is studying the application of greedy algorithm to the problem about change. There is ... | instruction | 0 | 1,694 | 10 | 3,388 |
No | output | 1 | 1,694 | 10 | 3,389 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n objects. Each object has two integer properties: val_i — its price — and mask_i. It is guaranteed that the sum of all prices is initially non-zero.
You want to select a positive... | instruction | 0 | 1,706 | 10 | 3,412 |
No | output | 1 | 1,706 | 10 | 3,413 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n objects. Each object has two integer properties: val_i — its price — and mask_i. It is guaranteed that the sum of all prices is initially non-zero.
You want to select a positive... | instruction | 0 | 1,707 | 10 | 3,414 |
No | output | 1 | 1,707 | 10 | 3,415 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n objects. Each object has two integer properties: val_i — its price — and mask_i. It is guaranteed that the sum of all prices is initially non-zero.
You want to select a positive... | instruction | 0 | 1,708 | 10 | 3,416 |
No | output | 1 | 1,708 | 10 | 3,417 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given n objects. Each object has two integer properties: val_i — its price — and mask_i. It is guaranteed that the sum of all prices is initially non-zero.
You want to select a positive... | instruction | 0 | 1,709 | 10 | 3,418 |
No | output | 1 | 1,709 | 10 | 3,419 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The warehouse in your shop has n shoe pairs. Each pair is characterized by two integers: its price ci and its size si. We know that on this very day all numbers si are different, that is, there ... | instruction | 0 | 1,901 | 10 | 3,802 |
No | output | 1 | 1,901 | 10 | 3,803 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The warehouse in your shop has n shoe pairs. Each pair is characterized by two integers: its price ci and its size si. We know that on this very day all numbers si are different, that is, there ... | instruction | 0 | 1,902 | 10 | 3,804 |
No | output | 1 | 1,902 | 10 | 3,805 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The warehouse in your shop has n shoe pairs. Each pair is characterized by two integers: its price ci and its size si. We know that on this very day all numbers si are different, that is, there ... | instruction | 0 | 1,903 | 10 | 3,806 |
No | output | 1 | 1,903 | 10 | 3,807 |
Provide a correct Python 3 solution for this coding contest problem.
There is a simple undirected graph with N vertices and M edges. The vertices are numbered 1 through N, and the edges are numbered 1 through M. Edge i connects Vertex U_i and V_i. Also, Vertex i has two predetermined integers A_i and B_i. You will pla... | instruction | 0 | 3,166 | 10 | 6,332 |
"Correct Solution:
```
import os
import sys
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353
class UnionFind:
def __init__(self, size=None, nodes=None):
"""
size か nodes どっちか指定。
... | output | 1 | 3,166 | 10 | 6,333 |
Provide a correct Python 3 solution for this coding contest problem.
There is a simple undirected graph with N vertices and M edges. The vertices are numbered 1 through N, and the edges are numbered 1 through M. Edge i connects Vertex U_i and V_i. Also, Vertex i has two predetermined integers A_i and B_i. You will pla... | instruction | 0 | 3,167 | 10 | 6,334 |
"Correct Solution:
```
import os
import sys
if os.getenv("LOCAL"):
sys.stdin = open("_in.txt", "r")
sys.setrecursionlimit(10 ** 9)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7
# MOD = 998244353
class UnionFind:
def __init__(self, size=None, nodes=None):
"""
size か nodes どっちか指定。
... | output | 1 | 3,167 | 10 | 6,335 |
Provide a correct Python 3 solution for this coding contest problem.
There is a simple undirected graph with N vertices and M edges. The vertices are numbered 1 through N, and the edges are numbered 1 through M. Edge i connects Vertex U_i and V_i. Also, Vertex i has two predetermined integers A_i and B_i. You will pla... | instruction | 0 | 3,168 | 10 | 6,336 |
"Correct Solution:
```
class dsu:
def __init__(self, n=0):
self._n = n
self.parent_or_size = [-1] * n
def merge(self, a: int, b: int) -> int:
x = self.leader(a)
y = self.leader(b)
if x == y:
return x
if self.parent_or_size[x] > self.parent_or_size... | output | 1 | 3,168 | 10 | 6,337 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a simple undirected graph with N vertices and M edges. The vertices are numbered 1 through N, and the edges are numbered 1 through M. Edge i connects Vertex U_i and V_i. Also, Vertex i ... | instruction | 0 | 3,169 | 10 | 6,338 |
No | output | 1 | 3,169 | 10 | 6,339 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a simple undirected graph with N vertices and M edges. The vertices are numbered 1 through N, and the edges are numbered 1 through M. Edge i connects Vertex U_i and V_i. Also, Vertex i ... | instruction | 0 | 3,170 | 10 | 6,340 |
No | output | 1 | 3,170 | 10 | 6,341 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a simple undirected graph with N vertices and M edges. The vertices are numbered 1 through N, and the edges are numbered 1 through M. Edge i connects Vertex U_i and V_i. Also, Vertex i ... | instruction | 0 | 3,171 | 10 | 6,342 |
No | output | 1 | 3,171 | 10 | 6,343 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a simple undirected graph with N vertices and M edges. The vertices are numbered 1 through N, and the edges are numbered 1 through M. Edge i connects Vertex U_i and V_i. Also, Vertex i ... | instruction | 0 | 3,172 | 10 | 6,344 |
No | output | 1 | 3,172 | 10 | 6,345 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n banks in the city where Vasya lives, they are located in a circle, such that any two banks are neighbouring if their indices differ by no more than 1. Also, bank 1 and bank n are neighbours if n > 1. No bank is a neighbour of its... | instruction | 0 | 3,796 | 10 | 7,592 |
Tags: constructive algorithms, data structures, greedy, sortings
Correct Solution:
```
from collections import Counter
c = Counter()
n = int(input())
a = list(map(int, input().split()))
for i in range(1, n):
a[i] += a[i-1]
c.update(a)
print(n - c.most_common()[0][1])
``` | output | 1 | 3,796 | 10 | 7,593 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n banks in the city where Vasya lives, they are located in a circle, such that any two banks are neighbouring if their indices differ by no more than 1. Also, bank 1 and bank n are neighbours if n > 1. No bank is a neighbour of its... | instruction | 0 | 3,797 | 10 | 7,594 |
Tags: constructive algorithms, data structures, greedy, sortings
Correct Solution:
```
n = int(input())
a = list(map(int, input().split()))
s = [a[0]]
for i in range(1, n):
s.append(s[i - 1] + a[i])
d = {}
for x in s:
if x not in d:
d[x] = 1
else:
d[x] += 1
print(n - max(d.values()))
``` | output | 1 | 3,797 | 10 | 7,595 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n banks in the city where Vasya lives, they are located in a circle, such that any two banks are neighbouring if their indices differ by no more than 1. Also, bank 1 and bank n are neighbours if n > 1. No bank is a neighbour of its... | instruction | 0 | 3,798 | 10 | 7,596 |
Tags: constructive algorithms, data structures, greedy, sortings
Correct Solution:
```
n = int(input())
a = list(map(int, input().split()))
x = dict()
sum = 0
ans = n - 1
for i in range(n):
sum += a[i]
if sum in x:
x[sum] += 1
else:
x[sum] = 1
ans = min(ans, n - x[sum])
print(ans)
``` | output | 1 | 3,798 | 10 | 7,597 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n banks in the city where Vasya lives, they are located in a circle, such that any two banks are neighbouring if their indices differ by no more than 1. Also, bank 1 and bank n are neighbours if n > 1. No bank is a neighbour of its... | instruction | 0 | 3,799 | 10 | 7,598 |
Tags: constructive algorithms, data structures, greedy, sortings
Correct Solution:
```
# http://codeforces.com/contest/675/problem/C
from collections import defaultdict
n = int(input())
l = list(map(int, input().split()))
# frequency of the most frequent cumulative sum, using hash
d = defaultdict(int)
cost = n-1
s ... | output | 1 | 3,799 | 10 | 7,599 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n banks in the city where Vasya lives, they are located in a circle, such that any two banks are neighbouring if their indices differ by no more than 1. Also, bank 1 and bank n are neighbours if n > 1. No bank is a neighbour of its... | instruction | 0 | 3,800 | 10 | 7,600 |
Tags: constructive algorithms, data structures, greedy, sortings
Correct Solution:
```
n = int(input(""))
l = input("").split(" ")
for i in range(len(l)):
l[i] = int(l[i])
s = 0
m = 0
ps = {}
for i in range(len(l)):
s += l[i]
if (s in ps):
ps[s] += 1
else:
ps[s] = 1
if (ps[s] > m):
... | output | 1 | 3,800 | 10 | 7,601 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n banks in the city where Vasya lives, they are located in a circle, such that any two banks are neighbouring if their indices differ by no more than 1. Also, bank 1 and bank n are neighbours if n > 1. No bank is a neighbour of its... | instruction | 0 | 3,801 | 10 | 7,602 |
Tags: constructive algorithms, data structures, greedy, sortings
Correct Solution:
```
n = int(input())
a = list(map(int, input().split()))
d = dict()
total = 0
for i in range(n):
total += a[i]
d[total] = 0
total = 0
ans = 0
for i in range(n):
total += a[i]
d[total] += 1
ans = max(ans, d[total])
print(n - ans)
... | output | 1 | 3,801 | 10 | 7,603 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n banks in the city where Vasya lives, they are located in a circle, such that any two banks are neighbouring if their indices differ by no more than 1. Also, bank 1 and bank n are neighbours if n > 1. No bank is a neighbour of its... | instruction | 0 | 3,802 | 10 | 7,604 |
Tags: constructive algorithms, data structures, greedy, sortings
Correct Solution:
```
"""
def sol(arr):
n = len(arr)
# avg = int(np.mean(arr))
# print(avg)
# for i in range(n):
# arr[i]-=avg
for i in range(n-1):
arr[i+1]+=arr[i]
res = arr.count(max(set(arr),key=arr.count))
re... | output | 1 | 3,802 | 10 | 7,605 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n banks in the city where Vasya lives, they are located in a circle, such that any two banks are neighbouring if their indices differ by no more than 1. Also, bank 1 and bank n are neighbours if n > 1. No bank is a neighbour of its... | instruction | 0 | 3,803 | 10 | 7,606 |
Tags: constructive algorithms, data structures, greedy, sortings
Correct Solution:
```
import sys
input=sys.stdin.readline
from collections import defaultdict as dd
n=int(input())
a=list(map(int,input().split()))
d=dd(int)
sa=0
ans=10**9
for i in range(n):
sa+=a[i]
d[sa]+=1
ans=min(ans,n-d[sa])
print(ans)
`... | output | 1 | 3,803 | 10 | 7,607 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n banks in the city where Vasya lives, they are located in a circle, such that any two banks are neighbouring if their indices differ by no more than 1. Also, bank 1 and bank n are nei... | instruction | 0 | 3,804 | 10 | 7,608 |
Yes | output | 1 | 3,804 | 10 | 7,609 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n banks in the city where Vasya lives, they are located in a circle, such that any two banks are neighbouring if their indices differ by no more than 1. Also, bank 1 and bank n are nei... | instruction | 0 | 3,805 | 10 | 7,610 |
Yes | output | 1 | 3,805 | 10 | 7,611 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n banks in the city where Vasya lives, they are located in a circle, such that any two banks are neighbouring if their indices differ by no more than 1. Also, bank 1 and bank n are nei... | instruction | 0 | 3,806 | 10 | 7,612 |
Yes | output | 1 | 3,806 | 10 | 7,613 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n banks in the city where Vasya lives, they are located in a circle, such that any two banks are neighbouring if their indices differ by no more than 1. Also, bank 1 and bank n are nei... | instruction | 0 | 3,807 | 10 | 7,614 |
Yes | output | 1 | 3,807 | 10 | 7,615 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n banks in the city where Vasya lives, they are located in a circle, such that any two banks are neighbouring if their indices differ by no more than 1. Also, bank 1 and bank n are nei... | instruction | 0 | 3,808 | 10 | 7,616 |
No | output | 1 | 3,808 | 10 | 7,617 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n banks in the city where Vasya lives, they are located in a circle, such that any two banks are neighbouring if their indices differ by no more than 1. Also, bank 1 and bank n are nei... | instruction | 0 | 3,809 | 10 | 7,618 |
No | output | 1 | 3,809 | 10 | 7,619 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n banks in the city where Vasya lives, they are located in a circle, such that any two banks are neighbouring if their indices differ by no more than 1. Also, bank 1 and bank n are nei... | instruction | 0 | 3,810 | 10 | 7,620 |
No | output | 1 | 3,810 | 10 | 7,621 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are n banks in the city where Vasya lives, they are located in a circle, such that any two banks are neighbouring if their indices differ by no more than 1. Also, bank 1 and bank n are nei... | instruction | 0 | 3,811 | 10 | 7,622 |
No | output | 1 | 3,811 | 10 | 7,623 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.
The consumption tax rate for foods in this shop is 8 percent. That is, to buy an apple pie priced at X yen before tax, yo... | instruction | 0 | 4,841 | 10 | 9,682 |
"Correct Solution:
```
n = int(input())
for i in range(50001):
if n == int(i*1.08):
print (i)
exit()
print (":(")
``` | output | 1 | 4,841 | 10 | 9,683 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.
The consumption tax rate for foods in this shop is 8 percent. That is, to buy an apple pie priced at X yen before tax, yo... | instruction | 0 | 4,842 | 10 | 9,684 |
"Correct Solution:
```
n=int(input())
for i in range(1,n+1):
if int(i*1.08)==n:
print(i)
exit()
print(":(")
``` | output | 1 | 4,842 | 10 | 9,685 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.
The consumption tax rate for foods in this shop is 8 percent. That is, to buy an apple pie priced at X yen before tax, yo... | instruction | 0 | 4,843 | 10 | 9,686 |
"Correct Solution:
```
import math
price = int(input())
if price%1.08<0.1:
print(":(")
else:
print(math.ceil(price/1.08))
``` | output | 1 | 4,843 | 10 | 9,687 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.
The consumption tax rate for foods in this shop is 8 percent. That is, to buy an apple pie priced at X yen before tax, yo... | instruction | 0 | 4,844 | 10 | 9,688 |
"Correct Solution:
```
n=int(input())
if n%27==13 or n%27==26:
print(":(")
else:
print(int(float(n+1)//1.08))
``` | output | 1 | 4,844 | 10 | 9,689 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.
The consumption tax rate for foods in this shop is 8 percent. That is, to buy an apple pie priced at X yen before tax, yo... | instruction | 0 | 4,845 | 10 | 9,690 |
"Correct Solution:
```
n = int(input())
for i in range(1, 50000):
if i * 108 // 100 == n:
print(i)
exit()
print(':(')
``` | output | 1 | 4,845 | 10 | 9,691 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.
The consumption tax rate for foods in this shop is 8 percent. That is, to buy an apple pie priced at X yen before tax, yo... | instruction | 0 | 4,846 | 10 | 9,692 |
"Correct Solution:
```
a=int(input())
b=0
for i in range(a+1):
c=i
c+=(i*8)//100
if c==a:
b=i
print(":("if b==0 else b)
``` | output | 1 | 4,846 | 10 | 9,693 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.
The consumption tax rate for foods in this shop is 8 percent. That is, to buy an apple pie priced at X yen before tax, yo... | instruction | 0 | 4,847 | 10 | 9,694 |
"Correct Solution:
```
N = int(input())
ans = ":("
for i in range(N+1):
if int(i*1.08) == N:
ans = i
print(ans)
``` | output | 1 | 4,847 | 10 | 9,695 |
Provide a correct Python 3 solution for this coding contest problem.
Takahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.
The consumption tax rate for foods in this shop is 8 percent. That is, to buy an apple pie priced at X yen before tax, yo... | instruction | 0 | 4,848 | 10 | 9,696 |
"Correct Solution:
```
ng=":("
n=int(input())
for i in range(50000):
if int(i*1.08)==n:
ans=i
print(ans);exit()
print(ng)
``` | output | 1 | 4,848 | 10 | 9,697 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.
The consumption tax rate for foods in this shop is 8 percent. Tha... | instruction | 0 | 4,849 | 10 | 9,698 |
Yes | output | 1 | 4,849 | 10 | 9,699 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.
The consumption tax rate for foods in this shop is 8 percent. Tha... | instruction | 0 | 4,850 | 10 | 9,700 |
Yes | output | 1 | 4,850 | 10 | 9,701 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.
The consumption tax rate for foods in this shop is 8 percent. Tha... | instruction | 0 | 4,851 | 10 | 9,702 |
Yes | output | 1 | 4,851 | 10 | 9,703 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.
The consumption tax rate for foods in this shop is 8 percent. Tha... | instruction | 0 | 4,852 | 10 | 9,704 |
Yes | output | 1 | 4,852 | 10 | 9,705 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.
The consumption tax rate for foods in this shop is 8 percent. Tha... | instruction | 0 | 4,853 | 10 | 9,706 |
No | output | 1 | 4,853 | 10 | 9,707 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.
The consumption tax rate for foods in this shop is 8 percent. Tha... | instruction | 0 | 4,854 | 10 | 9,708 |
No | output | 1 | 4,854 | 10 | 9,709 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.
The consumption tax rate for foods in this shop is 8 percent. Tha... | instruction | 0 | 4,855 | 10 | 9,710 |
No | output | 1 | 4,855 | 10 | 9,711 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Takahashi bought a piece of apple pie at ABC Confiserie. According to his memory, he paid N yen (the currency of Japan) for it.
The consumption tax rate for foods in this shop is 8 percent. Tha... | instruction | 0 | 4,856 | 10 | 9,712 |
No | output | 1 | 4,856 | 10 | 9,713 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are the head of a large enterprise. n people work at you, and n is odd (i. e. n is not divisible by 2).
You have to distribute salaries to your employees. Initially, you have s dollars for it, and the i-th employee should get a salary f... | instruction | 0 | 5,129 | 10 | 10,258 |
Tags: binary search, greedy, sortings
Correct Solution:
```
def main():
def getLowestPossibleMedian(lr,n):
lr.sort(key=lambda x:x[0]) # sort by l asc
return lr[n//2][0]
def checkPossibleMedian(lr,guess,n,s):
potentialUpper=[] # potential candidates for the upper half
l... | output | 1 | 5,129 | 10 | 10,259 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.