message stringlengths 2 48.6k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 318 108k | cluster float64 8 8 | __index_level_0__ int64 636 217k |
|---|---|---|---|---|---|
Provide tags and a correct Python 3 solution for this coding contest problem.
Having bought his own apartment, Boris decided to paper the walls in every room. Boris's flat has n rooms, each of which has the form of a rectangular parallelepiped. For every room we known its length, width and height of the walls in meter... | instruction | 0 | 35,372 | 8 | 70,744 |
Tags: implementation, math
Correct Solution:
```
n,a=int(input()),[]
for i in range(n):a.append(list(map(int,input().split())))
m,b=int(input()),[]
for i in range(m):b.append(list(map(int,input().split())))
ans = 0
for room in a:
p,c_room=2*(room[0]+room[1]),10**10
for ob in b:
z=ob[0]//room[2]*ob[1]
... | output | 1 | 35,372 | 8 | 70,745 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Having bought his own apartment, Boris decided to paper the walls in every room. Boris's flat has n rooms, each of which has the form of a rectangular parallelepiped. For every room we known its length, width and height of the walls in meter... | instruction | 0 | 35,373 | 8 | 70,746 |
Tags: implementation, math
Correct Solution:
```
n = int(input())
rooms = []
for _ in range(n):
rooms.append(list(map(int, input().split())))
m = int(input())
wallpapers = []
for _ in range(m):
wallpapers.append(list(map(int, input().split())))
def room_cost(room, wallpapers):
min_cost = 10**18
parim... | output | 1 | 35,373 | 8 | 70,747 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Having bought his own apartment, Boris decided to paper the walls in every room. Boris's flat has n rooms, each of which has the form of a rectangular parallelepiped. For every room we known its length, width and height of the walls in meter... | instruction | 0 | 35,374 | 8 | 70,748 |
Tags: implementation, math
Correct Solution:
```
n = int(input())
rooms = [[int(i) for i in input().split()] for i in range(n)]
m = int(input())
papers = [[int(i) for i in input().split()] for i in range(m)]
ans = 0
for room in rooms:
per = (room[0]+room[1])*2
prices = []
for cur in papers:
power = cur[0]//room[2]... | output | 1 | 35,374 | 8 | 70,749 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Having bought his own apartment, Boris decided to paper the walls in every room. Boris's flat has n rooms, each of which has the form of a rectangular parallelepiped. For every room we known its length, width and height of the walls in meter... | instruction | 0 | 35,375 | 8 | 70,750 |
Tags: implementation, math
Correct Solution:
```
#------------------------------warmup----------------------------
import os
import sys
import math
from io import BytesIO, IOBase
from fractions import Fraction
BUFSIZE = 8192
class FastIO(IOBase):
newlines = 0
def __init__(self, file):
self._fd =... | output | 1 | 35,375 | 8 | 70,751 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Having bought his own apartment, Boris decided to paper the walls in every room. Boris's flat has n rooms, each of which has the form of a rectangular parallelepiped. For every room we known its length, width and height of the walls in meter... | instruction | 0 | 35,376 | 8 | 70,752 |
Tags: implementation, math
Correct Solution:
```
import math
n = int(input())
lis=[]
wall=[]
for _ in range(n):
a,b,c = map(int,input().split())
lis.append([a,b,c])
m = int(input())
for _ in range(m):
a,b,c = map(int,input().split())
wall.append([a,b,c])
ans=0
for i in range(n):
tmp=10000000000000... | output | 1 | 35,376 | 8 | 70,753 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Having bought his own apartment, Boris decided to paper the walls in every room. Boris's flat has n rooms, each of which has the form of a rectangular parallelepiped. For every room we known its... | instruction | 0 | 35,377 | 8 | 70,754 |
Yes | output | 1 | 35,377 | 8 | 70,755 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Having bought his own apartment, Boris decided to paper the walls in every room. Boris's flat has n rooms, each of which has the form of a rectangular parallelepiped. For every room we known its... | instruction | 0 | 35,378 | 8 | 70,756 |
Yes | output | 1 | 35,378 | 8 | 70,757 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Having bought his own apartment, Boris decided to paper the walls in every room. Boris's flat has n rooms, each of which has the form of a rectangular parallelepiped. For every room we known its... | instruction | 0 | 35,379 | 8 | 70,758 |
Yes | output | 1 | 35,379 | 8 | 70,759 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Having bought his own apartment, Boris decided to paper the walls in every room. Boris's flat has n rooms, each of which has the form of a rectangular parallelepiped. For every room we known its... | instruction | 0 | 35,380 | 8 | 70,760 |
No | output | 1 | 35,380 | 8 | 70,761 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Having bought his own apartment, Boris decided to paper the walls in every room. Boris's flat has n rooms, each of which has the form of a rectangular parallelepiped. For every room we known its... | instruction | 0 | 35,381 | 8 | 70,762 |
No | output | 1 | 35,381 | 8 | 70,763 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vova, the Ultimate Thule new shaman, wants to build a pipeline. As there are exactly n houses in Ultimate Thule, Vova wants the city to have exactly n pipes, each such pipe should be connected to the water supply. A pipe can be connected to ... | instruction | 0 | 35,465 | 8 | 70,930 |
Tags: binary search, math
Correct Solution:
```
def bs(n, k, lo, hi):
while lo <= hi:
mid = (hi + lo)//2
summ = ((k * (k + 1))//2 - 1) - (((mid-1) * (mid))//2 -1) - (k-2)
if summ == n: return k - mid + 1
elif summ > n: lo = mid + 1
elif summ < n: hi = mid - 1
... | output | 1 | 35,465 | 8 | 70,931 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vova, the Ultimate Thule new shaman, wants to build a pipeline. As there are exactly n houses in Ultimate Thule, Vova wants the city to have exactly n pipes, each such pipe should be connected to the water supply. A pipe can be connected to ... | instruction | 0 | 35,466 | 8 | 70,932 |
Tags: binary search, math
Correct Solution:
```
n, k = map(int, input().split())
l, r = -1, k+1
while l+1 < r:
mid = l + r >> 1
val = (k - mid + 1 + k) * mid // 2 - (mid - 1)
if val < n:
l = mid
else:
r = mid
print(-1 if r == k+1 else r)
``` | output | 1 | 35,466 | 8 | 70,933 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vova, the Ultimate Thule new shaman, wants to build a pipeline. As there are exactly n houses in Ultimate Thule, Vova wants the city to have exactly n pipes, each such pipe should be connected to the water supply. A pipe can be connected to ... | instruction | 0 | 35,467 | 8 | 70,934 |
Tags: binary search, math
Correct Solution:
```
R = lambda: map(int, input().split())
n, k = R()
if n == 1:
print(0)
exit(0)
if 1 + k * (k - 1) // 2 < n:
print(-1)
exit(0)
l, r = 0, k - 1
while l < r:
m = (l + r + 1) // 2
if 1 + (m + k - 1) * (k - 1 - m + 1) // 2 >= n:
l = m
else:
... | output | 1 | 35,467 | 8 | 70,935 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vova, the Ultimate Thule new shaman, wants to build a pipeline. As there are exactly n houses in Ultimate Thule, Vova wants the city to have exactly n pipes, each such pipe should be connected to the water supply. A pipe can be connected to ... | instruction | 0 | 35,468 | 8 | 70,936 |
Tags: binary search, math
Correct Solution:
```
f = lambda m, k: (k*m - m*(m-1)//2 - m + 1)
def ok(m, k, n):
return f(m, k) >= n
n, k = map(int, input().split())
if not ok(k, k, n): print(-1)
else:
l, h = 0, k
while (h > l):
mid = l + (h - l) // 2
if ok(mid, k, n): h = mid
else: ... | output | 1 | 35,468 | 8 | 70,937 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vova, the Ultimate Thule new shaman, wants to build a pipeline. As there are exactly n houses in Ultimate Thule, Vova wants the city to have exactly n pipes, each such pipe should be connected to the water supply. A pipe can be connected to ... | instruction | 0 | 35,469 | 8 | 70,938 |
Tags: binary search, math
Correct Solution:
```
n, k = map(int, input().split())
m = 2 * (n - 1) - k * (k - 1)
if m > 0: print(-1)
else:
x = int((1 + (1 - 4 * m) ** 0.5) / 2)
if x * (x - 1) + m > 0: x -= 1
print(k - x)
``` | output | 1 | 35,469 | 8 | 70,939 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vova, the Ultimate Thule new shaman, wants to build a pipeline. As there are exactly n houses in Ultimate Thule, Vova wants the city to have exactly n pipes, each such pipe should be connected to the water supply. A pipe can be connected to ... | instruction | 0 | 35,470 | 8 | 70,940 |
Tags: binary search, math
Correct Solution:
```
import sys
import math
def readlines(type=int):
return list(map(type, sys.stdin.readline().split()))
def read(type=int):
return type(sys.stdin.readline().strip())
joint = lambda it, sep=" ": sep.join(
[str(i) if type(i) != list else sep.join(map(str, i))... | output | 1 | 35,470 | 8 | 70,941 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vova, the Ultimate Thule new shaman, wants to build a pipeline. As there are exactly n houses in Ultimate Thule, Vova wants the city to have exactly n pipes, each such pipe should be connected to the water supply. A pipe can be connected to ... | instruction | 0 | 35,471 | 8 | 70,942 |
Tags: binary search, math
Correct Solution:
```
import sys
def getSum(a):
sum1 = a * (a + 1) // 2
return sum1
def getSumOfTwo(a, b):
if a <= 1:
return getSum(b)
return getSum(b) - getSum(a - 1)
n, k = [int(elem) for elem in input().split()]
if n == 1:
print(0)
sys.exit(0)
if n <= k:
... | output | 1 | 35,471 | 8 | 70,943 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Vova, the Ultimate Thule new shaman, wants to build a pipeline. As there are exactly n houses in Ultimate Thule, Vova wants the city to have exactly n pipes, each such pipe should be connected to the water supply. A pipe can be connected to ... | instruction | 0 | 35,472 | 8 | 70,944 |
Tags: binary search, math
Correct Solution:
```
z,x=map(int,input().split())
z-=1;x-=1
if x*(x+1)/2 < z :
print(-1)
elif z==0:
print(0)
elif z==x:
print(1)
else:
import sys
start = 1 ; end = x
while end > start:
mid = (end +start)//2
ans =(x*(x+1)//2)-((mid-1... | output | 1 | 35,472 | 8 | 70,945 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vova, the Ultimate Thule new shaman, wants to build a pipeline. As there are exactly n houses in Ultimate Thule, Vova wants the city to have exactly n pipes, each such pipe should be connected t... | instruction | 0 | 35,476 | 8 | 70,952 |
Yes | output | 1 | 35,476 | 8 | 70,953 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Vova, the Ultimate Thule new shaman, wants to build a pipeline. As there are exactly n houses in Ultimate Thule, Vova wants the city to have exactly n pipes, each such pipe should be connected t... | instruction | 0 | 35,480 | 8 | 70,960 |
No | output | 1 | 35,480 | 8 | 70,961 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Peter decided to lay a parquet in the room of size n × m, the parquet consists of tiles of size 1 × 2. When the workers laid the parquet, it became clear that the tiles pattern looks not like Peter likes, and workers will have to re-lay it.
... | instruction | 0 | 35,660 | 8 | 71,320 |
Tags: constructive algorithms
Correct Solution:
```
#!/usr/bin/env python3
board = []
n, m = 0, 0
def rotate(x, y):
if board[x][y] == 'L':
board[x][y] = board[x][y+1] = 'U'
board[x+1][y] = board[x+1][y+1] = 'D'
else:
board[x][y] = board[x+1][y] = 'L'
board[x][y+1] = board[x+1][... | output | 1 | 35,660 | 8 | 71,321 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Arkady wants to water his only flower. Unfortunately, he has a very poor watering system that was designed for n flowers and so it looks like a pipe with n holes. Arkady can only use the water that flows from the first hole.
Arkady can bloc... | instruction | 0 | 35,713 | 8 | 71,426 |
Tags: math, sortings
Correct Solution:
```
rd = lambda: map(int, input().split())
n, a, b = rd()
l, *m = list(rd())
m.sort()
x = l * a / b - l
for y in m:
x -= y
if x < 0:
break
n -= 1
print(n - 1)
``` | output | 1 | 35,713 | 8 | 71,427 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Arkady wants to water his only flower. Unfortunately, he has a very poor watering system that was designed for n flowers and so it looks like a pipe with n holes. Arkady can only use the water that flows from the first hole.
Arkady can bloc... | instruction | 0 | 35,714 | 8 | 71,428 |
Tags: math, sortings
Correct Solution:
```
from bisect import bisect_right
def get_ints():
return map(int, input().split())
def get_list():
return list(map(int, input().split()))
def min_value_greater_than(arr, k):
arr.sort()
return arr[bisect_right(arr, k)]
# YOUR CODE HERE
n,A,B = get_ints()
s = ... | output | 1 | 35,714 | 8 | 71,429 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Arkady wants to water his only flower. Unfortunately, he has a very poor watering system that was designed for n flowers and so it looks like a pipe with n holes. Arkady can only use the water that flows from the first hole.
Arkady can bloc... | instruction | 0 | 35,715 | 8 | 71,430 |
Tags: math, sortings
Correct Solution:
```
n,A,B = map(int, input().split())
L = list(map(int, input().split()))
a = L[0]
S = sum(L)
L = sorted(L[1:],reverse=True)
count = 0
for i in L:
if a/S*A>=B:
break
else:
S-=i
count+=1
print(count)
``` | output | 1 | 35,715 | 8 | 71,431 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Arkady wants to water his only flower. Unfortunately, he has a very poor watering system that was designed for n flowers and so it looks like a pipe with n holes. Arkady can only use the water that flows from the first hole.
Arkady can bloc... | instruction | 0 | 35,716 | 8 | 71,432 |
Tags: math, sortings
Correct Solution:
```
import math
n, A, B = map(int, input().split())
H = list( map(int ,input().split()) )
first = H.pop(0)
H.sort(reverse=True)
total = sum(H) + first
#boundary
rate = (first*A)//total
if rate >= B:
print(0)
else:
for i in range(0, n-1):
total -= H[i]
i... | output | 1 | 35,716 | 8 | 71,433 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Arkady wants to water his only flower. Unfortunately, he has a very poor watering system that was designed for n flowers and so it looks like a pipe with n holes. Arkady can only use the water that flows from the first hole.
Arkady can bloc... | instruction | 0 | 35,717 | 8 | 71,434 |
Tags: math, sortings
Correct Solution:
```
n, a, b = map(int, input().split())
u = list(map(int, input().split()))
p = u[0]
u = u[1:] + [0]
u.sort()
u[0] = p
ok = True
for i in range(1, n):
u[i] += u[i - 1]
ans = p * a / u[i]
if ans < b:
print(n - i)
ok = False
break
if ok:
print... | output | 1 | 35,717 | 8 | 71,435 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Arkady wants to water his only flower. Unfortunately, he has a very poor watering system that was designed for n flowers and so it looks like a pipe with n holes. Arkady can only use the water that flows from the first hole.
Arkady can bloc... | instruction | 0 | 35,718 | 8 | 71,436 |
Tags: math, sortings
Correct Solution:
```
line0=list(map(int,input().split()))
S=list(map(int,input().split()))
n,v_total,v_need=line0[0],line0[1],line0[2]
S_others=S[1:]
S_others.sort()
S0=S[0]
count=0
S_others_intotal=sum(S_others)
percent=S[0]/(S[0]+S_others_intotal)
while percent<(v_need/v_total):
count+=1
... | output | 1 | 35,718 | 8 | 71,437 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Arkady wants to water his only flower. Unfortunately, he has a very poor watering system that was designed for n flowers and so it looks like a pipe with n holes. Arkady can only use the water that flows from the first hole.
Arkady can bloc... | instruction | 0 | 35,719 | 8 | 71,438 |
Tags: math, sortings
Correct Solution:
```
n, A, B = list(map(int, input().split()))
s = list(map(int, input().split()))
holes = sorted(s[1:])
holes.reverse()
t = sum(holes)
if (t + s[0]) * B <= s[0] * A:
print(0)
exit(0)
for i in range(n - 1):
t -= holes[i]
if (t + s[0]) * B <= s[0] * A:
print(i + 1)
exit(0... | output | 1 | 35,719 | 8 | 71,439 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Arkady wants to water his only flower. Unfortunately, he has a very poor watering system that was designed for n flowers and so it looks like a pipe with n holes. Arkady can only use the water that flows from the first hole.
Arkady can bloc... | instruction | 0 | 35,720 | 8 | 71,440 |
Tags: math, sortings
Correct Solution:
```
n, A, B = map(int, input().split())
st = input()
a = st.split()
S = 0
for i in range(n):
a[i] = int(a[i])
S += a[i]
answer = -1
if a[0] * A / S >= B:
answer = 0
else:
b = a[1:]
b.sort(reverse=True)
a[1:] = b
for i in range(1, n):
S -= a[... | output | 1 | 35,720 | 8 | 71,441 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Arkady wants to water his only flower. Unfortunately, he has a very poor watering system that was designed for n flowers and so it looks like a pipe with n holes. Arkady can only use the water t... | instruction | 0 | 35,721 | 8 | 71,442 |
Yes | output | 1 | 35,721 | 8 | 71,443 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Arkady wants to water his only flower. Unfortunately, he has a very poor watering system that was designed for n flowers and so it looks like a pipe with n holes. Arkady can only use the water t... | instruction | 0 | 35,722 | 8 | 71,444 |
Yes | output | 1 | 35,722 | 8 | 71,445 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Arkady wants to water his only flower. Unfortunately, he has a very poor watering system that was designed for n flowers and so it looks like a pipe with n holes. Arkady can only use the water t... | instruction | 0 | 35,723 | 8 | 71,446 |
Yes | output | 1 | 35,723 | 8 | 71,447 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Arkady wants to water his only flower. Unfortunately, he has a very poor watering system that was designed for n flowers and so it looks like a pipe with n holes. Arkady can only use the water t... | instruction | 0 | 35,724 | 8 | 71,448 |
Yes | output | 1 | 35,724 | 8 | 71,449 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Arkady wants to water his only flower. Unfortunately, he has a very poor watering system that was designed for n flowers and so it looks like a pipe with n holes. Arkady can only use the water t... | instruction | 0 | 35,725 | 8 | 71,450 |
No | output | 1 | 35,725 | 8 | 71,451 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Arkady wants to water his only flower. Unfortunately, he has a very poor watering system that was designed for n flowers and so it looks like a pipe with n holes. Arkady can only use the water t... | instruction | 0 | 35,726 | 8 | 71,452 |
No | output | 1 | 35,726 | 8 | 71,453 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Arkady wants to water his only flower. Unfortunately, he has a very poor watering system that was designed for n flowers and so it looks like a pipe with n holes. Arkady can only use the water t... | instruction | 0 | 35,727 | 8 | 71,454 |
No | output | 1 | 35,727 | 8 | 71,455 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Arkady wants to water his only flower. Unfortunately, he has a very poor watering system that was designed for n flowers and so it looks like a pipe with n holes. Arkady can only use the water t... | instruction | 0 | 35,728 | 8 | 71,456 |
No | output | 1 | 35,728 | 8 | 71,457 |
Provide a correct Python 3 solution for this coding contest problem.
The deadline of Prof. Hachioji’s assignment is tomorrow. To complete the task, students have to copy pages of many reference books in the library.
All the reference books are in a storeroom and only the librarian is allowed to enter it. To obtain a ... | instruction | 0 | 35,921 | 8 | 71,842 |
"Correct Solution:
```
def solve():
from collections import deque
from sys import stdin
f_i = stdin
ans = []
while True:
m, c, n = map(int, f_i.readline().split())
if m == 0:
break
book_pos = dict()
studens = deque()
shelf = m + 1
... | output | 1 | 35,921 | 8 | 71,843 |
Provide a correct Python 3 solution for this coding contest problem.
Problem statement
Here are N mysteriously shaped vases. The i-th jar is a shape in which K_i right-sided cylinders are vertically connected in order from the bottom. The order in which they are connected cannot be changed. Mr. A has a volume of wate... | instruction | 0 | 35,950 | 8 | 71,900 |
"Correct Solution:
```
def main():
n, m = map(int, input().split())
height = []
for _ in range(n):
lst = list(map(int, input().split()))
k = lst[0]
ss = lst[1::2]
hs = lst[2::2]
v_acc = 0
h_acc = 0
index = 0
s, h = ss[0], hs[0]
save = []
for i in range(m + 1):
if i < ... | output | 1 | 35,950 | 8 | 71,901 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Problem statement
Here are N mysteriously shaped vases. The i-th jar is a shape in which K_i right-sided cylinders are vertically connected in order from the bottom. The order in which they are... | instruction | 0 | 35,951 | 8 | 71,902 |
No | output | 1 | 35,951 | 8 | 71,903 |
Provide a correct Python 3 solution for this coding contest problem.
<image>
Matryoshka is a wooden doll in the shape of a female figure and is a typical Russian folk craft. Matryoshka has a nested structure in which smaller dolls are contained inside a large doll, and is composed of multiple dolls of different sizes... | instruction | 0 | 36,760 | 8 | 73,520 |
"Correct Solution:
```
while 1:
N = int(input())
if not N:
break
S = []
for i in range(N):
h, r = map(int, input().split())
S.append((h, r))
M = int(input())
for i in range(M):
h, r = map(int, input().split())
S.append((h, r))
S.sort()
memo = [-1]... | output | 1 | 36,760 | 8 | 73,521 |
Provide a correct Python 3 solution for this coding contest problem.
<image>
Matryoshka is a wooden doll in the shape of a female figure and is a typical Russian folk craft. Matryoshka has a nested structure in which smaller dolls are contained inside a large doll, and is composed of multiple dolls of different sizes... | instruction | 0 | 36,761 | 8 | 73,522 |
"Correct Solution:
```
while True:
n = int(input())
if n == 0:
break
hr_lst = []
for _ in range(n):
h, r = map(int, input().split())
hr_lst.append((h, r))
m = int(input())
for _ in range(m):
h, r = map(int, input().split())
hr_lst.append((h, r))
hr_lst.sort(reverse=True)
r_lst... | output | 1 | 36,761 | 8 | 73,523 |
Provide a correct Python 3 solution for this coding contest problem.
<image>
Matryoshka is a wooden doll in the shape of a female figure and is a typical Russian folk craft. Matryoshka has a nested structure in which smaller dolls are contained inside a large doll, and is composed of multiple dolls of different sizes... | instruction | 0 | 36,762 | 8 | 73,524 |
"Correct Solution:
```
while True:
n = int(input())
if n == 0:
break
hr_lst = []
for _ in range(n):
h, r = map(int, input().split())
hr_lst.append((h, r))
m = int(input())
for _ in range(m):
h, r = map(int, input().split())
hr_lst.append((h, r))
hr_lst.sort(reverse=True)
r_lst... | output | 1 | 36,762 | 8 | 73,525 |
Provide a correct Python 3 solution for this coding contest problem.
<image>
Matryoshka is a wooden doll in the shape of a female figure and is a typical Russian folk craft. Matryoshka has a nested structure in which smaller dolls are contained inside a large doll, and is composed of multiple dolls of different sizes... | instruction | 0 | 36,763 | 8 | 73,526 |
"Correct Solution:
```
while 1:
n = int(input())
if n == 0:
break
objects = []
for i in range(n):
h,r = (int(x) for x in input().split())
objects.append((h,r))
n = int(input())
for i in range(n):
h,r = (int(x) for x in input().split())
objects.append((h,r)... | output | 1 | 36,763 | 8 | 73,527 |
Provide a correct Python 3 solution for this coding contest problem.
<image>
Matryoshka is a wooden doll in the shape of a female figure and is a typical Russian folk craft. Matryoshka has a nested structure in which smaller dolls are contained inside a large doll, and is composed of multiple dolls of different sizes... | instruction | 0 | 36,764 | 8 | 73,528 |
"Correct Solution:
```
# AOJ 0157: Russian Dolls
# Python3 2018.6.19 bal4u
# 単調増加シーケンスの最長値問題（LIS）
def LIS(hr):
n = len(hr)
lis = [0]*n
lis[n-1] = 1;
for i in range(n-2, -1, -1):
m = 0;
for j in range(i+1, n):
if hr[i][0] < hr[j][0] and hr[i][1] < hr[j][1] and lis[j] > m: m = lis[j]
lis[i] = m+1
return ... | output | 1 | 36,764 | 8 | 73,529 |
Provide a correct Python 3 solution for this coding contest problem.
<image>
Matryoshka is a wooden doll in the shape of a female figure and is a typical Russian folk craft. Matryoshka has a nested structure in which smaller dolls are contained inside a large doll, and is composed of multiple dolls of different sizes... | instruction | 0 | 36,765 | 8 | 73,530 |
"Correct Solution:
```
while True:
n=int(input())
if n==0:
break
dolls=[]
for i in range(n):
h,r=[int(j) for j in input().split(" ")]
dolls.append((h,r))
m=int(input())
for j in range(m):
h,r=[int(j) for j in input().split(" ")]
dolls.append((h,r))
do... | output | 1 | 36,765 | 8 | 73,531 |
Provide a correct Python 3 solution for this coding contest problem.
<image>
Matryoshka is a wooden doll in the shape of a female figure and is a typical Russian folk craft. Matryoshka has a nested structure in which smaller dolls are contained inside a large doll, and is composed of multiple dolls of different sizes... | instruction | 0 | 36,766 | 8 | 73,532 |
"Correct Solution:
```
while True:
n = int(input())
if n == 0:
break
hr_lst = []
for _ in range(n):
h, r = map(int, input().split())
hr_lst.append((h, r))
m = int(input())
for _ in range(m):
h, r = map(int, input().split())
hr_lst.append((h, r))
hr_lst.sort(reverse=True)
r_lst... | output | 1 | 36,766 | 8 | 73,533 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
<image>
Matryoshka is a wooden doll in the shape of a female figure and is a typical Russian folk craft. Matryoshka has a nested structure in which smaller dolls are contained inside a large do... | instruction | 0 | 36,767 | 8 | 73,534 |
No | output | 1 | 36,767 | 8 | 73,535 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Amr loves Chemistry, and specially doing experiments. He is preparing for a new interesting experiment.
Amr has n different types of chemicals. Each chemical i has an initial volume of ai liters. For this experiment, Amr has to mix all the ... | instruction | 0 | 37,229 | 8 | 74,458 |
Tags: brute force, graphs, greedy, math, shortest paths
Correct Solution:
```
import itertools
n = int(input())
l = list(map(int, input().split()))
m = max(l) + 5
freq = [0 for _ in range(m)]
count= [0 for _ in range(m)]
vis = [-1 for _ in range(m)]
for i in range(n):
q = [(l[i], 0)]
pos = 0
while len(q)... | output | 1 | 37,229 | 8 | 74,459 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Amr loves Chemistry, and specially doing experiments. He is preparing for a new interesting experiment.
Amr has n different types of chemicals. Each chemical i has an initial volume of ai liters. For this experiment, Amr has to mix all the ... | instruction | 0 | 37,230 | 8 | 74,460 |
Tags: brute force, graphs, greedy, math, shortest paths
Correct Solution:
```
#!/usr/bin/env python
# -*- coding: utf-8 -*-
from collections import defaultdict
n = int(input())
A = list(map(int,input().split()))
pattern = set()
for a in A:
p = []
while a > 0:
if a in pattern:
break
... | output | 1 | 37,230 | 8 | 74,461 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.