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 |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It is nighttime and Joe the Elusive got into the country's main bank's safe. The safe has n cells positioned in a row, each of them contains some amount of diamonds. Let's make the problem more ... | instruction | 0 | 33,074 | 8 | 66,148 |
No | output | 1 | 33,074 | 8 | 66,149 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It is nighttime and Joe the Elusive got into the country's main bank's safe. The safe has n cells positioned in a row, each of them contains some amount of diamonds. Let's make the problem more ... | instruction | 0 | 33,075 | 8 | 66,150 |
No | output | 1 | 33,075 | 8 | 66,151 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
It is nighttime and Joe the Elusive got into the country's main bank's safe. The safe has n cells positioned in a row, each of them contains some amount of diamonds. Let's make the problem more ... | instruction | 0 | 33,076 | 8 | 66,152 |
No | output | 1 | 33,076 | 8 | 66,153 |
Provide a correct Python 3 solution for this coding contest problem.
An art exhibition will be held in JOI. At the art exhibition, various works of art from all over the country will be exhibited.
N works of art were collected as candidates for the works of art to be exhibited. These works of art are numbered 1, 2, .... | instruction | 0 | 33,263 | 8 | 66,526 |
"Correct Solution:
```
import sys
sys.setrecursionlimit(2000000000)
input=lambda : sys.stdin.readline().rstrip('\n')
n=int(input())
data=[]
s=[0]
for i in range(n):
data.append(tuple(map(int,input().split())))
data=[(0,0)]+sorted(data)
for i in range(n):
s.append(s[-1]+data[i+1][1])
mx=0
ans=0
mn=10**18
for i ... | output | 1 | 33,263 | 8 | 66,527 |
Provide a correct Python 3 solution for this coding contest problem.
An art exhibition will be held in JOI. At the art exhibition, various works of art from all over the country will be exhibited.
N works of art were collected as candidates for the works of art to be exhibited. These works of art are numbered 1, 2, .... | instruction | 0 | 33,264 | 8 | 66,528 |
"Correct Solution:
```
N = int(input())
P = [list(map(int, input().split())) for i in range(N)]
P.sort()
su = 0
S = -P[0][0]
ans = -10**19
for a, b in P:
S = min(S, su - a)
ans = max(ans, su + b - a - S)
su += b
print(ans)
``` | output | 1 | 33,264 | 8 | 66,529 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
An art exhibition will be held in JOI. At the art exhibition, various works of art from all over the country will be exhibited.
N works of art were collected as candidates for the works of art ... | instruction | 0 | 33,265 | 8 | 66,530 |
No | output | 1 | 33,265 | 8 | 66,531 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Bob Bubblestrong just got a new job as security guard. Bob is now responsible for safety of a collection of warehouses, each containing the most valuable Bubble Cup assets - the high-quality bub... | instruction | 0 | 33,435 | 8 | 66,870 |
No | output | 1 | 33,435 | 8 | 66,871 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Tower of Hanoi is a well-known mathematical puzzle. It consists of three rods, and a number of disks of different sizes which can slide onto any rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod,... | instruction | 0 | 33,713 | 8 | 67,426 |
Tags: dp
Correct Solution:
```
costs = []
costs.append(list(map(int, input().split())))
costs.append(list(map(int, input().split())))
costs.append(list(map(int, input().split())))
n = int(input())
memo = {}
def cost_hanoi(n, from_, to_):
if (n, from_, to_) in memo:
return memo[(n, from_, to_)]
rods ... | output | 1 | 33,713 | 8 | 67,427 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Tower of Hanoi is a well-known mathematical puzzle. It consists of three rods, and a number of disks of different sizes which can slide onto any rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod,... | instruction | 0 | 33,714 | 8 | 67,428 |
Tags: dp
Correct Solution:
```
# !/bin/env python3
# coding: UTF-8
# ✪ H4WK3yE乡
# Mohd. Farhan Tahir
# Indian Institute Of Information Technology and Management,Gwalior
# Question Link
# https://codeforces.com/problemset/problem/392/B
#
# ///==========Libraries, Constants and Functions=============///
import sys
... | output | 1 | 33,714 | 8 | 67,429 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Tower of Hanoi is a well-known mathematical puzzle. It consists of three rods, and a number of disks of different sizes which can slide onto any rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod,... | instruction | 0 | 33,715 | 8 | 67,430 |
Tags: dp
Correct Solution:
```
def play(price, n):
# dp[i][j][k] - naimen'shaya stoimost' peremeshcheniya i blinov so sterzhnya j => k
# U nas vsegda est' dva varianta dejstviya:
# 1. Peremeshchaem i - 1 blin na mesto 2. Dalee, peremeshchaem i - yj blin na mesto 3. I nakonec peremeshchaem i - 1 blin na mes... | output | 1 | 33,715 | 8 | 67,431 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Tower of Hanoi is a well-known mathematical puzzle. It consists of three rods, and a number of disks of different sizes which can slide onto any rod. The puzzle starts with the disks in a ne... | instruction | 0 | 33,716 | 8 | 67,432 |
No | output | 1 | 33,716 | 8 | 67,433 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Tower of Hanoi is a well-known mathematical puzzle. It consists of three rods, and a number of disks of different sizes which can slide onto any rod. The puzzle starts with the disks in a ne... | instruction | 0 | 33,717 | 8 | 67,434 |
No | output | 1 | 33,717 | 8 | 67,435 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Tower of Hanoi is a well-known mathematical puzzle. It consists of three rods, and a number of disks of different sizes which can slide onto any rod. The puzzle starts with the disks in a ne... | instruction | 0 | 33,718 | 8 | 67,436 |
No | output | 1 | 33,718 | 8 | 67,437 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Tower of Hanoi is a well-known mathematical puzzle. It consists of three rods, and a number of disks of different sizes which can slide onto any rod. The puzzle starts with the disks in a ne... | instruction | 0 | 33,719 | 8 | 67,438 |
No | output | 1 | 33,719 | 8 | 67,439 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Arnie the Worm has finished eating an apple house yet again and decided to move. He made up his mind on the plan, the way the rooms are located and how they are joined by corridors. He numbered ... | instruction | 0 | 33,839 | 8 | 67,678 |
No | output | 1 | 33,839 | 8 | 67,679 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Arnie the Worm has finished eating an apple house yet again and decided to move. He made up his mind on the plan, the way the rooms are located and how they are joined by corridors. He numbered ... | instruction | 0 | 33,840 | 8 | 67,680 |
No | output | 1 | 33,840 | 8 | 67,681 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Arnie the Worm has finished eating an apple house yet again and decided to move. He made up his mind on the plan, the way the rooms are located and how they are joined by corridors. He numbered ... | instruction | 0 | 33,841 | 8 | 67,682 |
No | output | 1 | 33,841 | 8 | 67,683 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Arnie the Worm has finished eating an apple house yet again and decided to move. He made up his mind on the plan, the way the rooms are located and how they are joined by corridors. He numbered ... | instruction | 0 | 33,842 | 8 | 67,684 |
No | output | 1 | 33,842 | 8 | 67,685 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There are n piles of stones of sizes a1, a2, ..., an lying on the table in front of you.
During one move you can take one pile and add it to the other. As you add pile i to pile j, the size of pile j increases by the current size of pile i,... | instruction | 0 | 34,560 | 8 | 69,120 |
Tags: greedy
Correct Solution:
```
n = int(input())
stones = list(map(lambda t : int(t), input().split()))
q = int(input())
queries = list(map(lambda t : int(t), input().split()))
stones.sort()
added_stones = []
added_stones.append(stones[0])
for i in range(1, n, 1):
added_stones.append(stones[i] + added_stones[i... | output | 1 | 34,560 | 8 | 69,121 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Fair Nut lives in n story house. a_i people live on the i-th floor of the house. Every person uses elevator twice a day: to get from the floor where he/she lives to the ground (first) floor and to get from the first floor to the floor wh... | instruction | 0 | 35,171 | 8 | 70,342 |
Tags: brute force, implementation
Correct Solution:
```
n = int(input())
numOfPeople = list(map(int, input().split(' ')))
counter = 0
while n > 1:
counter = counter + 2*(numOfPeople[n-1]*((2*n)- 2))
n = n - 1
print(counter)
``` | output | 1 | 35,171 | 8 | 70,343 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Fair Nut lives in n story house. a_i people live on the i-th floor of the house. Every person uses elevator twice a day: to get from the floor where he/she lives to the ground (first) floor and to get from the first floor to the floor wh... | instruction | 0 | 35,172 | 8 | 70,344 |
Tags: brute force, implementation
Correct Solution:
```
n=int(input())
a=list(map(int,input().split()))
ans=0
for i in range(n):
ans+=4*a[i]*i
print(ans)
``` | output | 1 | 35,172 | 8 | 70,345 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Fair Nut lives in n story house. a_i people live on the i-th floor of the house. Every person uses elevator twice a day: to get from the floor where he/she lives to the ground (first) floor and to get from the first floor to the floor wh... | instruction | 0 | 35,173 | 8 | 70,346 |
Tags: brute force, implementation
Correct Solution:
```
#########################################################################################################\
#########################################################################################################
###################################The_Apurv_Rathor... | output | 1 | 35,173 | 8 | 70,347 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Fair Nut lives in n story house. a_i people live on the i-th floor of the house. Every person uses elevator twice a day: to get from the floor where he/she lives to the ground (first) floor and to get from the first floor to the floor wh... | instruction | 0 | 35,174 | 8 | 70,348 |
Tags: brute force, implementation
Correct Solution:
```
Input=lambda:map(int,input().split())
n = int(input())
ans = 0
Min = float('inf')
List = list(Input())
x = List.index(max(List)) + 1
for i in range(1,n+1):
if List[i-1] != 0:
ans+= (i-1) * 4 * List[i-1]
print(ans)
``` | output | 1 | 35,174 | 8 | 70,349 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Fair Nut lives in n story house. a_i people live on the i-th floor of the house. Every person uses elevator twice a day: to get from the floor where he/she lives to the ground (first) floor and to get from the first floor to the floor wh... | instruction | 0 | 35,175 | 8 | 70,350 |
Tags: brute force, implementation
Correct Solution:
```
n=int(input())
a=[int(x) for x in input().split()]
m=1000000000
for x in range(0, n):
temp=0
for i in range(n):
temp+=2*a[i]*(abs(i-x)+i+x)
# print (x, temp)
if temp<m:
m=temp
print (m)
``` | output | 1 | 35,175 | 8 | 70,351 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Fair Nut lives in n story house. a_i people live on the i-th floor of the house. Every person uses elevator twice a day: to get from the floor where he/she lives to the ground (first) floor and to get from the first floor to the floor wh... | instruction | 0 | 35,176 | 8 | 70,352 |
Tags: brute force, implementation
Correct Solution:
```
#for i in range(int(input())):
n=int(input())
arr=[int(x) for x in input().split()]
final=-1
for i in range(n):
temp=2
cost=0
for j in range(i+1):
# print(arr[j],j+1)
cost+=arr[j]*(j)+abs(j-i)*arr[j]+abs(i)*arr[j]
cost+=arr[j]*(j)+abs(j-i)*arr[j]+abs(i)*ar... | output | 1 | 35,176 | 8 | 70,353 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Fair Nut lives in n story house. a_i people live on the i-th floor of the house. Every person uses elevator twice a day: to get from the floor where he/she lives to the ground (first) floor and to get from the first floor to the floor wh... | instruction | 0 | 35,177 | 8 | 70,354 |
Tags: brute force, implementation
Correct Solution:
```
n = int(input())
arr = [int(x) for x in input().split()]
def get_for(x):
global n, arr
ret = 0
for i in range(n):
ret += (abs(x-i) + i + x) * arr[i] * 2
return ret
mn = get_for(0)
for i in range(1, n):
mn = min(mn, get_for(i))
pri... | output | 1 | 35,177 | 8 | 70,355 |
Provide tags and a correct Python 3 solution for this coding contest problem.
The Fair Nut lives in n story house. a_i people live on the i-th floor of the house. Every person uses elevator twice a day: to get from the floor where he/she lives to the ground (first) floor and to get from the first floor to the floor wh... | instruction | 0 | 35,178 | 8 | 70,356 |
Tags: brute force, implementation
Correct Solution:
```
n = int(input())
ar = list(map(int, input().split()))
res = 0
for i in range(n):
res += ar[i] * 4 * i
print(res)
``` | output | 1 | 35,178 | 8 | 70,357 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Fair Nut lives in n story house. a_i people live on the i-th floor of the house. Every person uses elevator twice a day: to get from the floor where he/she lives to the ground (first) floor ... | instruction | 0 | 35,179 | 8 | 70,358 |
Yes | output | 1 | 35,179 | 8 | 70,359 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Fair Nut lives in n story house. a_i people live on the i-th floor of the house. Every person uses elevator twice a day: to get from the floor where he/she lives to the ground (first) floor ... | instruction | 0 | 35,180 | 8 | 70,360 |
Yes | output | 1 | 35,180 | 8 | 70,361 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Fair Nut lives in n story house. a_i people live on the i-th floor of the house. Every person uses elevator twice a day: to get from the floor where he/she lives to the ground (first) floor ... | instruction | 0 | 35,181 | 8 | 70,362 |
Yes | output | 1 | 35,181 | 8 | 70,363 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Fair Nut lives in n story house. a_i people live on the i-th floor of the house. Every person uses elevator twice a day: to get from the floor where he/she lives to the ground (first) floor ... | instruction | 0 | 35,182 | 8 | 70,364 |
Yes | output | 1 | 35,182 | 8 | 70,365 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Fair Nut lives in n story house. a_i people live on the i-th floor of the house. Every person uses elevator twice a day: to get from the floor where he/she lives to the ground (first) floor ... | instruction | 0 | 35,183 | 8 | 70,366 |
No | output | 1 | 35,183 | 8 | 70,367 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Fair Nut lives in n story house. a_i people live on the i-th floor of the house. Every person uses elevator twice a day: to get from the floor where he/she lives to the ground (first) floor ... | instruction | 0 | 35,184 | 8 | 70,368 |
No | output | 1 | 35,184 | 8 | 70,369 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Fair Nut lives in n story house. a_i people live on the i-th floor of the house. Every person uses elevator twice a day: to get from the floor where he/she lives to the ground (first) floor ... | instruction | 0 | 35,185 | 8 | 70,370 |
No | output | 1 | 35,185 | 8 | 70,371 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The Fair Nut lives in n story house. a_i people live on the i-th floor of the house. Every person uses elevator twice a day: to get from the floor where he/she lives to the ground (first) floor ... | instruction | 0 | 35,186 | 8 | 70,372 |
No | output | 1 | 35,186 | 8 | 70,373 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A sky scraper with 1000 floors has been built in the city of N. It has modern superfast elevators to help to travel from one floor to another. Each elevator has two doors, the front one and the ... | instruction | 0 | 35,248 | 8 | 70,496 |
No | output | 1 | 35,248 | 8 | 70,497 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A sky scraper with 1000 floors has been built in the city of N. It has modern superfast elevators to help to travel from one floor to another. Each elevator has two doors, the front one and the ... | instruction | 0 | 35,249 | 8 | 70,498 |
No | output | 1 | 35,249 | 8 | 70,499 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A sky scraper with 1000 floors has been built in the city of N. It has modern superfast elevators to help to travel from one floor to another. Each elevator has two doors, the front one and the ... | instruction | 0 | 35,250 | 8 | 70,500 |
No | output | 1 | 35,250 | 8 | 70,501 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A sky scraper with 1000 floors has been built in the city of N. It has modern superfast elevators to help to travel from one floor to another. Each elevator has two doors, the front one and the ... | instruction | 0 | 35,251 | 8 | 70,502 |
No | output | 1 | 35,251 | 8 | 70,503 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a robot in a warehouse and n packages he wants to collect. The warehouse can be represented as a coordinate grid. Initially, the robot stays at the point (0, 0). The i-th package is at ... | instruction | 0 | 35,308 | 8 | 70,616 |
Yes | output | 1 | 35,308 | 8 | 70,617 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a robot in a warehouse and n packages he wants to collect. The warehouse can be represented as a coordinate grid. Initially, the robot stays at the point (0, 0). The i-th package is at ... | instruction | 0 | 35,309 | 8 | 70,618 |
Yes | output | 1 | 35,309 | 8 | 70,619 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a robot in a warehouse and n packages he wants to collect. The warehouse can be represented as a coordinate grid. Initially, the robot stays at the point (0, 0). The i-th package is at ... | instruction | 0 | 35,310 | 8 | 70,620 |
Yes | output | 1 | 35,310 | 8 | 70,621 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a robot in a warehouse and n packages he wants to collect. The warehouse can be represented as a coordinate grid. Initially, the robot stays at the point (0, 0). The i-th package is at ... | instruction | 0 | 35,311 | 8 | 70,622 |
Yes | output | 1 | 35,311 | 8 | 70,623 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a robot in a warehouse and n packages he wants to collect. The warehouse can be represented as a coordinate grid. Initially, the robot stays at the point (0, 0). The i-th package is at ... | instruction | 0 | 35,312 | 8 | 70,624 |
No | output | 1 | 35,312 | 8 | 70,625 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a robot in a warehouse and n packages he wants to collect. The warehouse can be represented as a coordinate grid. Initially, the robot stays at the point (0, 0). The i-th package is at ... | instruction | 0 | 35,313 | 8 | 70,626 |
No | output | 1 | 35,313 | 8 | 70,627 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a robot in a warehouse and n packages he wants to collect. The warehouse can be represented as a coordinate grid. Initially, the robot stays at the point (0, 0). The i-th package is at ... | instruction | 0 | 35,314 | 8 | 70,628 |
No | output | 1 | 35,314 | 8 | 70,629 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a robot in a warehouse and n packages he wants to collect. The warehouse can be represented as a coordinate grid. Initially, the robot stays at the point (0, 0). The i-th package is at ... | instruction | 0 | 35,315 | 8 | 70,630 |
No | output | 1 | 35,315 | 8 | 70,631 |
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,369 | 8 | 70,738 |
Tags: implementation, math
Correct Solution:
```
from math import ceil
n = int(input())
mas = []
matrix = []
for i in range(n):
d, l, h = map(int, input().split())
mas.append((d, l, h))
m = int(input())
for i in range(m):
matrix.append(tuple(map(int, input().split())))
ans = 0
for i in range(len(mas)):
... | output | 1 | 35,369 | 8 | 70,739 |
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,370 | 8 | 70,740 |
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,370 | 8 | 70,741 |
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,371 | 8 | 70,742 |
Tags: implementation, math
Correct Solution:
```
from math import ceil
p = [tuple(map(int, input().split())) for i in range(int(input()))]
q = [tuple(map(int, input().split())) for i in range(int(input()))]
print(sum(min(d * ceil(2 * (a + b) / (w * int(h / c))) for h, w, d in q if h >= c) for a, b, c in p))
``` | output | 1 | 35,371 | 8 | 70,743 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.