problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p02607 | s006312579 | Wrong Answer | n = int(input("Enter your limit : "))
s = list(map(int,input().split()[:n]))
a = 0
for i in range(1,len(s)):
if((i%2 != 0) and (s[i]%2 !=0)):
a+=1
print(a) |
p02607 | s829883724 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
print( sum(i%2==1 and a[i]%2==1 for i in range(n)) ) |
p02607 | s642643089 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
cnt = 0
for i in range(len(a)):
if i % 2 and a[i] % 2:
cnt += 1
print(cnt) |
p02607 | s592716273 | Wrong Answer | '''
5
1 3 4 5 7
'''
lens = int(input())
vals = [int(x) for x in input().split()]
odds = 0
for i in range(lens):
if i % 2 == 0 and vals[i] % 2 == 0:
odds += 1
print(odds) |
p02607 | s165063970 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(n):
if i % 2 == 1 and a[i] % 2 == 1:
ans += 1
print(ans) |
p02607 | s293603477 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
count = 0
for i in range(n):
if i % 2 == 1 and a[i] % 2 == 1:
count += 1
print(count)
|
p02607 | s301830435 | Wrong Answer | #!/usr/bin/env python
n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(n):
if i%2==1 and a[i]%2==1:
ans += 1
print(ans)
|
p02607 | s686421646 | Wrong Answer | import sys
N = int(sys.stdin.readline())
#L,R,d = map(int, sys.stdin.readline().split())
ans = 0
for i,n in enumerate(map(int, sys.stdin.readline().split())):
if i % 2 == 0:
continue
if n % 2 == 0:
continue
ans += 1
print(ans)
|
p02607 | s739328858 | Wrong Answer | N=int(input())
a=list(map(int,input().split()))
ans=0
for i in range(N):
if (i+1)%2==0 and a[i]%2!=0:
ans+=1
print(ans)
|
p02607 | s989221684 | Wrong Answer | n = int(input())
#a,b = map(int,input().split())
a_L = list(map(int,input().split()))
ans = 0
for i in range(n):
if i%2!=0 and a_L[i] !=0:
ans += 1
print(ans) |
p02607 | s633437452 | Wrong Answer | N = int(input())
A = [int(x) for x in input().split()]
ans = 0
for i in range(N):
if A[i]%2 == 1 and i%2 == 1:
ans += 1
print(ans)
|
p02607 | s069723929 | Wrong Answer | a=[input() for i in range(2)]
a1=int(a[0])
a2=[int(i) for i in a[1].split()]
count=0
for i in range(len(a2)):
if i%2==1:
if a2[i]%2==1:
count+=1
print(count)
|
p02607 | s199461819 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
ans = []
for i in range(n):
if (i+1)%2==0 and a[i]%2==1:
ans.append(i)
print(len(ans))
|
p02607 | s584698644 | Wrong Answer | import sys
from math import ceil, floor, sqrt, sin, cos, pi
from itertools import accumulate, permutations, combinations
from fractions import gcd # 最大公約数
from collections import deque, Counter
from operator import itemgetter
from heapq import heappop,heappush
sys.setrecursionlimit(10**7)
def lcm(x, y): return ((x * y) // gcd(x, y)) # 最小公倍数
# list(map(int, input().split()))
n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(n):
if i%2 == 1:
if a[i]%2 == 1:
ans += 1
print(ans) |
p02607 | s759005437 | Wrong Answer | N = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(N):
if i%2 != 0:
if a[i]%2 != 0:
ans += 1
print(ans)
|
p02607 | s503834512 | Wrong Answer | N = int(input())
lst = list(map(int, input().split()))
unko = 0
for i in range(len(lst)):
if i % 2 == 0 or lst[i] % 2 == 0:
continue
else:
unko += 1
print(unko) |
p02607 | s442516314 | Wrong Answer | #B
N = int(input())
a = list(map(int,input().split()))
cou = 0
for i in range(N):
if i %2 == 1 and a[i] %2 ==1:
cou += 1
print(cou)
|
p02607 | s127994598 | Wrong Answer | n = int(input())
arr = list(map(int, input().split()))
res = 0
for a in arr[1::2]:
if a % 2 == 1:
res += 1
print(res) |
p02607 | s303013819 | Wrong Answer | #!/usr/bin/env python3
input()
A = input().split(' ')
A = list(map(int, A))
ret = 0
for i, a in enumerate(A):
if i % 2 == 1 and a % 2 == 1:
ret += 1
print(ret) |
p02607 | s053622428 | Wrong Answer | import sys
N = int(input())
a = list(map(int, sys.stdin.readline().strip().split()))
ans = 0
for i in range(1, N, 2):
if a[i]%2 == 1:
ans += 1
print(ans) |
p02607 | s712601511 | Wrong Answer | def main():
no = int(input())
maths = map(int,input().split())
count = 0
for index,math in enumerate(maths):
if index % 2==1 and math %2==1:
count+=1
print(count)
if __name__ == "__main__":
main() |
p02607 | s804627348 | Wrong Answer | N = int(input())
a = [int(i) for i in input().split()]
h = 0
for s in range(N) :
if s % 2 == 1:
if a[s] % 2 == 1:
h += 1
print(h) |
p02607 | s241405607 | Wrong Answer | #!/usr/bin/env python3
import sys
input = iter(sys.stdin.read().splitlines()).__next__
sys.setrecursionlimit(10000)
N = int(input())
A = list(map(int, input().split()))
res = len([1 for i in range(N) if i % 2 == 1 and A[i] % 2 == 1 ])
print(res)
|
p02607 | s979478036 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
ans =[]
for i in range(len(a)):
if i%2 == 0:
continue
else:
ans.append(a[i])
print(len([i for i in ans if i % 2 != 0])) |
p02607 | s681625023 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
cnt = 0
for i in range(n):
if i % 2 == 0 and a[i] % 2 != 0:
print(i, a[i], cnt)
cnt += 1
print(cnt)
|
p02607 | s868389632 | Wrong Answer | N = int(input())
a = list(map(int,input().split()))
res = 0
for i in range(N):
if i%2 == 1 and a[i]%2 == 1:
res += 1
print(res) |
p02607 | s601295217 | Wrong Answer | # -*- coding: utf-8 -*-
n = int(input())
a_list = list(map(int, input().split()))
ans = 0
for i in range(len(a_list)):
if i % 2 == 1:
if a_list[i] % 2 == 1:
ans += 1
print(ans) |
p02607 | s877759449 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
ans=0
for i in range(1, N, 2):
if A[i]%2==1:
ans+=1
print(ans) |
p02607 | s911164092 | Wrong Answer | n=int(input())
a = list(map(int,input().split()))
count=0
for i in range(n):
if i%2==1 and a[i]%2==1:
count+=1
print(count) |
p02607 | s948918717 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
ans=0
for i in range(n):
if i%2 != 0 and a[i]%2 != 0:
ans+=1
print(ans) |
p02607 | s373708555 | Wrong Answer | in_str = input()
N = int(in_str)
in_list = input().split(' ')
count = int(N/2) + 1
index = 0
while index <= (N-1):
if int(in_list[index])%2==0:
count -= 1
index += 2
print(count) |
p02607 | s367510659 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
cnt = 0
for i, j in enumerate(a):
if i % 2 != 0 and j % 2!=0:
cnt += 1
print(cnt) |
p02607 | s332758234 | Wrong Answer | N = int(input())
a=list(map(int,input().split()))
cnt=0
for i in range((N+1)//2):
if a[2*i-1] % 2 == 1:
cnt += 1
print(cnt) |
p02607 | s941818210 | Wrong Answer | N = int(input())
masu_list = list(map(int, input().split()))
result = 0
for i, masu in enumerate(masu_list):
if i % 2 == 1:
if masu % 2 == 1:
result = result + 1
print(result)
|
p02607 | s593535892 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
ans=0
for i in a[1::2]:
ans+=i%2
print(ans) |
p02607 | s068049275 | Wrong Answer | N = int(input())
ans = 0
for n in range(1, N+1):
for x in range(1, 101):
for y in range(1, 101):
for z in range(1,101):
if x**2 + y**2 + z**2 + x*y + y*z + z*x == n:
ans+=1
print(ans)
ans=0 |
p02607 | s615998976 | Wrong Answer | N = int(input())
a = list(map(int, input().split()))
count = 0
for i in range(N):
if i % 2 == 1 and a[i] %2 == 1:
count += 1
print(count) |
p02607 | s248956570 | Wrong Answer | N=int(input())
A=list(map(int,input().split()))
ans=0
for i in range(N):
if i % 2==1 and A[i] %2 ==1:
ans+=1
print(ans) |
p02607 | s600286129 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
cnt=0
for i in range(N):
if A[i]%2==1 and i%2==1:
cnt+=1
print(cnt) |
p02607 | s646559569 | Wrong Answer | N = int(input())
arr = list(map(int, input().split()))
result = 0
for i in range(0,len(arr)):
if i%2!=0 and arr[i]%2!=0:
result +=1
print(result) |
p02607 | s938767854 | Wrong Answer | ans=0
n=int(input())
for i,v in enumerate(list(map(int,input().split()))):
if i%2 and v%2:ans+=1
print(ans) |
p02607 | s563708742 | Wrong Answer | n = int(input())
l = list(map(int, input().split()))
l1 = l[0::2]
cnt = 0
for i in l1:
if i % 2 == 1:
cnt += 1
print(l1) |
p02607 | s277518800 | Wrong Answer | N = int(input())
a = list(map(int, input().split()))
count = 0
for i in range(1, N, 2):
if a[i] % 2 == 1:
count += 1
print(str(count)) |
p02607 | s805014232 | Wrong Answer | n = int(input())
mas = list(map(int,input().split()))
mlen = len(mas)
kiss = 0
ans = 0
if n % 2 == 0:
kiss = n / 2
else:
kiss = ((n - 1) / 2) + 1
kiss = int(kiss)
for i in mas:
i % 2 != 0
ans += 1
ans1 = ans + kiss
print(ans1)
|
p02607 | s030206954 | Wrong Answer | import sys
import heapq
import math
import fractions
import bisect
import itertools
from collections import Counter
from collections import deque
from operator import itemgetter
def input(): return sys.stdin.readline().strip()
def mp(): return map(int,input().split())
def lmp(): return list(map(int,input().split()))
n=int(input())
a=lmp()
ans=0
for i in range(n):
if i%2==1 and a[i]%2==1:
ans+=1
print(ans) |
p02607 | s502313610 | Wrong Answer | N = int(input())
a = [int(x) for x in input().split()]
count = 0
for i in range(N):
if i % 2 == 1 and a[i] % 2 == 1:
count += 1
print(count)
|
p02607 | s733099845 | Wrong Answer | import copy
def main():
N = int(input())
l = list(map(int, input().split()))
c = 0
for i in range(N):
if (i + 1) % 2 == 0 and l[i] % 2 == 1:
c = c + 1
print(c)
main() |
p02607 | s266132433 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(n):
if i % 2 == 1:
if a[i] % 2 == 1:
ans += 1
print(ans) |
p02607 | s599425229 | Wrong Answer | n = int(input())
string = input()
num_list = [int(i) for i in string.split()]
count = 0
for i in range(1, n-1):
if i % 2 == num_list[i] % 2 == 1:
count += 1
print(count) |
p02607 | s868542740 | Wrong Answer | N = int(input())
*A, = map(int, input().split())
ans = 0
for i, a in enumerate(A):
if i & 1 and a & 1:
ans += 1
print(ans)
|
p02607 | s841904401 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
cnt = 0
for i in range(len(a)):
if (i % 2 == 1) and (a[i] % 2 == 1):
cnt += 1
print(cnt) |
p02607 | s059999866 | Wrong Answer | import sys
input = sys.stdin.readline
N = int(input())
A = list(map(int,input().split()))
ans = 0
for i in range(N):
if (((i*1) * A[i]) % 2) == 1:
ans += 1
print(ans)
|
p02607 | s198220422 | Wrong Answer | N = int(input())
num_list = list(map(int, input().split()))
ans = 0
for i in range(0,len(num_list)):
if num_list[i]%2 == 1 and (num_list.index(num_list[i])+1)%2 == 1:
ans += 1
print(ans) |
p02607 | s623040873 | Wrong Answer | N = int(input())
a = list(map(int,input().split()))
count = 0
for i,j in enumerate(a):
if(i%2==1):
if(j%2 == 1):
count +=1
print(count) |
p02607 | s327526883 | Wrong Answer | n=int(input())
l=list(map(int,input().split()))
count=0
for i in range(n):
if i%2==1 and l[i]%2==1:
count+=1
print(count) |
p02607 | s708991738 | Wrong Answer | n = int(input())
string = input()
num_list = [int(i) for i in string.split()]
count = 0
for a, i in enumerate(num_list):
if a+1 % 2 == i % 2 == 1:
count += 1
print(count) |
p02607 | s225811739 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
count = 0
for a in A:
if (a % 2 != 0):
if A.index(a) %2 != 0:
count += 1
print(count)
|
p02607 | s373129012 | Wrong Answer | suu = int(input())
lis = input().split()
lis = [int(lis)for lis in lis]
count= 0
for i in range(len(lis)):
if i%2 != 0 and lis[i] % 2 !=0 :
count += 1
print(count)
|
p02607 | s193373707 | Wrong Answer | n = input()
num = list(map(int,input().split()))
print(num)
# mul = int(input().split())
cnt = 0
for i in range(1,len(num),2):
if(num[i] % 2 != 0):
cnt += 1
print(cnt) |
p02607 | s871176859 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
ans=0
for i in range(1,n,2):
if a[i]%2==1:
ans+=1
print(ans)
|
p02607 | s970170691 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
cnt = 0
for i in range(len(A)):
if i%2 != 0 and A[i]%2 != 0:
cnt += 1
print(cnt) |
p02607 | s076924428 | Wrong Answer | N = int(input())
a = list(map(int,input().split()))
count=0
for i in range(N-1):
if(i%2==1 and a[i]%2==1):
count+=1
print(count) |
p02607 | s452799650 | Wrong Answer | N=int(input())
li = list(map(int,input().split()))
coun=0
for i,h in enumerate(li):
if i+1 % 2 == 1 and h % 2 == 1:
coun+=1
print(coun) |
p02607 | s872478865 | Wrong Answer | import numpy as np
N = int(input())
a = list(map(int, input().split()))
a = a[1::2]
a = np.array(a)
print(np.count_nonzero(a%2 != 0)) |
p02607 | s634052051 | Wrong Answer | import sys
from collections import deque
import numpy as np
import math
sys.setrecursionlimit(10**6)
def S(): return sys.stdin.readline().rstrip()
def SL(): return map(str,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def IL(): return map(int,sys.stdin.readline().rstrip().split())
if __name__=='__main__':
n = I()
a = list(IL())
c = 0
for i,item in enumerate(a):
if i%2==0: continue
if item%2==1: c+=1
print(c)
exit() |
p02607 | s596280226 | Wrong Answer | print(sum([int(i)%2 for i in input().split()[::2]]))
|
p02607 | s257877899 | Wrong Answer | n = int(input())
m = input()
lst = m.split(" ")
num = 0
list2 = [int(i) for i in lst]
if(len(lst)==n):
for elem in list2:
if(elem%2==0 or elem%3==0 or elem%5==0):
if(list2.index(elem)%2==0 or list2.index(elem)%3==0 or list2.index(elem)%5==0):
num += 1
print(num) |
p02607 | s087336053 | Wrong Answer | n=int(input())
l=[int(X) for X in input().split()]
c=0
for i in range(1,len(l),1):
if l[i]%2 !=0 :
c+=1
print(c) |
p02607 | s828750101 | Wrong Answer | def main():
N = input_ints()
a = input_int_list_in_line()
print(len([True for i in range(N) if i % 2 == 0 and a[i] % 2 == 0]))
def input_ints():
line_list = input().split()
if len(line_list) == 1:
return int(line_list[0])
else:
return map(int, line_list)
def input_int_list_in_line():
return list(map(int, input().split()))
def input_int_tuple_list(n: int):
return [tuple(map(int, input().split())) for _ in range(n)]
main()
|
p02607 | s542919068 | Wrong Answer | N=int(input())
a = list(map(int, input().strip().split()))
ans=0
i=0
for _ in range(N):
if(i % 2 == 1 and a[i] % 2 == 1):
ans+=1
i+=1
print(ans) |
p02607 | s242081571 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
ans=0
for num , i in enumerate(a):
if num%2==1 and i%2==1:
ans+=1
print(ans) |
p02607 | s137776056 | Wrong Answer | n = int(input())
a = [int(i) for i in input().split()]
cnt = 0
for i in range(n):
if a[i]%2==1 and i%2==1:
cnt +=1
print(cnt) |
p02607 | s703703593 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
ans =[]
for i in range(len(a)):
if i%2 == 0:
ans.append(a[i])
continue
else:
continue
print(ans)
print([i for i in ans if i % 2 != 0])
print(len([i for i in ans if i % 2 != 0])) |
p02607 | s187939205 | Wrong Answer | n = int(input())
l = list(map(int,input().split()))
cnt = 0
for i in range(n):
if i%2==1 and l[i] %2 == 1:
cnt += 1
print(cnt) |
p02607 | s804873407 | Wrong Answer | n=map(int,input().split())
a=list(map(int,input().split()))
N=0
new_a=a[1::2]
for i in new_a:
if i%2==0:
N += 1
print(len(new_a)-N) |
p02607 | s332071236 | Wrong Answer | def main():
n = int(input())
a = list(map(int,input().split()))
count = 0
for i in range(n):
if i%2==1 and a[i]%2==1:
count+=1
print(count)
if __name__=='__main__':
main()
|
p02607 | s018623600 | Wrong Answer | n = int(input())
num = list(map(int,input().split()))
print(num)
# mul = int(input().split())
cnt = 0
for i in range(2,n+1,2):
if(num[i-1] % 2 != 0):
cnt += 1
print(cnt) |
p02607 | s096811362 | Wrong Answer | N = int(input())
a = list(map(int,input().split()))
ans = 0
for i in range(N):
if i % 2 != 0:
if a[i] % 2 != 0:
ans += 1
print(ans) |
p02607 | s641553232 | Wrong Answer | N = input()
a = list(map(int,input().split()))
odd = a[1::2]
count = 0
for i in odd:
if i % 2 == 1:
count += 1
else:
pass
print(count)
|
p02607 | s001840401 | Wrong Answer | n = int(input())
a = list(map(int, input().split(" ")))
count = 0
for i, ai in enumerate(a):
if i%2!=0 and ai%2!=0:
count+=1
print(count)
|
p02607 | s196399465 | Wrong Answer | n=int(input())
l=[int(X) for X in input().split()]
c=0
for i in range(len(l)):
if l[i]%2 !=0 and i%2!=0:
c+=1
print(c) |
p02607 | s726872478 | Wrong Answer | N = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(N):
if i%2 == 1 and a[i]%2==1:
ans += 1
print(ans) |
p02607 | s136539823 | Wrong Answer | n = int(input())
A = list(map(int,input().split()))
ans = 0
for i,a in enumerate(A):
if i%2 == 1 and a%2 == 1:
ans +=1
print(ans) |
p02607 | s558546900 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
cnt = 0
for i in range(1, len(a), 2):
if a[i] % 2 == 1:
cnt += 1
print(cnt) |
p02607 | s620443969 | Wrong Answer | n=int(input())
A=list(map(int,input().split()))
cnt=0
for i in range(n):
if i%2==1 and A[i]%2==1:
cnt+=1
print(cnt) |
p02607 | s522754381 | Wrong Answer | N = int(input())
a = list(map(int, input().split()))
cnt = 0
for i in range(N):
if i % 2 == 1 and a[i] % 2 == 1:
cnt += 1
print(cnt) |
p02607 | s370232648 | Wrong Answer | from sys import stdin
input = stdin.readline
N = input().rstrip()
a = [int(x) for x in input().split()]
ans = 0
for val in a:
if (int(a.index(val)) + 1) % 2 != 0 and val % 2 != 0:
ans = ans + 1
print(ans) |
p02607 | s053075012 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(n):
if (i + 1)%2 == 0 and a[i] % 2 == 1:
ans += 1
print(ans)
|
p02607 | s928115905 | Wrong Answer | n=int(input())
As = list(map(int,input().split()))
c=0
ans = 0
for a in As:
c+=1
if c%2 == 0:
if a%2 == 1:
ans+=1
print(ans) |
p02607 | s203617022 | Wrong Answer | n = int(input())
nums = list(map(int, input().split()))
count = 0
for i in range(n):
if i % 2 != 0 and nums[i] % 2 != 0:
count += 1
print(count) |
p02607 | s782411801 | Wrong Answer | from sys import stdin
def readline_from_stdin() -> str:
return stdin.readline().rstrip
if __name__ == '__main__':
N = int(input())
A = input().split()
a = [int(v) for _, v in enumerate(A)]
print(len([v for i, v in enumerate(a) if i % 2 != 0 and v % 2 != 0]))
|
p02607 | s123244835 | Wrong Answer | n=int(input())
li=list(map(int,input().split()))
ans=0
for i in range(n):
if li[i]%2!=0 and i%2 != 0 : ans+=1
print(ans) |
p02607 | s190891473 | Wrong Answer | N= map(int, input())
a = list(map(int,input().split()))
print(a) |
p02607 | s484769751 | Wrong Answer | n=int(input())
l=list(map(int,input().split()))
count=0
for i in range(n):
if i%2==1 and l[i]%2==1:
count += 1
print(count) |
p02607 | s445315037 | Wrong Answer | n = int(input())
num = list(map(int,input().split()))
print(num)
# mul = int(input().split())
cnt = 0
for i in range(1,n,2):
if(num[i] % 2 != 0):
cnt += 1
print(cnt) |
p02607 | s796312398 | Wrong Answer | n=int(input())
l=list(map(int,input().split()))
cnt=0
for i in range(len(l)):
if i%2==1 and l[i]%2==1:
cnt+=1
print(cnt) |
p02607 | s337645757 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(len(a)):
if i % 2 == 1 and a[i] % 2 == 1:
ans += 1
print(ans)
|
p02607 | s183223011 | Wrong Answer | N = int(input())
a = [int(i) for i in input().split()]
ans = 0
for i in range(N):
if not i%2 == 0:
if not a[i]%2 == 0:
ans += 1
print(ans) |
p02607 | s912778667 | Wrong Answer | N=int(input())
ai=list(map(int,input().split()))
ans=0
for i in range(N):
if i%2==0:
pass
if ai[i] %2==1:
ans+=1
print(ans)
|
p02607 | s728912388 | Wrong Answer | n = int(input())
num = list(map(int, input().split()))
cnt = 0
for i in range( n // 2 + 1):
print((2*i + 1))
if num[2*i - 1] % 2 == 1:
cnt += 1
print(cnt) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.