message stringlengths 2 23.8k | message_type stringclasses 2
values | message_id int64 0 1 | conversation_id int64 97 109k | cluster float64 0 0 | __index_level_0__ int64 194 217k |
|---|---|---|---|---|---|
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kevin has just recevied his disappointing results on the USA Identification of Cows Olympiad (USAICO) in the form of a binary string of length n. Each character of Kevin's string represents Kevi... | instruction | 0 | 69,427 | 0 | 138,854 |
Yes | output | 1 | 69,427 | 0 | 138,855 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kevin has just recevied his disappointing results on the USA Identification of Cows Olympiad (USAICO) in the form of a binary string of length n. Each character of Kevin's string represents Kevi... | instruction | 0 | 69,428 | 0 | 138,856 |
Yes | output | 1 | 69,428 | 0 | 138,857 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kevin has just recevied his disappointing results on the USA Identification of Cows Olympiad (USAICO) in the form of a binary string of length n. Each character of Kevin's string represents Kevi... | instruction | 0 | 69,429 | 0 | 138,858 |
Yes | output | 1 | 69,429 | 0 | 138,859 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kevin has just recevied his disappointing results on the USA Identification of Cows Olympiad (USAICO) in the form of a binary string of length n. Each character of Kevin's string represents Kevi... | instruction | 0 | 69,430 | 0 | 138,860 |
Yes | output | 1 | 69,430 | 0 | 138,861 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kevin has just recevied his disappointing results on the USA Identification of Cows Olympiad (USAICO) in the form of a binary string of length n. Each character of Kevin's string represents Kevi... | instruction | 0 | 69,431 | 0 | 138,862 |
No | output | 1 | 69,431 | 0 | 138,863 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kevin has just recevied his disappointing results on the USA Identification of Cows Olympiad (USAICO) in the form of a binary string of length n. Each character of Kevin's string represents Kevi... | instruction | 0 | 69,432 | 0 | 138,864 |
No | output | 1 | 69,432 | 0 | 138,865 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kevin has just recevied his disappointing results on the USA Identification of Cows Olympiad (USAICO) in the form of a binary string of length n. Each character of Kevin's string represents Kevi... | instruction | 0 | 69,433 | 0 | 138,866 |
No | output | 1 | 69,433 | 0 | 138,867 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Kevin has just recevied his disappointing results on the USA Identification of Cows Olympiad (USAICO) in the form of a binary string of length n. Each character of Kevin's string represents Kevi... | instruction | 0 | 69,434 | 0 | 138,868 |
No | output | 1 | 69,434 | 0 | 138,869 |
Provide a correct Python 3 solution for this coding contest problem.
A linear congruential generator produces a series R(⋅) of pseudo-random numbers by the following for- mulas:
<image>
where S, A, C, and M are all parameters. In this problem, 0 ≤ S, A, C ≤ 15 and M = 256.
Now suppose we have some input string I(⋅)... | instruction | 0 | 69,776 | 0 | 139,552 |
"Correct Solution:
```
import math
M = 256
def entropy_if_smallest(ctr,bound):
ret = 0
for v in ctr:
if v == 0: continue
ret -= (v / N) * math.log2(v / N)
if ret >= bound:
return None
return ret
def solve(src):
ans_h = float('inf')
ans = None
for s in range(... | output | 1 | 69,776 | 0 | 139,553 |
Provide a correct Python 3 solution for this coding contest problem.
A linear congruential generator produces a series R(⋅) of pseudo-random numbers by the following for- mulas:
<image>
where S, A, C, and M are all parameters. In this problem, 0 ≤ S, A, C ≤ 15 and M = 256.
Now suppose we have some input string I(⋅)... | instruction | 0 | 69,777 | 0 | 139,554 |
"Correct Solution:
```
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 998244353
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.rea... | output | 1 | 69,777 | 0 | 139,555 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s, consisting of n lowercase Latin letters.
A substring of string s is a continuous segment of letters from s. For example, "defor" is a substring of "codeforces" and "fors" is not.
The length of the substring is th... | instruction | 0 | 69,840 | 0 | 139,680 |
Tags: implementation, strings
Correct Solution:
```
n=int(input())
s=list(input())
if sorted(s)[0]==sorted(s)[n-1]:
print('NO')
else:
print('YES')
for i in range(0,n-1):
if s[i]!=s[i+1] :
g=s[i]+s[i+1]
print(g)
exit()
``` | output | 1 | 69,840 | 0 | 139,681 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s, consisting of n lowercase Latin letters.
A substring of string s is a continuous segment of letters from s. For example, "defor" is a substring of "codeforces" and "fors" is not.
The length of the substring is th... | instruction | 0 | 69,841 | 0 | 139,682 |
Tags: implementation, strings
Correct Solution:
```
def test_0():
# A -
import math
from collections import Counter
n = list(map(int, input().split(" ")))[0]
ss = input()
aa = ''
for i in range(n-1):
if ss[i] != ss[i+1]:
aa = ss[i: i+2]
break
if aa == '':
... | output | 1 | 69,841 | 0 | 139,683 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s, consisting of n lowercase Latin letters.
A substring of string s is a continuous segment of letters from s. For example, "defor" is a substring of "codeforces" and "fors" is not.
The length of the substring is th... | instruction | 0 | 69,842 | 0 | 139,684 |
Tags: implementation, strings
Correct Solution:
```
n = int(input())
s = input()
for i in range(n - 1):
if s[i] != s[i + 1]:
print('YES\n' + s[i] + s[i + 1])
break
else:
print('NO')
``` | output | 1 | 69,842 | 0 | 139,685 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s, consisting of n lowercase Latin letters.
A substring of string s is a continuous segment of letters from s. For example, "defor" is a substring of "codeforces" and "fors" is not.
The length of the substring is th... | instruction | 0 | 69,843 | 0 | 139,686 |
Tags: implementation, strings
Correct Solution:
```
n = int(input())
s = input()
for i in range(len(s)-1):
if s[i] != s[i+1]:
print('YES')
print(s[i]+s[i+1])
break
else:print('NO')
``` | output | 1 | 69,843 | 0 | 139,687 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s, consisting of n lowercase Latin letters.
A substring of string s is a continuous segment of letters from s. For example, "defor" is a substring of "codeforces" and "fors" is not.
The length of the substring is th... | instruction | 0 | 69,844 | 0 | 139,688 |
Tags: implementation, strings
Correct Solution:
```
N=int(input())
a=list(input())
if(a.count(a[0])==N):
print("NO")
else:
for i in range(0,N-1):
if(a[i]!=a[i+1]):
S=a[i]+a[i+1]
break
print("YES")
print(S)
``` | output | 1 | 69,844 | 0 | 139,689 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s, consisting of n lowercase Latin letters.
A substring of string s is a continuous segment of letters from s. For example, "defor" is a substring of "codeforces" and "fors" is not.
The length of the substring is th... | instruction | 0 | 69,845 | 0 | 139,690 |
Tags: implementation, strings
Correct Solution:
```
n = int(input())
l1 = list(input())
if len(set(l1))>=2:
print("YES")
print("".join(list(set(l1))[:2]))
else:
print("NO")
``` | output | 1 | 69,845 | 0 | 139,691 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s, consisting of n lowercase Latin letters.
A substring of string s is a continuous segment of letters from s. For example, "defor" is a substring of "codeforces" and "fors" is not.
The length of the substring is th... | instruction | 0 | 69,846 | 0 | 139,692 |
Tags: implementation, strings
Correct Solution:
```
from sys import stdin
from collections import Counter
n = stdin.readline()
s = stdin.readline().rstrip()
def solve(s):
for i in range(len(s) - 1):
if s[i] != s[i + 1]:
print("YES")
print(s[i:i+2])
return
print("NO"... | output | 1 | 69,846 | 0 | 139,693 |
Provide tags and a correct Python 3 solution for this coding contest problem.
You are given a string s, consisting of n lowercase Latin letters.
A substring of string s is a continuous segment of letters from s. For example, "defor" is a substring of "codeforces" and "fors" is not.
The length of the substring is th... | instruction | 0 | 69,847 | 0 | 139,694 |
Tags: implementation, strings
Correct Solution:
```
n, s = int(input()), input()
for i in range(1,n):
if s[i-1] != s[i]:
print('YES\n',s[i-1],s[i],sep='')
break
else:
print('NO')
``` | output | 1 | 69,847 | 0 | 139,695 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s, consisting of n lowercase Latin letters.
A substring of string s is a continuous segment of letters from s. For example, "defor" is a substring of "codeforces" and "fo... | instruction | 0 | 69,848 | 0 | 139,696 |
Yes | output | 1 | 69,848 | 0 | 139,697 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s, consisting of n lowercase Latin letters.
A substring of string s is a continuous segment of letters from s. For example, "defor" is a substring of "codeforces" and "fo... | instruction | 0 | 69,849 | 0 | 139,698 |
Yes | output | 1 | 69,849 | 0 | 139,699 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s, consisting of n lowercase Latin letters.
A substring of string s is a continuous segment of letters from s. For example, "defor" is a substring of "codeforces" and "fo... | instruction | 0 | 69,850 | 0 | 139,700 |
Yes | output | 1 | 69,850 | 0 | 139,701 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s, consisting of n lowercase Latin letters.
A substring of string s is a continuous segment of letters from s. For example, "defor" is a substring of "codeforces" and "fo... | instruction | 0 | 69,851 | 0 | 139,702 |
Yes | output | 1 | 69,851 | 0 | 139,703 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s, consisting of n lowercase Latin letters.
A substring of string s is a continuous segment of letters from s. For example, "defor" is a substring of "codeforces" and "fo... | instruction | 0 | 69,852 | 0 | 139,704 |
No | output | 1 | 69,852 | 0 | 139,705 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s, consisting of n lowercase Latin letters.
A substring of string s is a continuous segment of letters from s. For example, "defor" is a substring of "codeforces" and "fo... | instruction | 0 | 69,853 | 0 | 139,706 |
No | output | 1 | 69,853 | 0 | 139,707 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s, consisting of n lowercase Latin letters.
A substring of string s is a continuous segment of letters from s. For example, "defor" is a substring of "codeforces" and "fo... | instruction | 0 | 69,854 | 0 | 139,708 |
No | output | 1 | 69,854 | 0 | 139,709 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
You are given a string s, consisting of n lowercase Latin letters.
A substring of string s is a continuous segment of letters from s. For example, "defor" is a substring of "codeforces" and "fo... | instruction | 0 | 69,855 | 0 | 139,710 |
No | output | 1 | 69,855 | 0 | 139,711 |
Provide tags and a correct Python 3 solution for this coding contest problem.
Nam is playing with a string on his computer. The string consists of n lowercase English letters. It is meaningless, so Nam decided to make the string more beautiful, that is to make it be a palindrome by using 4 arrow keys: left, right, up,... | instruction | 0 | 70,196 | 0 | 140,392 |
Tags: brute force, greedy, implementation
Correct Solution:
```
import math
content_length, current_position = map(int, input().split())
middle_position = math.ceil(content_length / 2)
text = input()
answer = 0
first_need_change = -1
last_need_change = -1
for index in range(middle_position):
left_char = text[ind... | output | 1 | 70,196 | 0 | 140,393 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nam is playing with a string on his computer. The string consists of n lowercase English letters. It is meaningless, so Nam decided to make the string more beautiful, that is to make it be a pal... | instruction | 0 | 70,203 | 0 | 140,406 |
Yes | output | 1 | 70,203 | 0 | 140,407 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nam is playing with a string on his computer. The string consists of n lowercase English letters. It is meaningless, so Nam decided to make the string more beautiful, that is to make it be a pal... | instruction | 0 | 70,204 | 0 | 140,408 |
Yes | output | 1 | 70,204 | 0 | 140,409 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nam is playing with a string on his computer. The string consists of n lowercase English letters. It is meaningless, so Nam decided to make the string more beautiful, that is to make it be a pal... | instruction | 0 | 70,205 | 0 | 140,410 |
Yes | output | 1 | 70,205 | 0 | 140,411 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nam is playing with a string on his computer. The string consists of n lowercase English letters. It is meaningless, so Nam decided to make the string more beautiful, that is to make it be a pal... | instruction | 0 | 70,206 | 0 | 140,412 |
Yes | output | 1 | 70,206 | 0 | 140,413 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nam is playing with a string on his computer. The string consists of n lowercase English letters. It is meaningless, so Nam decided to make the string more beautiful, that is to make it be a pal... | instruction | 0 | 70,207 | 0 | 140,414 |
No | output | 1 | 70,207 | 0 | 140,415 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nam is playing with a string on his computer. The string consists of n lowercase English letters. It is meaningless, so Nam decided to make the string more beautiful, that is to make it be a pal... | instruction | 0 | 70,208 | 0 | 140,416 |
No | output | 1 | 70,208 | 0 | 140,417 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nam is playing with a string on his computer. The string consists of n lowercase English letters. It is meaningless, so Nam decided to make the string more beautiful, that is to make it be a pal... | instruction | 0 | 70,209 | 0 | 140,418 |
No | output | 1 | 70,209 | 0 | 140,419 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
Nam is playing with a string on his computer. The string consists of n lowercase English letters. It is meaningless, so Nam decided to make the string more beautiful, that is to make it be a pal... | instruction | 0 | 70,210 | 0 | 140,420 |
No | output | 1 | 70,210 | 0 | 140,421 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a given string S consisting of N symbols. Your task is to find the number of ordered pairs of integers i and j such that
1. 1 ≤ i, j ≤ N
2. S[i] = S[j], that is the i-th symbol of string S is equal to the j-th.
Input
The single ... | instruction | 0 | 70,211 | 0 | 140,422 |
Tags: strings
Correct Solution:
```
s = input()
flags = {}
n = 0
for c in s:
flags[c] = 0
for c in s:
n += flags[c] * 2
n += 1
flags[c] += 1
print(n)
``` | output | 1 | 70,211 | 0 | 140,423 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a given string S consisting of N symbols. Your task is to find the number of ordered pairs of integers i and j such that
1. 1 ≤ i, j ≤ N
2. S[i] = S[j], that is the i-th symbol of string S is equal to the j-th.
Input
The single ... | instruction | 0 | 70,212 | 0 | 140,424 |
Tags: strings
Correct Solution:
```
a=list(input())
b=[]
for i in set(a):
b.append(a.count(i))
print(sum(i**2 for i in b))
``` | output | 1 | 70,212 | 0 | 140,425 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a given string S consisting of N symbols. Your task is to find the number of ordered pairs of integers i and j such that
1. 1 ≤ i, j ≤ N
2. S[i] = S[j], that is the i-th symbol of string S is equal to the j-th.
Input
The single ... | instruction | 0 | 70,213 | 0 | 140,426 |
Tags: strings
Correct Solution:
```
s = input()
d = {}
for c in s:
d[c] = d.get(c, 0 ) + 1
ans = 0
for i in d.values():
ans += i ** 2
print(ans)
``` | output | 1 | 70,213 | 0 | 140,427 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a given string S consisting of N symbols. Your task is to find the number of ordered pairs of integers i and j such that
1. 1 ≤ i, j ≤ N
2. S[i] = S[j], that is the i-th symbol of string S is equal to the j-th.
Input
The single ... | instruction | 0 | 70,214 | 0 | 140,428 |
Tags: strings
Correct Solution:
```
a=list(input())
s=0
b=[]
for i in a:
if i not in b:
b.append(i)
l=a.count(i)
s= s + l**2
print(s)
``` | output | 1 | 70,214 | 0 | 140,429 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a given string S consisting of N symbols. Your task is to find the number of ordered pairs of integers i and j such that
1. 1 ≤ i, j ≤ N
2. S[i] = S[j], that is the i-th symbol of string S is equal to the j-th.
Input
The single ... | instruction | 0 | 70,215 | 0 | 140,430 |
Tags: strings
Correct Solution:
```
s= input()
f={}
for j in s:
if j not in f:
f[j]=1
else:
f[j]+=1
ans=0
for k in f.keys():
ans+=f[k]
ans+=(f[k]-1)*(f[k])
print(ans)
``` | output | 1 | 70,215 | 0 | 140,431 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a given string S consisting of N symbols. Your task is to find the number of ordered pairs of integers i and j such that
1. 1 ≤ i, j ≤ N
2. S[i] = S[j], that is the i-th symbol of string S is equal to the j-th.
Input
The single ... | instruction | 0 | 70,216 | 0 | 140,432 |
Tags: strings
Correct Solution:
```
a=list(input());s=0
for i in set(a):
s+=(a.count(i))**2
print(s)
``` | output | 1 | 70,216 | 0 | 140,433 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a given string S consisting of N symbols. Your task is to find the number of ordered pairs of integers i and j such that
1. 1 ≤ i, j ≤ N
2. S[i] = S[j], that is the i-th symbol of string S is equal to the j-th.
Input
The single ... | instruction | 0 | 70,217 | 0 | 140,434 |
Tags: strings
Correct Solution:
```
s = list(input())
ans = len(s)
dic = {}
for item in s:
if item not in dic:
dic[item] = 1
else:
dic[item] += 1
for item in dic.keys():
ans += dic[item] * (dic[item] - 1)
print(ans)
``` | output | 1 | 70,217 | 0 | 140,435 |
Provide tags and a correct Python 3 solution for this coding contest problem.
There is a given string S consisting of N symbols. Your task is to find the number of ordered pairs of integers i and j such that
1. 1 ≤ i, j ≤ N
2. S[i] = S[j], that is the i-th symbol of string S is equal to the j-th.
Input
The single ... | instruction | 0 | 70,218 | 0 | 140,436 |
Tags: strings
Correct Solution:
```
s=input()
d={}
sum=0
for i in s:
d[i]=d.get(i,0)+1
for each in d.values():
sum+=each**2
print(sum)
``` | output | 1 | 70,218 | 0 | 140,437 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a given string S consisting of N symbols. Your task is to find the number of ordered pairs of integers i and j such that
1. 1 ≤ i, j ≤ N
2. S[i] = S[j], that is the i-th symbol of str... | instruction | 0 | 70,219 | 0 | 140,438 |
Yes | output | 1 | 70,219 | 0 | 140,439 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a given string S consisting of N symbols. Your task is to find the number of ordered pairs of integers i and j such that
1. 1 ≤ i, j ≤ N
2. S[i] = S[j], that is the i-th symbol of str... | instruction | 0 | 70,220 | 0 | 140,440 |
Yes | output | 1 | 70,220 | 0 | 140,441 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a given string S consisting of N symbols. Your task is to find the number of ordered pairs of integers i and j such that
1. 1 ≤ i, j ≤ N
2. S[i] = S[j], that is the i-th symbol of str... | instruction | 0 | 70,222 | 0 | 140,444 |
Yes | output | 1 | 70,222 | 0 | 140,445 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a given string S consisting of N symbols. Your task is to find the number of ordered pairs of integers i and j such that
1. 1 ≤ i, j ≤ N
2. S[i] = S[j], that is the i-th symbol of str... | instruction | 0 | 70,223 | 0 | 140,446 |
No | output | 1 | 70,223 | 0 | 140,447 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a given string S consisting of N symbols. Your task is to find the number of ordered pairs of integers i and j such that
1. 1 ≤ i, j ≤ N
2. S[i] = S[j], that is the i-th symbol of str... | instruction | 0 | 70,224 | 0 | 140,448 |
No | output | 1 | 70,224 | 0 | 140,449 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a given string S consisting of N symbols. Your task is to find the number of ordered pairs of integers i and j such that
1. 1 ≤ i, j ≤ N
2. S[i] = S[j], that is the i-th symbol of str... | instruction | 0 | 70,225 | 0 | 140,450 |
No | output | 1 | 70,225 | 0 | 140,451 |
Evaluate the correctness of the submitted Python 3 solution to the coding contest problem. Provide a "Yes" or "No" response.
There is a given string S consisting of N symbols. Your task is to find the number of ordered pairs of integers i and j such that
1. 1 ≤ i, j ≤ N
2. S[i] = S[j], that is the i-th symbol of str... | instruction | 0 | 70,226 | 0 | 140,452 |
No | output | 1 | 70,226 | 0 | 140,453 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.