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.
Polar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horace from the zoo of Kiev got hold of lots of wooden cubes somewhere. They started making cube towers by placing the cubes one on top of the other. They defined m... | instruction | 0 | 54,347 | 8 | 108,694 |
Tags: string suffix structures, strings
Correct Solution:
```
def diff(s) : return [s[i] - s[i - 1] for i in range(1, len(s))]
n, m = map(int, input().split())
if m > n : print(0) ; exit(0)
if m == 1 : print(n) ; exit(0)
t = diff(list(map(int, input().split())))
p = diff(list(map(int, input().split())))
w = p + [10 ** ... | output | 1 | 54,347 | 8 | 108,695 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horace from the zoo of Kiev got hold of lots of wooden cubes somewhere. They started making cube towers by placing th... | instruction | 0 | 54,348 | 8 | 108,696 |
Yes | output | 1 | 54,348 | 8 | 108,697 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horace from the zoo of Kiev got hold of lots of wooden cubes somewhere. They started making cube towers by placing th... | instruction | 0 | 54,349 | 8 | 108,698 |
Yes | output | 1 | 54,349 | 8 | 108,699 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horace from the zoo of Kiev got hold of lots of wooden cubes somewhere. They started making cube towers by placing th... | instruction | 0 | 54,350 | 8 | 108,700 |
Yes | output | 1 | 54,350 | 8 | 108,701 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horace from the zoo of Kiev got hold of lots of wooden cubes somewhere. They started making cube towers by placing th... | instruction | 0 | 54,351 | 8 | 108,702 |
Yes | output | 1 | 54,351 | 8 | 108,703 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horace from the zoo of Kiev got hold of lots of wooden cubes somewhere. They started making cube towers by placing th... | instruction | 0 | 54,352 | 8 | 108,704 |
No | output | 1 | 54,352 | 8 | 108,705 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horace from the zoo of Kiev got hold of lots of wooden cubes somewhere. They started making cube towers by placing th... | instruction | 0 | 54,353 | 8 | 108,706 |
No | output | 1 | 54,353 | 8 | 108,707 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horace from the zoo of Kiev got hold of lots of wooden cubes somewhere. They started making cube towers by placing th... | instruction | 0 | 54,354 | 8 | 108,708 |
No | output | 1 | 54,354 | 8 | 108,709 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Polar bears Menshykov and Uslada from the zoo of St. Petersburg and elephant Horace from the zoo of Kiev got hold of lots of wooden cubes somewhere. They started making cube towers by placing th... | instruction | 0 | 54,355 | 8 | 108,710 |
No | output | 1 | 54,355 | 8 | 108,711 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Archeologists have found a secret pass in the dungeon of one of the pyramids of Cycleland. To enter the treasury they have to open an unusual lock on the door. The lock consists of n words, each... | instruction | 0 | 54,458 | 8 | 108,916 |
No | output | 1 | 54,458 | 8 | 108,917 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Archeologists have found a secret pass in the dungeon of one of the pyramids of Cycleland. To enter the treasury they have to open an unusual lock on the door. The lock consists of n words, each... | instruction | 0 | 54,459 | 8 | 108,918 |
No | output | 1 | 54,459 | 8 | 108,919 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Archeologists have found a secret pass in the dungeon of one of the pyramids of Cycleland. To enter the treasury they have to open an unusual lock on the door. The lock consists of n words, each... | instruction | 0 | 54,460 | 8 | 108,920 |
No | output | 1 | 54,460 | 8 | 108,921 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Archeologists have found a secret pass in the dungeon of one of the pyramids of Cycleland. To enter the treasury they have to open an unusual lock on the door. The lock consists of n words, each... | instruction | 0 | 54,461 | 8 | 108,922 |
No | output | 1 | 54,461 | 8 | 108,923 |
Provide a correct Python 3 solution for this coding contest problem.
The window of Takahashi's room has a width of A. There are two curtains hung over the window, each of which has a horizontal length of B. (Vertically, the curtains are long enough to cover the whole window.)
We will close the window so as to minimiz... | instruction | 0 | 54,577 | 8 | 109,154 |
"Correct Solution:
```
A,B = (int(x) for x in input().split())
print(max(0,A-2*B))
``` | output | 1 | 54,577 | 8 | 109,155 |
Provide a correct Python 3 solution for this coding contest problem.
The window of Takahashi's room has a width of A. There are two curtains hung over the window, each of which has a horizontal length of B. (Vertically, the curtains are long enough to cover the whole window.)
We will close the window so as to minimiz... | instruction | 0 | 54,578 | 8 | 109,156 |
"Correct Solution:
```
a,b=[int(_) for _ in input().split()]
print([a-2*b,0][0>a-2*b])
``` | output | 1 | 54,578 | 8 | 109,157 |
Provide a correct Python 3 solution for this coding contest problem.
The window of Takahashi's room has a width of A. There are two curtains hung over the window, each of which has a horizontal length of B. (Vertically, the curtains are long enough to cover the whole window.)
We will close the window so as to minimiz... | instruction | 0 | 54,579 | 8 | 109,158 |
"Correct Solution:
```
A,B = map(int,input().split())
x = A-B-B
print(max(0,x))
``` | output | 1 | 54,579 | 8 | 109,159 |
Provide a correct Python 3 solution for this coding contest problem.
The window of Takahashi's room has a width of A. There are two curtains hung over the window, each of which has a horizontal length of B. (Vertically, the curtains are long enough to cover the whole window.)
We will close the window so as to minimiz... | instruction | 0 | 54,580 | 8 | 109,160 |
"Correct Solution:
```
print(eval('max(0,'+input().replace(' ','-2*')+')'))
``` | output | 1 | 54,580 | 8 | 109,161 |
Provide a correct Python 3 solution for this coding contest problem.
The window of Takahashi's room has a width of A. There are two curtains hung over the window, each of which has a horizontal length of B. (Vertically, the curtains are long enough to cover the whole window.)
We will close the window so as to minimiz... | instruction | 0 | 54,581 | 8 | 109,162 |
"Correct Solution:
```
a,b=map(int,input().split())
print(max(0,(a-(b*2))))
``` | output | 1 | 54,581 | 8 | 109,163 |
Provide a correct Python 3 solution for this coding contest problem.
The window of Takahashi's room has a width of A. There are two curtains hung over the window, each of which has a horizontal length of B. (Vertically, the curtains are long enough to cover the whole window.)
We will close the window so as to minimiz... | instruction | 0 | 54,582 | 8 | 109,164 |
"Correct Solution:
```
#ABC 143A
A,B = map(int,input().split())
print(max(0,A-2*B))
``` | output | 1 | 54,582 | 8 | 109,165 |
Provide a correct Python 3 solution for this coding contest problem.
The window of Takahashi's room has a width of A. There are two curtains hung over the window, each of which has a horizontal length of B. (Vertically, the curtains are long enough to cover the whole window.)
We will close the window so as to minimiz... | instruction | 0 | 54,583 | 8 | 109,166 |
"Correct Solution:
```
a,s=map(int,input().split())
print(max(a-2*s,0))
``` | output | 1 | 54,583 | 8 | 109,167 |
Provide a correct Python 3 solution for this coding contest problem.
The window of Takahashi's room has a width of A. There are two curtains hung over the window, each of which has a horizontal length of B. (Vertically, the curtains are long enough to cover the whole window.)
We will close the window so as to minimiz... | instruction | 0 | 54,584 | 8 | 109,168 |
"Correct Solution:
```
A, B = map(int, input().split(' '))
print(max(0, A - 2 * B))
``` | output | 1 | 54,584 | 8 | 109,169 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The window of Takahashi's room has a width of A. There are two curtains hung over the window, each of which has a horizontal length of B. (Vertically, the curtains are long enough to cover the w... | instruction | 0 | 54,585 | 8 | 109,170 |
Yes | output | 1 | 54,585 | 8 | 109,171 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The window of Takahashi's room has a width of A. There are two curtains hung over the window, each of which has a horizontal length of B. (Vertically, the curtains are long enough to cover the w... | instruction | 0 | 54,586 | 8 | 109,172 |
Yes | output | 1 | 54,586 | 8 | 109,173 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The window of Takahashi's room has a width of A. There are two curtains hung over the window, each of which has a horizontal length of B. (Vertically, the curtains are long enough to cover the w... | instruction | 0 | 54,587 | 8 | 109,174 |
Yes | output | 1 | 54,587 | 8 | 109,175 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The window of Takahashi's room has a width of A. There are two curtains hung over the window, each of which has a horizontal length of B. (Vertically, the curtains are long enough to cover the w... | instruction | 0 | 54,588 | 8 | 109,176 |
Yes | output | 1 | 54,588 | 8 | 109,177 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The window of Takahashi's room has a width of A. There are two curtains hung over the window, each of which has a horizontal length of B. (Vertically, the curtains are long enough to cover the w... | instruction | 0 | 54,589 | 8 | 109,178 |
No | output | 1 | 54,589 | 8 | 109,179 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The window of Takahashi's room has a width of A. There are two curtains hung over the window, each of which has a horizontal length of B. (Vertically, the curtains are long enough to cover the w... | instruction | 0 | 54,590 | 8 | 109,180 |
No | output | 1 | 54,590 | 8 | 109,181 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The window of Takahashi's room has a width of A. There are two curtains hung over the window, each of which has a horizontal length of B. (Vertically, the curtains are long enough to cover the w... | instruction | 0 | 54,591 | 8 | 109,182 |
No | output | 1 | 54,591 | 8 | 109,183 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The window of Takahashi's room has a width of A. There are two curtains hung over the window, each of which has a horizontal length of B. (Vertically, the curtains are long enough to cover the w... | instruction | 0 | 54,592 | 8 | 109,184 |
No | output | 1 | 54,592 | 8 | 109,185 |
Provide a correct Python 3 solution for this coding contest problem.
There are N stones, numbered 1, 2, \ldots, N. For each i (1 \leq i \leq N), the height of Stone i is h_i.
There is a frog who is initially on Stone 1. He will repeat the following action some number of times to reach Stone N:
* If the frog is curre... | instruction | 0 | 54,602 | 8 | 109,204 |
"Correct Solution:
```
N=int(input())
l1=list(map(int,input().split()))
l=[0]*N
l[1]=abs(l1[1]-l1[0])
for i in range(2,N):
l[i]=min(l[i-1]+abs(l1[i]-l1[i-1]),l[i-2]+abs(l1[i]-l1[i-2]))
print(l[N-1])
``` | output | 1 | 54,602 | 8 | 109,205 |
Provide a correct Python 3 solution for this coding contest problem.
There are N stones, numbered 1, 2, \ldots, N. For each i (1 \leq i \leq N), the height of Stone i is h_i.
There is a frog who is initially on Stone 1. He will repeat the following action some number of times to reach Stone N:
* If the frog is curre... | instruction | 0 | 54,603 | 8 | 109,206 |
"Correct Solution:
```
n=int(input())
h=list(map(int,input().split()))
d=[0]*n
d[1]=abs(h[1]-h[0])
for i in range(2,n):
d[i]=min(d[i-1]+abs(h[i]-h[i-1]),d[i-2]+abs(h[i]-h[i-2]))
print(d[n-1])
``` | output | 1 | 54,603 | 8 | 109,207 |
Provide a correct Python 3 solution for this coding contest problem.
There are N stones, numbered 1, 2, \ldots, N. For each i (1 \leq i \leq N), the height of Stone i is h_i.
There is a frog who is initially on Stone 1. He will repeat the following action some number of times to reach Stone N:
* If the frog is curre... | instruction | 0 | 54,604 | 8 | 109,208 |
"Correct Solution:
```
n = int(input())
li = list(map(int,input().split()))
dp = [0,abs(li[1]-li[0])]
for i in range(2,n):
dp += [min(dp[-2]+abs(li[i]-li[i-2]),dp[-1]+abs(li[i]-li[i-1]))]
print(dp[-1])
``` | output | 1 | 54,604 | 8 | 109,209 |
Provide a correct Python 3 solution for this coding contest problem.
There are N stones, numbered 1, 2, \ldots, N. For each i (1 \leq i \leq N), the height of Stone i is h_i.
There is a frog who is initially on Stone 1. He will repeat the following action some number of times to reach Stone N:
* If the frog is curre... | instruction | 0 | 54,605 | 8 | 109,210 |
"Correct Solution:
```
N=int(input())
H=list(map(int,input().split()))
dp=[0]*N
dp[0]=0
dp[1]=abs(H[1]-H[0])
for i in range(2,N):
dp[i]=min(dp[i-1]+abs(H[i]-H[i-1]), dp[i-2]+abs(H[i]-H[i-2]))
print(dp[N-1])
``` | output | 1 | 54,605 | 8 | 109,211 |
Provide a correct Python 3 solution for this coding contest problem.
There are N stones, numbered 1, 2, \ldots, N. For each i (1 \leq i \leq N), the height of Stone i is h_i.
There is a frog who is initially on Stone 1. He will repeat the following action some number of times to reach Stone N:
* If the frog is curre... | instruction | 0 | 54,606 | 8 | 109,212 |
"Correct Solution:
```
n=int(input())
h=[int(k) for k in input().split()]
dp=[0,abs(h[0]-h[1])]
for i in range(2,n):
dp.append(min(abs(h[i]-h[i-1])+dp[i-1],abs(h[i]-h[i-2])+dp[i-2]))
print(dp[n-1])
``` | output | 1 | 54,606 | 8 | 109,213 |
Provide a correct Python 3 solution for this coding contest problem.
There are N stones, numbered 1, 2, \ldots, N. For each i (1 \leq i \leq N), the height of Stone i is h_i.
There is a frog who is initially on Stone 1. He will repeat the following action some number of times to reach Stone N:
* If the frog is curre... | instruction | 0 | 54,607 | 8 | 109,214 |
"Correct Solution:
```
n = int(input())
h = [int(e) for e in input().split()]
dp = [0, abs(h[1]-h[0])]
for i in range(2,n):
dp.append(min(dp[-1]+abs(h[i]-h[i-1]),dp[-2]+abs(h[i]-h[i-2])))
print(dp[-1])
``` | output | 1 | 54,607 | 8 | 109,215 |
Provide a correct Python 3 solution for this coding contest problem.
There are N stones, numbered 1, 2, \ldots, N. For each i (1 \leq i \leq N), the height of Stone i is h_i.
There is a frog who is initially on Stone 1. He will repeat the following action some number of times to reach Stone N:
* If the frog is curre... | instruction | 0 | 54,608 | 8 | 109,216 |
"Correct Solution:
```
N=int(input())
h=list(map(int,input().split()))
c=[0]*N
c[1]=abs(h[1]-h[0])
for i in range(2,N):
c[i]=min(c[i-2]+abs(h[i]-h[i-2]),c[i-1]+abs(h[i]-h[i-1]))
print(c[-1])
``` | output | 1 | 54,608 | 8 | 109,217 |
Provide a correct Python 3 solution for this coding contest problem.
There are N stones, numbered 1, 2, \ldots, N. For each i (1 \leq i \leq N), the height of Stone i is h_i.
There is a frog who is initially on Stone 1. He will repeat the following action some number of times to reach Stone N:
* If the frog is curre... | instruction | 0 | 54,609 | 8 | 109,218 |
"Correct Solution:
```
n=int(input())
h=list(map(int,input().split()))
dp=[0]*(n)
dp[0]=0
dp[1]=abs(h[1]-h[0])
for i in range(2,n):
dp[i]=min(dp[i-2]+abs(h[i]-h[i-2]),dp[i-1]+abs(h[i]-h[i-1]))
print(dp[-1])
``` | output | 1 | 54,609 | 8 | 109,219 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N stones, numbered 1, 2, \ldots, N. For each i (1 \leq i \leq N), the height of Stone i is h_i.
There is a frog who is initially on Stone 1. He will repeat the following action some n... | instruction | 0 | 54,610 | 8 | 109,220 |
Yes | output | 1 | 54,610 | 8 | 109,221 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N stones, numbered 1, 2, \ldots, N. For each i (1 \leq i \leq N), the height of Stone i is h_i.
There is a frog who is initially on Stone 1. He will repeat the following action some n... | instruction | 0 | 54,611 | 8 | 109,222 |
Yes | output | 1 | 54,611 | 8 | 109,223 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N stones, numbered 1, 2, \ldots, N. For each i (1 \leq i \leq N), the height of Stone i is h_i.
There is a frog who is initially on Stone 1. He will repeat the following action some n... | instruction | 0 | 54,612 | 8 | 109,224 |
Yes | output | 1 | 54,612 | 8 | 109,225 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N stones, numbered 1, 2, \ldots, N. For each i (1 \leq i \leq N), the height of Stone i is h_i.
There is a frog who is initially on Stone 1. He will repeat the following action some n... | instruction | 0 | 54,613 | 8 | 109,226 |
Yes | output | 1 | 54,613 | 8 | 109,227 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N stones, numbered 1, 2, \ldots, N. For each i (1 \leq i \leq N), the height of Stone i is h_i.
There is a frog who is initially on Stone 1. He will repeat the following action some n... | instruction | 0 | 54,614 | 8 | 109,228 |
No | output | 1 | 54,614 | 8 | 109,229 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N stones, numbered 1, 2, \ldots, N. For each i (1 \leq i \leq N), the height of Stone i is h_i.
There is a frog who is initially on Stone 1. He will repeat the following action some n... | instruction | 0 | 54,615 | 8 | 109,230 |
No | output | 1 | 54,615 | 8 | 109,231 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N stones, numbered 1, 2, \ldots, N. For each i (1 \leq i \leq N), the height of Stone i is h_i.
There is a frog who is initially on Stone 1. He will repeat the following action some n... | instruction | 0 | 54,616 | 8 | 109,232 |
No | output | 1 | 54,616 | 8 | 109,233 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There are N stones, numbered 1, 2, \ldots, N. For each i (1 \leq i \leq N), the height of Stone i is h_i.
There is a frog who is initially on Stone 1. He will repeat the following action some n... | instruction | 0 | 54,617 | 8 | 109,234 |
No | output | 1 | 54,617 | 8 | 109,235 |
Provide a correct Python 3 solution for this coding contest problem.
Aizu Gakuen High School holds a school festival every year. The most popular of these is the haunted house. The most popular reason is that 9 classes do haunted houses instead of 1 or 2 classes. Each one has its own unique haunted house. Therefore, m... | instruction | 0 | 54,702 | 8 | 109,404 |
"Correct Solution:
```
d = [input().split() for _ in range(9)]
ans = [ds[0]+" "+str(int(ds[1])+int(ds[2]))+" "+str(200*int(ds[1])+300*(int(ds[2]))) for ds in d]
print("\n".join(ans))
``` | output | 1 | 54,702 | 8 | 109,405 |
Provide a correct Python 3 solution for this coding contest problem.
Aizu Gakuen High School holds a school festival every year. The most popular of these is the haunted house. The most popular reason is that 9 classes do haunted houses instead of 1 or 2 classes. Each one has its own unique haunted house. Therefore, m... | instruction | 0 | 54,703 | 8 | 109,406 |
"Correct Solution:
```
for i in range (9):
N, a, b = map(str,input().split())
a = int(a)
b = int(b)
print(N, a+b, 200*a+300*b)
``` | output | 1 | 54,703 | 8 | 109,407 |
Provide a correct Python 3 solution for this coding contest problem.
Aizu Gakuen High School holds a school festival every year. The most popular of these is the haunted house. The most popular reason is that 9 classes do haunted houses instead of 1 or 2 classes. Each one has its own unique haunted house. Therefore, m... | instruction | 0 | 54,704 | 8 | 109,408 |
"Correct Solution:
```
for i in range(1,9+1):
name,a,b=input().split()
a=int(a)
b=int(b)
print(name,a+b,a*200+b*300)
``` | output | 1 | 54,704 | 8 | 109,409 |
Provide a correct Python 3 solution for this coding contest problem.
Aizu Gakuen High School holds a school festival every year. The most popular of these is the haunted house. The most popular reason is that 9 classes do haunted houses instead of 1 or 2 classes. Each one has its own unique haunted house. Therefore, m... | instruction | 0 | 54,705 | 8 | 109,410 |
"Correct Solution:
```
for i in range(9):
name, b, c = list(input().split())
print(name, int(b)+int(c), int(b)*200+int(c)*300)
``` | output | 1 | 54,705 | 8 | 109,411 |
Provide a correct Python 3 solution for this coding contest problem.
Aizu Gakuen High School holds a school festival every year. The most popular of these is the haunted house. The most popular reason is that 9 classes do haunted houses instead of 1 or 2 classes. Each one has its own unique haunted house. Therefore, m... | instruction | 0 | 54,706 | 8 | 109,412 |
"Correct Solution:
```
for i in range (9):
name,a,b=map(str,input().split())
print(name,(int(a)+int(b)),(200*int(a)+300*int(b)))
``` | output | 1 | 54,706 | 8 | 109,413 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.