message stringlengths 2 44.5k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 42 109k | cluster float64 5 5 | __index_level_0__ int64 84 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider the following problem: given an array a containing n integers (indexed from 0 to n-1), find max_{0 β€ l β€ r β€ n-1} β_{l β€ i β€ r} (r-l+1) β
a_i. In this problem, 1 β€ n β€ 2 000 and |a_i| β€... | instruction | 0 | 64,888 | 5 | 129,776 |
Yes | output | 1 | 64,888 | 5 | 129,777 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider the following problem: given an array a containing n integers (indexed from 0 to n-1), find max_{0 β€ l β€ r β€ n-1} β_{l β€ i β€ r} (r-l+1) β
a_i. In this problem, 1 β€ n β€ 2 000 and |a_i| β€... | instruction | 0 | 64,889 | 5 | 129,778 |
Yes | output | 1 | 64,889 | 5 | 129,779 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider the following problem: given an array a containing n integers (indexed from 0 to n-1), find max_{0 β€ l β€ r β€ n-1} β_{l β€ i β€ r} (r-l+1) β
a_i. In this problem, 1 β€ n β€ 2 000 and |a_i| β€... | instruction | 0 | 64,890 | 5 | 129,780 |
No | output | 1 | 64,890 | 5 | 129,781 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider the following problem: given an array a containing n integers (indexed from 0 to n-1), find max_{0 β€ l β€ r β€ n-1} β_{l β€ i β€ r} (r-l+1) β
a_i. In this problem, 1 β€ n β€ 2 000 and |a_i| β€... | instruction | 0 | 64,891 | 5 | 129,782 |
No | output | 1 | 64,891 | 5 | 129,783 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider the following problem: given an array a containing n integers (indexed from 0 to n-1), find max_{0 β€ l β€ r β€ n-1} β_{l β€ i β€ r} (r-l+1) β
a_i. In this problem, 1 β€ n β€ 2 000 and |a_i| β€... | instruction | 0 | 64,892 | 5 | 129,784 |
No | output | 1 | 64,892 | 5 | 129,785 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Consider the following problem: given an array a containing n integers (indexed from 0 to n-1), find max_{0 β€ l β€ r β€ n-1} β_{l β€ i β€ r} (r-l+1) β
a_i. In this problem, 1 β€ n β€ 2 000 and |a_i| β€... | instruction | 0 | 64,893 | 5 | 129,786 |
No | output | 1 | 64,893 | 5 | 129,787 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an integer x of n digits a_1, a_2, β¦, a_n, which make up its decimal notation in order from left to right.
Also, you are given a positive integer k < n.
Let's call integer b_1, b... | instruction | 0 | 64,951 | 5 | 129,902 |
Yes | output | 1 | 64,951 | 5 | 129,903 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an integer x of n digits a_1, a_2, β¦, a_n, which make up its decimal notation in order from left to right.
Also, you are given a positive integer k < n.
Let's call integer b_1, b... | instruction | 0 | 64,953 | 5 | 129,906 |
Yes | output | 1 | 64,953 | 5 | 129,907 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an integer x of n digits a_1, a_2, β¦, a_n, which make up its decimal notation in order from left to right.
Also, you are given a positive integer k < n.
Let's call integer b_1, b... | instruction | 0 | 64,955 | 5 | 129,910 |
No | output | 1 | 64,955 | 5 | 129,911 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an integer x of n digits a_1, a_2, β¦, a_n, which make up its decimal notation in order from left to right.
Also, you are given a positive integer k < n.
Let's call integer b_1, b... | instruction | 0 | 64,957 | 5 | 129,914 |
No | output | 1 | 64,957 | 5 | 129,915 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an integer x of n digits a_1, a_2, β¦, a_n, which make up its decimal notation in order from left to right.
Also, you are given a positive integer k < n.
Let's call integer b_1, b... | instruction | 0 | 64,958 | 5 | 129,916 |
No | output | 1 | 64,958 | 5 | 129,917 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array of n integer numbers. Let sum(l, r) be the sum of all numbers on positions from l to r non-inclusive (l-th element is counted, r-th element is not counted). For indices l ... | instruction | 0 | 65,360 | 5 | 130,720 |
No | output | 1 | 65,360 | 5 | 130,721 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array of n integer numbers. Let sum(l, r) be the sum of all numbers on positions from l to r non-inclusive (l-th element is counted, r-th element is not counted). For indices l ... | instruction | 0 | 65,361 | 5 | 130,722 |
No | output | 1 | 65,361 | 5 | 130,723 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array of n integer numbers. Let sum(l, r) be the sum of all numbers on positions from l to r non-inclusive (l-th element is counted, r-th element is not counted). For indices l ... | instruction | 0 | 65,362 | 5 | 130,724 |
No | output | 1 | 65,362 | 5 | 130,725 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array of n integer numbers. Let sum(l, r) be the sum of all numbers on positions from l to r non-inclusive (l-th element is counted, r-th element is not counted). For indices l ... | instruction | 0 | 65,363 | 5 | 130,726 |
No | output | 1 | 65,363 | 5 | 130,727 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array s of n non-negative integers.
A 5-tuple of integers (a, b, c, d, e) is said to be valid if it satisfies the following conditions:
* 1 β€ a, b, c, d, e β€ n
* (sa | sb... | instruction | 0 | 65,380 | 5 | 130,760 |
No | output | 1 | 65,380 | 5 | 130,761 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an array s of n non-negative integers.
A 5-tuple of integers (a, b, c, d, e) is said to be valid if it satisfies the following conditions:
* 1 β€ a, b, c, d, e β€ n
* (sa | sb... | instruction | 0 | 65,381 | 5 | 130,762 |
No | output | 1 | 65,381 | 5 | 130,763 |
Provide a correct Python 3 solution for this coding contest problem.
You are given an integer sequence of length N, a_1,a_2,...,a_N.
For each 1β€iβ€N, you have three choices: add 1 to a_i, subtract 1 from a_i or do nothing.
After these operations, you select an integer X and count the number of i such that a_i=X.
Max... | instruction | 0 | 65,507 | 5 | 131,014 |
"Correct Solution:
```
N = int(input())
a = map(int, input().split())
counts = [0] * (10**5 + 2)
for a_i in a:
counts[a_i + 1] += 1
counts_all = [0] * (10**5)
for i in range(10**5):
counts_all[i] += (counts[i] + counts[i + 1] + counts[i + 2])
print(max(counts_all))
``` | output | 1 | 65,507 | 5 | 131,015 |
Provide a correct Python 3 solution for this coding contest problem.
You are given an integer sequence of length N, a_1,a_2,...,a_N.
For each 1β€iβ€N, you have three choices: add 1 to a_i, subtract 1 from a_i or do nothing.
After these operations, you select an integer X and count the number of i such that a_i=X.
Max... | instruction | 0 | 65,508 | 5 | 131,016 |
"Correct Solution:
```
from collections import Counter
N = int(input())
A = list(map(int, input().split()))
d = Counter(A)
ans = 0
for i in range(1, 10**5+1):
tmp = d[i-1] + d[i] + d[i+1]
ans = max(tmp, ans)
print(ans)
``` | output | 1 | 65,508 | 5 | 131,017 |
Provide a correct Python 3 solution for this coding contest problem.
You are given an integer sequence of length N, a_1,a_2,...,a_N.
For each 1β€iβ€N, you have three choices: add 1 to a_i, subtract 1 from a_i or do nothing.
After these operations, you select an integer X and count the number of i such that a_i=X.
Max... | instruction | 0 | 65,509 | 5 | 131,018 |
"Correct Solution:
```
a = int(input())
b = list(map(int, input().split()))
c = {}
for i in b:
if i not in c:
c[i] = 1
else:
c[i] += 1
if i+1 not in c:
c[i+1] = 1
else:
c[i+1] += 1
if i-1 not in c:
c[i-1] = 1
else:
c[i-1] += 1
c = sorted(c.items(),... | output | 1 | 65,509 | 5 | 131,019 |
Provide a correct Python 3 solution for this coding contest problem.
You are given an integer sequence of length N, a_1,a_2,...,a_N.
For each 1β€iβ€N, you have three choices: add 1 to a_i, subtract 1 from a_i or do nothing.
After these operations, you select an integer X and count the number of i such that a_i=X.
Max... | instruction | 0 | 65,510 | 5 | 131,020 |
"Correct Solution:
```
N = int(input())
A = list(map(int, input().split()))
count = [0 for _ in range(10 ** 5 + 1)]
for a in A:
count[a] += 1
ret = 0
for i in range(1, 10 ** 5):
ret = max(ret, count[i - 1] + count[i] + count[i + 1])
print(ret)
``` | output | 1 | 65,510 | 5 | 131,021 |
Provide a correct Python 3 solution for this coding contest problem.
You are given an integer sequence of length N, a_1,a_2,...,a_N.
For each 1β€iβ€N, you have three choices: add 1 to a_i, subtract 1 from a_i or do nothing.
After these operations, you select an integer X and count the number of i such that a_i=X.
Max... | instruction | 0 | 65,511 | 5 | 131,022 |
"Correct Solution:
```
N = int(input())
A = list(map(int,input().split()))
num = [0 for i in range(200000)]
for i in range(N):
num[A[i]-1] += 1
num[A[i]] += 1
num[A[i]+1] += 1
print(str(max(num)))
``` | output | 1 | 65,511 | 5 | 131,023 |
Provide a correct Python 3 solution for this coding contest problem.
You are given an integer sequence of length N, a_1,a_2,...,a_N.
For each 1β€iβ€N, you have three choices: add 1 to a_i, subtract 1 from a_i or do nothing.
After these operations, you select an integer X and count the number of i such that a_i=X.
Max... | instruction | 0 | 65,512 | 5 | 131,024 |
"Correct Solution:
```
from collections import Counter
if __name__ == '__main__':
n = int(input())
a = [int(s) for s in input().split()]
print(max(Counter(a + [x - 1 for x in a] + [x + 1 for x in a]).values()))
``` | output | 1 | 65,512 | 5 | 131,025 |
Provide a correct Python 3 solution for this coding contest problem.
You are given an integer sequence of length N, a_1,a_2,...,a_N.
For each 1β€iβ€N, you have three choices: add 1 to a_i, subtract 1 from a_i or do nothing.
After these operations, you select an integer X and count the number of i such that a_i=X.
Max... | instruction | 0 | 65,513 | 5 | 131,026 |
"Correct Solution:
```
cnt = []
for _ in range(10**5+2):
cnt.append(0)
n = int(input())
a = [int(v) for v in input().split()]
for x in a:
cnt[x] += 1
if x > 0 : cnt[x-1] += 1
cnt[x+1] += 1
answer = 0
for n in cnt:
answer = max(answer, n)
print(answer)
``` | output | 1 | 65,513 | 5 | 131,027 |
Provide a correct Python 3 solution for this coding contest problem.
You are given an integer sequence of length N, a_1,a_2,...,a_N.
For each 1β€iβ€N, you have three choices: add 1 to a_i, subtract 1 from a_i or do nothing.
After these operations, you select an integer X and count the number of i such that a_i=X.
Max... | instruction | 0 | 65,514 | 5 | 131,028 |
"Correct Solution:
```
# ARC082C - Together (ABC072C)
def main():
n = int(input())
lst = list(map(int, input().rstrip().split()))
ans = [0] * 100001
for i in lst:
ans[i] += 1
print(max(map(sum, zip(ans, ans[1:], ans[2:]))))
if __name__ == "__main__":
main()
``` | output | 1 | 65,514 | 5 | 131,029 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an integer sequence of length N, a_1,a_2,...,a_N.
For each 1β€iβ€N, you have three choices: add 1 to a_i, subtract 1 from a_i or do nothing.
After these operations, you select an i... | instruction | 0 | 65,515 | 5 | 131,030 |
Yes | output | 1 | 65,515 | 5 | 131,031 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an integer sequence of length N, a_1,a_2,...,a_N.
For each 1β€iβ€N, you have three choices: add 1 to a_i, subtract 1 from a_i or do nothing.
After these operations, you select an i... | instruction | 0 | 65,516 | 5 | 131,032 |
Yes | output | 1 | 65,516 | 5 | 131,033 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an integer sequence of length N, a_1,a_2,...,a_N.
For each 1β€iβ€N, you have three choices: add 1 to a_i, subtract 1 from a_i or do nothing.
After these operations, you select an i... | instruction | 0 | 65,517 | 5 | 131,034 |
Yes | output | 1 | 65,517 | 5 | 131,035 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an integer sequence of length N, a_1,a_2,...,a_N.
For each 1β€iβ€N, you have three choices: add 1 to a_i, subtract 1 from a_i or do nothing.
After these operations, you select an i... | instruction | 0 | 65,518 | 5 | 131,036 |
Yes | output | 1 | 65,518 | 5 | 131,037 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an integer sequence of length N, a_1,a_2,...,a_N.
For each 1β€iβ€N, you have three choices: add 1 to a_i, subtract 1 from a_i or do nothing.
After these operations, you select an i... | instruction | 0 | 65,519 | 5 | 131,038 |
No | output | 1 | 65,519 | 5 | 131,039 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an integer sequence of length N, a_1,a_2,...,a_N.
For each 1β€iβ€N, you have three choices: add 1 to a_i, subtract 1 from a_i or do nothing.
After these operations, you select an i... | instruction | 0 | 65,520 | 5 | 131,040 |
No | output | 1 | 65,520 | 5 | 131,041 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an integer sequence of length N, a_1,a_2,...,a_N.
For each 1β€iβ€N, you have three choices: add 1 to a_i, subtract 1 from a_i or do nothing.
After these operations, you select an i... | instruction | 0 | 65,521 | 5 | 131,042 |
No | output | 1 | 65,521 | 5 | 131,043 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given an integer sequence of length N, a_1,a_2,...,a_N.
For each 1β€iβ€N, you have three choices: add 1 to a_i, subtract 1 from a_i or do nothing.
After these operations, you select an i... | instruction | 0 | 65,522 | 5 | 131,044 |
No | output | 1 | 65,522 | 5 | 131,045 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
The fact that any positive integer has a representation as the sum of at most four positive squares (i.e. squares of positive integers) is known as Lagrangeβs Four-Square Theorem. The first publ... | instruction | 0 | 65,574 | 5 | 131,148 |
No | output | 1 | 65,574 | 5 | 131,149 |
Provide a correct Python 3 solution for this coding contest problem.
In programming languages like C/C++, a goto statement provides an unconditional jump from the "goto" to a labeled statement. For example, a statement "goto CHECK_NUM;" is executed, control of the program jumps to CHECK_NUM. Using these constructs, yo... | instruction | 0 | 65,594 | 5 | 131,188 |
"Correct Solution:
```
n=int(input())
L=""
for i in range(1,n+1):
if i%3==0 or '3' in str(i):
L +=' '+str(i)
print(L)
``` | output | 1 | 65,594 | 5 | 131,189 |
Provide a correct Python 3 solution for this coding contest problem.
In programming languages like C/C++, a goto statement provides an unconditional jump from the "goto" to a labeled statement. For example, a statement "goto CHECK_NUM;" is executed, control of the program jumps to CHECK_NUM. Using these constructs, yo... | instruction | 0 | 65,595 | 5 | 131,190 |
"Correct Solution:
```
n = int(input())
res = [i for i in range(3, n+1) if (i % 3 == 0) or ("3" in str(i))]
print(" ",end="")
print(*res)
``` | output | 1 | 65,595 | 5 | 131,191 |
Provide a correct Python 3 solution for this coding contest problem.
In programming languages like C/C++, a goto statement provides an unconditional jump from the "goto" to a labeled statement. For example, a statement "goto CHECK_NUM;" is executed, control of the program jumps to CHECK_NUM. Using these constructs, yo... | instruction | 0 | 65,596 | 5 | 131,192 |
"Correct Solution:
```
n = int(input())
for i in range(3, n+1):
if i % 3 == 0 or "3" in str(i):
print(" {0}".format(i), end="")
print()
``` | output | 1 | 65,596 | 5 | 131,193 |
Provide a correct Python 3 solution for this coding contest problem.
In programming languages like C/C++, a goto statement provides an unconditional jump from the "goto" to a labeled statement. For example, a statement "goto CHECK_NUM;" is executed, control of the program jumps to CHECK_NUM. Using these constructs, yo... | instruction | 0 | 65,597 | 5 | 131,194 |
"Correct Solution:
```
n = int(input())
for i in range(3, n + 1):
if i % 3 == 0 or i % 10 == 3 or '3' in str(i):
print('',i,end='')
print()
``` | output | 1 | 65,597 | 5 | 131,195 |
Provide a correct Python 3 solution for this coding contest problem.
In programming languages like C/C++, a goto statement provides an unconditional jump from the "goto" to a labeled statement. For example, a statement "goto CHECK_NUM;" is executed, control of the program jumps to CHECK_NUM. Using these constructs, yo... | instruction | 0 | 65,598 | 5 | 131,196 |
"Correct Solution:
```
n = int(input())
for i in range(n):
if (i+10) % 3 == 0 or '3' in str(i+1):
print( " ", i+1, sep = '', end = '' )
print("")
``` | output | 1 | 65,598 | 5 | 131,197 |
Provide a correct Python 3 solution for this coding contest problem.
In programming languages like C/C++, a goto statement provides an unconditional jump from the "goto" to a labeled statement. For example, a statement "goto CHECK_NUM;" is executed, control of the program jumps to CHECK_NUM. Using these constructs, yo... | instruction | 0 | 65,599 | 5 | 131,198 |
"Correct Solution:
```
n = int(input())
for i in range(1, n+1):
if i % 3 == 0 or "3" in str(i):
print(" " + str(i), end="")
print()
``` | output | 1 | 65,599 | 5 | 131,199 |
Provide a correct Python 3 solution for this coding contest problem.
In programming languages like C/C++, a goto statement provides an unconditional jump from the "goto" to a labeled statement. For example, a statement "goto CHECK_NUM;" is executed, control of the program jumps to CHECK_NUM. Using these constructs, yo... | instruction | 0 | 65,600 | 5 | 131,200 |
"Correct Solution:
```
n = int(input())
i = 1
while i <= n:
if i % 3 == 0 or str(i).count('3') > 0:
print(f" {i}", end='')
i += 1
print()
``` | output | 1 | 65,600 | 5 | 131,201 |
Provide a correct Python 3 solution for this coding contest problem.
In programming languages like C/C++, a goto statement provides an unconditional jump from the "goto" to a labeled statement. For example, a statement "goto CHECK_NUM;" is executed, control of the program jumps to CHECK_NUM. Using these constructs, yo... | instruction | 0 | 65,601 | 5 | 131,202 |
"Correct Solution:
```
n = int(input())
for i in range(1, n+1):
if i % 3 == 0 or '3' in str(i):
print(' %d' % i, end='')
print()
``` | output | 1 | 65,601 | 5 | 131,203 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Chouti was doing a competitive programming competition. However, after having all the problems accepted, he got bored and decided to invent some small games.
He came up with the following game.... | instruction | 0 | 65,645 | 5 | 131,290 |
Yes | output | 1 | 65,645 | 5 | 131,291 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Chouti was doing a competitive programming competition. However, after having all the problems accepted, he got bored and decided to invent some small games.
He came up with the following game.... | instruction | 0 | 65,646 | 5 | 131,292 |
Yes | output | 1 | 65,646 | 5 | 131,293 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Chouti was doing a competitive programming competition. However, after having all the problems accepted, he got bored and decided to invent some small games.
He came up with the following game.... | instruction | 0 | 65,647 | 5 | 131,294 |
Yes | output | 1 | 65,647 | 5 | 131,295 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Chouti was doing a competitive programming competition. However, after having all the problems accepted, he got bored and decided to invent some small games.
He came up with the following game.... | instruction | 0 | 65,648 | 5 | 131,296 |
Yes | output | 1 | 65,648 | 5 | 131,297 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Chouti was doing a competitive programming competition. However, after having all the problems accepted, he got bored and decided to invent some small games.
He came up with the following game.... | instruction | 0 | 65,649 | 5 | 131,298 |
No | output | 1 | 65,649 | 5 | 131,299 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Chouti was doing a competitive programming competition. However, after having all the problems accepted, he got bored and decided to invent some small games.
He came up with the following game.... | instruction | 0 | 65,650 | 5 | 131,300 |
No | output | 1 | 65,650 | 5 | 131,301 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Chouti was doing a competitive programming competition. However, after having all the problems accepted, he got bored and decided to invent some small games.
He came up with the following game.... | instruction | 0 | 65,651 | 5 | 131,302 |
No | output | 1 | 65,651 | 5 | 131,303 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Chouti was doing a competitive programming competition. However, after having all the problems accepted, he got bored and decided to invent some small games.
He came up with the following game.... | instruction | 0 | 65,652 | 5 | 131,304 |
No | output | 1 | 65,652 | 5 | 131,305 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.