message stringlengths 2 45.8k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 254 108k | cluster float64 3 3 | __index_level_0__ int64 508 217k |
|---|---|---|---|---|---|
Provide a correct Python 3 solution for this coding contest problem.
There are many caves deep in mountains found in the countryside. In legend, each cave has a treasure hidden within the farthest room from the cave's entrance. The Shogun has ordered his Samurais to explore these caves with Karakuri dolls (robots) and... | instruction | 0 | 51,244 | 3 | 102,488 |
"Correct Solution:
```
# AOJ 1119: Exploring Caves
# Python3 2018.7.14 bal4u
for _ in range(int(input())):
ans = x = y = tx = ty = 0
while True:
dx, dy = map(int, input().split())
if (dx | dy) == 0: break
x += dx; y += dy
d = x*x+y*y
if d > ans: ans, tx, ty = d, x, y
elif d == ans and tx < x: tx, ty = x,... | output | 1 | 51,244 | 3 | 102,489 |
Provide a correct Python 3 solution for this coding contest problem.
There are many caves deep in mountains found in the countryside. In legend, each cave has a treasure hidden within the farthest room from the cave's entrance. The Shogun has ordered his Samurais to explore these caves with Karakuri dolls (robots) and... | instruction | 0 | 51,245 | 3 | 102,490 |
"Correct Solution:
```
if __name__ == '__main__':
TC = int(input())
for _ in range(TC):
maxDist = 0
treasureX = 0
treasureY = 0
posX = 0
posY = 0
while True:
x, y = [ int(x) for x in list(filter(lambda x: x != '', \
input().strip().spli... | output | 1 | 51,245 | 3 | 102,491 |
Provide a correct Python 3 solution for this coding contest problem.
In the year 2020, a race of atomically energized cars will be held. Unlike today’s car races, fueling is not a concern of racing teams. Cars can run throughout the course without any refueling. Instead, the critical factor is tire (tyre). Teams shoul... | instruction | 0 | 51,246 | 3 | 102,492 |
"Correct Solution:
```
def solve():
from bisect import bisect
from itertools import accumulate
from sys import stdin
f_i = stdin
while True:
n = int(f_i.readline())
if n == 0:
break
a = list(map(int, f_i.readline().split()))
b = float(f_i.rea... | output | 1 | 51,246 | 3 | 102,493 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A: Isono, let's do that! --Sendame -
story
Nakajima "Isono ~, let's do that!"
Isono "What is that, Nakajima"
Nakajima "Look, that's that. It's hard to explain because I have to express it in... | instruction | 0 | 51,274 | 3 | 102,548 |
No | output | 1 | 51,274 | 3 | 102,549 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
A: Isono, let's do that! --Sendame -
story
Nakajima "Isono ~, let's do that!"
Isono "What is that, Nakajima"
Nakajima "Look, that's that. It's hard to explain because I have to express it in... | instruction | 0 | 51,275 | 3 | 102,550 |
No | output | 1 | 51,275 | 3 | 102,551 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are working for the Gryzzl company, headquartered in Pawnee, Indiana.
The new national park has been opened near Pawnee recently and you are to implement a geolocation system, so people won't get lost. The concept you developed is innov... | instruction | 0 | 51,426 | 3 | 102,852 |
Tags: geometry
Correct Solution:
```
import sys
import math
n = int(input())
x = [0]*n
y = [0]*n
for i in range(n):
x[i], y[i] = map(int, input().split())
sx = sum(x)
sy = sum(y)
for i in range(n):
x[i] = n * x[i] - sx
y[i] = n * y[i] - sy
m = int(input())
d = [0]*n
e = [0]*n
HD = 0
def check(a... | output | 1 | 51,426 | 3 | 102,853 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are working for the Gryzzl company, headquartered in Pawnee, Indiana.
The new national park has been opened near Pawnee recently and you are to implement a geolocation system, so people won... | instruction | 0 | 51,427 | 3 | 102,854 |
No | output | 1 | 51,427 | 3 | 102,855 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are working for the Gryzzl company, headquartered in Pawnee, Indiana.
The new national park has been opened near Pawnee recently and you are to implement a geolocation system, so people won... | instruction | 0 | 51,428 | 3 | 102,856 |
No | output | 1 | 51,428 | 3 | 102,857 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are working for the Gryzzl company, headquartered in Pawnee, Indiana.
The new national park has been opened near Pawnee recently and you are to implement a geolocation system, so people won... | instruction | 0 | 51,429 | 3 | 102,858 |
No | output | 1 | 51,429 | 3 | 102,859 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are working for the Gryzzl company, headquartered in Pawnee, Indiana.
The new national park has been opened near Pawnee recently and you are to implement a geolocation system, so people won... | instruction | 0 | 51,430 | 3 | 102,860 |
No | output | 1 | 51,430 | 3 | 102,861 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sensation, sensation in the two-dimensional kingdom! The police have caught a highly dangerous outlaw, member of the notorious "Pihters" gang. The law department states that the outlaw was driving from the gang's headquarters in his car when... | instruction | 0 | 51,585 | 3 | 103,170 |
Tags: constructive algorithms, math
Correct Solution:
```
import math,sys
#from itertools import permutations, combinations;import heapq,random;
from collections import defaultdict,deque
import bisect as bi
def yes():print('YES')
def no():print('NO')
#sys.stdin=open('input.txt','r');sys.stdout=open('output.txt','w');
d... | output | 1 | 51,585 | 3 | 103,171 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sensation, sensation in the two-dimensional kingdom! The police have caught a highly dangerous outlaw, member of the notorious "Pihters" gang. The law department states that the outlaw was driving from the gang's headquarters in his car when... | instruction | 0 | 51,586 | 3 | 103,172 |
Tags: constructive algorithms, math
Correct Solution:
```
n = int(input())
r = 1; c = 1
for i in range(n):
s = input()
if (len(s) == 4):
r += 1; c += 1
elif(s == "UL" or s == "DR"):
r += 1
else:
c += 1
print(r * c)
``` | output | 1 | 51,586 | 3 | 103,173 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sensation, sensation in the two-dimensional kingdom! The police have caught a highly dangerous outlaw, member of the notorious "Pihters" gang. The law department states that the outlaw was driving from the gang's headquarters in his car when... | instruction | 0 | 51,587 | 3 | 103,174 |
Tags: constructive algorithms, math
Correct Solution:
```
def main():
a = b = 1
for _ in range(int(input())):
s = input()
if s in ("UL", "DR"):
a += 1
elif s in ("UR", "DL"):
b += 1
elif s == "ULDR":
a += 1
b += 1
print(a * b)
... | output | 1 | 51,587 | 3 | 103,175 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Sensation, sensation in the two-dimensional kingdom! The police have caught a highly dangerous outlaw, member of the notorious "Pihters" gang. The law department states that the outlaw was driving from the gang's headquarters in his car when... | instruction | 0 | 51,588 | 3 | 103,176 |
Tags: constructive algorithms, math
Correct Solution:
```
#!/usr/local/bin/python3
n = int(input())
w = 1
h = 1
for _ in range(n):
s = input()
if s == 'ULDR':
w += 1
h += 1
continue
if s == 'UR' or s == 'DL':
w += 1
continue
h += 1
print(w * h)
``` | output | 1 | 51,588 | 3 | 103,177 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Sensation, sensation in the two-dimensional kingdom! The police have caught a highly dangerous outlaw, member of the notorious "Pihters" gang. The law department states that the outlaw was drivi... | instruction | 0 | 51,589 | 3 | 103,178 |
No | output | 1 | 51,589 | 3 | 103,179 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Once upon a time a little frog whose name was Vasya decided to travel around his home swamp. Overall there are n mounds on the swamp, located on one line. The distance between the neighboring mo... | instruction | 0 | 51,716 | 3 | 103,432 |
Yes | output | 1 | 51,716 | 3 | 103,433 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Once upon a time a little frog whose name was Vasya decided to travel around his home swamp. Overall there are n mounds on the swamp, located on one line. The distance between the neighboring mo... | instruction | 0 | 51,717 | 3 | 103,434 |
Yes | output | 1 | 51,717 | 3 | 103,435 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Once upon a time a little frog whose name was Vasya decided to travel around his home swamp. Overall there are n mounds on the swamp, located on one line. The distance between the neighboring mo... | instruction | 0 | 51,718 | 3 | 103,436 |
Yes | output | 1 | 51,718 | 3 | 103,437 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Once upon a time a little frog whose name was Vasya decided to travel around his home swamp. Overall there are n mounds on the swamp, located on one line. The distance between the neighboring mo... | instruction | 0 | 51,719 | 3 | 103,438 |
Yes | output | 1 | 51,719 | 3 | 103,439 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Once upon a time a little frog whose name was Vasya decided to travel around his home swamp. Overall there are n mounds on the swamp, located on one line. The distance between the neighboring mo... | instruction | 0 | 51,720 | 3 | 103,440 |
No | output | 1 | 51,720 | 3 | 103,441 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Once upon a time a little frog whose name was Vasya decided to travel around his home swamp. Overall there are n mounds on the swamp, located on one line. The distance between the neighboring mo... | instruction | 0 | 51,721 | 3 | 103,442 |
No | output | 1 | 51,721 | 3 | 103,443 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Once upon a time a little frog whose name was Vasya decided to travel around his home swamp. Overall there are n mounds on the swamp, located on one line. The distance between the neighboring mo... | instruction | 0 | 51,722 | 3 | 103,444 |
No | output | 1 | 51,722 | 3 | 103,445 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Once upon a time a little frog whose name was Vasya decided to travel around his home swamp. Overall there are n mounds on the swamp, located on one line. The distance between the neighboring mo... | instruction | 0 | 51,723 | 3 | 103,446 |
No | output | 1 | 51,723 | 3 | 103,447 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Captain Bill the Hummingbird and his crew recieved an interesting challenge offer. Some stranger gave them a map, potion of teleportation and said that only this potion might help them to reach the treasure.
Bottle with potion has two valu... | instruction | 0 | 51,794 | 3 | 103,588 |
Tags: implementation, math, number theory
Correct Solution:
```
def solve(x1,y1,x2,y2,x,y):
if abs(x2-x1)%x != 0 or abs(y2-y1)%y != 0:
return "NO"
p = abs(x2-x1)//x
q = abs(y2-y1)//y
if p&1 != q&1:
return "NO"
return "YES"
def main():
x1,y1,x2,y2 = map(int, input().spli... | output | 1 | 51,794 | 3 | 103,589 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Captain Bill the Hummingbird and his crew recieved an interesting challenge offer. Some stranger gave them a map, potion of teleportation and said that only this potion might help them to reach the treasure.
Bottle with potion has two valu... | instruction | 0 | 51,795 | 3 | 103,590 |
Tags: implementation, math, number theory
Correct Solution:
```
x,y,x2,y2=map(int,input().split())
a,b=map(int,input().split())
flag=1
if (x2-x)%a!=0 or (y2-y)%b!=0:
flag=0
else:
t=(x2-x)//a
t2=(y2-y)//b
if t%2==t2%2:
print('YES')
else:
flag=0
if flag==0:
print('NO')
... | output | 1 | 51,795 | 3 | 103,591 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Captain Bill the Hummingbird and his crew recieved an interesting challenge offer. Some stranger gave them a map, potion of teleportation and said that only this potion might help them to reach the treasure.
Bottle with potion has two valu... | instruction | 0 | 51,797 | 3 | 103,594 |
Tags: implementation, math, number theory
Correct Solution:
```
xp,yp,xt,yt=map(int,input().split())
mx,my=map(int,input().split())
dx=abs(xt-xp)
dy=abs(yp-yt)
if not dx%mx and not dy%my:
x=dx/mx
y=dy/my
if x%2==y%2:
print("YES")
else:
print("NO")
else:
print("NO")
``` | output | 1 | 51,797 | 3 | 103,595 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Captain Bill the Hummingbird and his crew recieved an interesting challenge offer. Some stranger gave them a map, potion of teleportation and said that only this potion might help them to reach the treasure.
Bottle with potion has two valu... | instruction | 0 | 51,798 | 3 | 103,596 |
Tags: implementation, math, number theory
Correct Solution:
```
def main():
x1, y1, x2, y2 = map(int, input().split())
a, b = map(int, input().split())
xd = x2 - x1
yd = y2 - y1
if xd % a != 0 or yd % b != 0:
print('NO')
return
xd /= a
yd /= b
print("YES" if (xd % 2) ... | output | 1 | 51,798 | 3 | 103,597 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Captain Bill the Hummingbird and his crew recieved an interesting challenge offer. Some stranger gave them a map, potion of teleportation and said that only this potion might help them to reach the treasure.
Bottle with potion has two valu... | instruction | 0 | 51,799 | 3 | 103,598 |
Tags: implementation, math, number theory
Correct Solution:
```
import sys
import bisect
from bisect import bisect_left as lb
from bisect import bisect_right as rb
input_=lambda: sys.stdin.readline().strip("\r\n")
from math import log
from math import gcd
from math import atan2,acos
from random import randint
sa=lambda... | output | 1 | 51,799 | 3 | 103,599 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Captain Bill the Hummingbird and his crew recieved an interesting challenge offer. Some stranger gave them a map, potion of teleportation and said that only this potion might help them to reach the treasure.
Bottle with potion has two valu... | instruction | 0 | 51,800 | 3 | 103,600 |
Tags: implementation, math, number theory
Correct Solution:
```
x1, y1, x2, y2 = map(int, input().split())
x, y = map(int, input().split())
if abs(x1 - x2) % x != 0 or abs(y1 - y2) % y != 0:
print('NO')
else:
a = abs(x1 - x2) / x
b = abs(y1 - y2) / y
if a % 2 == b % 2:
print('YES')
else:
... | output | 1 | 51,800 | 3 | 103,601 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Captain Bill the Hummingbird and his crew recieved an interesting challenge offer. Some stranger gave them a map, potion of teleportation and said that only this potion might help them to reach the treasure.
Bottle with potion has two valu... | instruction | 0 | 51,801 | 3 | 103,602 |
Tags: implementation, math, number theory
Correct Solution:
```
x1, y1, x2, y2 = map(int, input().split())
x, y = map(int, input().split())
dx, dy = abs(x2 - x1), abs(y2 - y1)
print(('NO', 'YES')[dx % x == 0 and dy % y == 0 and (dx // x) % 2 == (dy // y) % 2])
``` | output | 1 | 51,801 | 3 | 103,603 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Captain Bill the Hummingbird and his crew recieved an interesting challenge offer. Some stranger gave them a map, potion of teleportation and said that only this potion might help them to reach ... | instruction | 0 | 51,802 | 3 | 103,604 |
Yes | output | 1 | 51,802 | 3 | 103,605 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Captain Bill the Hummingbird and his crew recieved an interesting challenge offer. Some stranger gave them a map, potion of teleportation and said that only this potion might help them to reach ... | instruction | 0 | 51,803 | 3 | 103,606 |
Yes | output | 1 | 51,803 | 3 | 103,607 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Captain Bill the Hummingbird and his crew recieved an interesting challenge offer. Some stranger gave them a map, potion of teleportation and said that only this potion might help them to reach ... | instruction | 0 | 51,804 | 3 | 103,608 |
Yes | output | 1 | 51,804 | 3 | 103,609 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Captain Bill the Hummingbird and his crew recieved an interesting challenge offer. Some stranger gave them a map, potion of teleportation and said that only this potion might help them to reach ... | instruction | 0 | 51,805 | 3 | 103,610 |
Yes | output | 1 | 51,805 | 3 | 103,611 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Captain Bill the Hummingbird and his crew recieved an interesting challenge offer. Some stranger gave them a map, potion of teleportation and said that only this potion might help them to reach ... | instruction | 0 | 51,806 | 3 | 103,612 |
No | output | 1 | 51,806 | 3 | 103,613 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Captain Bill the Hummingbird and his crew recieved an interesting challenge offer. Some stranger gave them a map, potion of teleportation and said that only this potion might help them to reach ... | instruction | 0 | 51,807 | 3 | 103,614 |
No | output | 1 | 51,807 | 3 | 103,615 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Captain Bill the Hummingbird and his crew recieved an interesting challenge offer. Some stranger gave them a map, potion of teleportation and said that only this potion might help them to reach ... | instruction | 0 | 51,808 | 3 | 103,616 |
No | output | 1 | 51,808 | 3 | 103,617 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Captain Bill the Hummingbird and his crew recieved an interesting challenge offer. Some stranger gave them a map, potion of teleportation and said that only this potion might help them to reach ... | instruction | 0 | 51,809 | 3 | 103,618 |
No | output | 1 | 51,809 | 3 | 103,619 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Arthur owns a ski resort on a mountain. There are n landing spots on the mountain numbered from 1 to n from the top to the foot of the mountain. The spots are connected with one-directional ski ... | instruction | 0 | 52,400 | 3 | 104,800 |
Yes | output | 1 | 52,400 | 3 | 104,801 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Arthur owns a ski resort on a mountain. There are n landing spots on the mountain numbered from 1 to n from the top to the foot of the mountain. The spots are connected with one-directional ski ... | instruction | 0 | 52,401 | 3 | 104,802 |
Yes | output | 1 | 52,401 | 3 | 104,803 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Arthur owns a ski resort on a mountain. There are n landing spots on the mountain numbered from 1 to n from the top to the foot of the mountain. The spots are connected with one-directional ski ... | instruction | 0 | 52,402 | 3 | 104,804 |
Yes | output | 1 | 52,402 | 3 | 104,805 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Arthur owns a ski resort on a mountain. There are n landing spots on the mountain numbered from 1 to n from the top to the foot of the mountain. The spots are connected with one-directional ski ... | instruction | 0 | 52,403 | 3 | 104,806 |
Yes | output | 1 | 52,403 | 3 | 104,807 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Arthur owns a ski resort on a mountain. There are n landing spots on the mountain numbered from 1 to n from the top to the foot of the mountain. The spots are connected with one-directional ski ... | instruction | 0 | 52,404 | 3 | 104,808 |
No | output | 1 | 52,404 | 3 | 104,809 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Arthur owns a ski resort on a mountain. There are n landing spots on the mountain numbered from 1 to n from the top to the foot of the mountain. The spots are connected with one-directional ski ... | instruction | 0 | 52,405 | 3 | 104,810 |
No | output | 1 | 52,405 | 3 | 104,811 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Arthur owns a ski resort on a mountain. There are n landing spots on the mountain numbered from 1 to n from the top to the foot of the mountain. The spots are connected with one-directional ski ... | instruction | 0 | 52,406 | 3 | 104,812 |
No | output | 1 | 52,406 | 3 | 104,813 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Arthur owns a ski resort on a mountain. There are n landing spots on the mountain numbered from 1 to n from the top to the foot of the mountain. The spots are connected with one-directional ski ... | instruction | 0 | 52,407 | 3 | 104,814 |
No | output | 1 | 52,407 | 3 | 104,815 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ksusha the Squirrel is standing at the beginning of a straight road, divided into n sectors. The sectors are numbered 1 to n, from left to right. Initially, Ksusha stands in sector 1.
Ksusha w... | instruction | 0 | 52,532 | 3 | 105,064 |
Yes | output | 1 | 52,532 | 3 | 105,065 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ksusha the Squirrel is standing at the beginning of a straight road, divided into n sectors. The sectors are numbered 1 to n, from left to right. Initially, Ksusha stands in sector 1.
Ksusha w... | instruction | 0 | 52,533 | 3 | 105,066 |
Yes | output | 1 | 52,533 | 3 | 105,067 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ksusha the Squirrel is standing at the beginning of a straight road, divided into n sectors. The sectors are numbered 1 to n, from left to right. Initially, Ksusha stands in sector 1.
Ksusha w... | instruction | 0 | 52,534 | 3 | 105,068 |
Yes | output | 1 | 52,534 | 3 | 105,069 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Ksusha the Squirrel is standing at the beginning of a straight road, divided into n sectors. The sectors are numbered 1 to n, from left to right. Initially, Ksusha stands in sector 1.
Ksusha w... | instruction | 0 | 52,535 | 3 | 105,070 |
Yes | output | 1 | 52,535 | 3 | 105,071 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.