problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p02607 | s468962629 | Accepted | n=int(input())
a=[int(i) for i in input().split()]
c=0
for i in range(0,len(a),2):
d=i+1
if(d%2!=0 and a[i]%2!=0):
c=c+1
print(c)
|
p02607 | s840669805 | Accepted | N = int(input())
A = list(map(int,input().split()))
ans = 0
for i in range(N):
if i%2 ==0:
if A[i]%2 ==1:
ans += 1
else:
ans += 0
else:
ans += 0
print(ans) |
p02607 | s445551345 | Accepted | N = int(input())
li = list(map(int,input().split()))
counter = 0
for i in range(N):
if i%2==0:
if li[i]%2==1:
counter +=1
print(counter) |
p02607 | s816763807 | Accepted | N = int(input())
a = list(map(int,input().split()))
cnt = 0
for i in range(0,len(a),2):
if a[i]%2==1:
cnt+=1
print(cnt)
|
p02607 | s570272247 | Accepted | n=int(input())
l=list(map(int,input().split()))
ans=0
for i in range(0,n,2):
if l[i]%2!=0:
ans+=1
print(ans) |
p02607 | s041897695 | Accepted | import sys
readline = sys.stdin.buffer.readline
N=int(readline())
a=list(map(int, readline().split()))
cnt=0
for i in range(0,N,2):
if a[i]%2==1:
cnt+=1
print(cnt) |
p02607 | s473182230 | Accepted | n = int(input())
A = list(map(int, input().split()))
ans = 0
for i, a in enumerate(A):
if (i+1)%2 == 1 and a%2 == 1:
ans += 1
print(ans)
|
p02607 | s386076496 | Accepted | n = input()
ans = 0
for i,j in enumerate(map(int,input().split())):
ans += (~i&1 and j&1)
print(ans) |
p02607 | s306914985 | Accepted | n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(n):
if (i+1)%2 == 1 and a[i]%2 == 1:
ans += 1
print(ans) |
p02607 | s728110844 | Accepted | n = int(input())
an = list(map(int,input().split()))
cnt = 0
for ai in an[::2]:
if ai % 2 != 0:
cnt+=1
print(cnt)
|
p02607 | s353648695 | Accepted | a = int(input())
b = list(map(int, input().split()))
x=0
for i in range(0,a):
if i%2==0 and b[i]%2==1:
x=x+1
print(x) |
p02607 | s317844442 | Accepted | N = int(input())
A = list(map(int, input().split()))
res = 0
for i, a in enumerate(A, start=1):
if i%2 and a%2:
res += 1
print(res)
|
p02607 | s069153313 | Accepted | N = int(input())
A = list(map(int, input().split()))
ans = 0
for i in range(0, len(A), 2):
if (A[i] % 2) == 1:
ans += 1
print(ans)
|
p02607 | s049275598 | Accepted | N = int(input())
a = list(map(int, input().split()))
count = 0
for i in range(len(a)):
if((i+1)%2 == 1 and a[i]%2 == 1):
count+=1
print(count) |
p02607 | s183633029 | Accepted | N = int(input())
a = list(map(int, input().split()))
count = 0
for i in range(0,N):
if i == 0 or i % 2 == 0:
if a[i] % 2 != 0:
count += 1
print(count) |
p02607 | s777338500 | Accepted | import numpy as np
N = int(input())
a = np.array([int(s) for s in input().split()])
odd = a[0::2]
print(np.count_nonzero(odd%2 == 1)) |
p02607 | s977120948 | Accepted | def B():
N = int(input())
A = [int(i) for i in input().split()]
ans = 0
for i in range(0, N, 2):
if A[i]%2 == 1:
ans += 1
print(ans)
B() |
p02607 | s777389555 | Accepted | N = int(input())
a = list(map(int,input().split()))
ans = 0
for i in range(N):
if i%2 == 0 and a[i]%2 == 1:
ans += 1
print(ans) |
p02607 | s550639637 | Accepted | n=int(input())
a_list = list(map(int, input().split()))
ans=0
for i in range(n):
if i%2==0:
if a_list[i]%2==1:
ans+=1
print(ans) |
p02607 | s576322484 | Accepted | import sys
def L(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI():return list(map(int,sys.stdin.readline().rstrip().split()))
def LS():return list(sys.stdin.readline().rstrip().split())
def solver(N,A):
ans = 0
for i,a in enumerate(A):
#print(i,a)
if (i+1) % 2 != 0 and a % 2 != 0:
ans += 1
print(ans)
def main():
N = LI()
A = LI()
solver(N,A)
if __name__ == '__main__':
main()
|
p02607 | s589719344 | Accepted | n = int(input())
a = list(map(int, input().split()))
num = 0
for i in range(n):
if (i+1) % 2 == 1:
if a[i] % 2 == 1:
num += 1
print(num) |
p02607 | s628175638 | Accepted | a=int(input())
b=list(map(int,input().split()))
ans=0
for i in range(0,a,2):
if b[i]%2==1:
ans+=1
print(ans) |
p02607 | s683893898 | Accepted | # -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import itertools
import random
from collections import deque
from decimal import *
import queue
input = sys.stdin.readline
def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))
def inputStr(): return input()[:-1]
def main():
N = inputInt()
A = inputList()
ans = 0
for i,val in enumerate(A):
ii = i+1
if ii % 2 == 1:
if val % 2 == 1:
ans += 1
print(ans)
if __name__ == "__main__":
main()
|
p02607 | s981056672 | Accepted | N = int(input())
A = list(map(int, input().split()))
ans = 0
for i, a in enumerate(A):
if ((i + 1) % 2 == 1) and (a % 2 == 1):
ans += 1
print(ans) |
p02607 | s459993395 | Accepted | n = int(input())
arr = list(map(int, input().split()))
ans = 0
for i, v in enumerate(arr):
if (i+1) % 2 == 1 and v % 2 == 1:
ans += 1
print(ans) |
p02607 | s238149781 | Accepted | n = int(input())
a = list(map(int, input().split()))
cnt = 0
for i in range(0, n, 2):
if a[i] % 2 != 0:
cnt += 1
print(cnt)
|
p02607 | s619383891 | Accepted | N = int(input())
a = list(map(int, input().split()))
count = 0
for i, a in enumerate(a):
if (i+1) % 2 == 1:
if a % 2 == 1:
count += 1
print(count)
|
p02607 | s970368302 | Accepted | n = int(input())
a = list(map(int, input().split()))
cnt = 0
for i in range(len(a)):
if ((i+1) % 2 == 1) and (a[i] % 2 == 1):
cnt += 1
print(cnt) |
p02607 | s196038396 | Accepted | N = int(input())
A = list(map(int, input().split()))
result = 0
for i in range(0, N, 2):
result += A[i]%2==1
print(result) |
p02607 | s782722157 | Accepted | N = int(input())
a = list(map(int, input().split()))
i = 0
count = 0
for i,ai in enumerate(a):
if((i+1)%2==1)and(ai%2==1):
count+=1
print(count) |
p02607 | s476345184 | Accepted | n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(n):
if i % 2 == 0 and a[i] % 2:
ans += 1
print(ans) |
p02607 | s955785100 | Accepted | a=int(input())
li = list(map(int, input().split()))
count=0
for i in range(a):
if(((i+1)%2==1) and (li[i]%2==1)):
count+=1
print(count) |
p02607 | s824879451 | Accepted | n = int(input())
a = list(map(int,input().split()))
ans = 0
for i in range(n):
if (i+1)%2 == 1 and a[i]%2 == 1:
ans += 1
print(ans) |
p02607 | s517383637 | Accepted | n = int(input())
a = input().split()
answer =0
for i,v in enumerate(a):
if i%2==0 and int(v)%2==1:
answer+=1
print(answer) |
p02607 | s820544043 | Accepted | N = int(input())
*a, = map(int, input().split())
ans = 0
for i in range(N):
if (i+1)%2 and a[i]%2:
ans += 1
print(ans)
|
p02607 | s000403134 | Accepted | n = int(input())
a = list(map(int,input().split()))
count = 0
for i in range(n):
if (i+1) % 2 == 1 and a[i] % 2 == 1:
count += 1
print(count) |
p02607 | s391061333 | Accepted | from sys import stdin, stdout, setrecursionlimit
from collections import deque, defaultdict, Counter
from heapq import heappush, heappop
import math
rl = lambda: stdin.readline()
rll = lambda: stdin.readline().split()
rli = lambda: map(int, stdin.readline().split())
rlf = lambda: map(float, stdin.readline().split())
INF, NINF = float('inf'), float('-inf')
def main():
n = int(rl())
ans = 0
for i, a in enumerate(rli(), 1):
if i % 2 == 1 and a % 2 == 1:
ans += 1
print(ans)
stdout.close()
if __name__ == "__main__":
main() |
p02607 | s779744890 | Accepted | n = int(input())
a = list(map(int,input().split()))
ans = 0
for i in range(n):
if (i + 1) % 2 == 1 and a[i] % 2 == 1:
ans += 1
print(ans) |
p02607 | s388538914 | Accepted | import sys
sys.setrecursionlimit(10**8)
input = sys.stdin.readline
N = int(input())
A = list(map(int,input().split()))
ans = 0
for i in range(N):
if (i+1)&1 and A[i]&1:
ans += 1
print(ans) |
p02607 | s813184162 | Accepted | mass=int(input())
number=list(map(int,input().split()))
cnt = 0
for i in range(mass):
if (i+1)%2!=0 and number[i]%2!=0:
cnt+=1
print(cnt) |
p02607 | s839425078 | Accepted | N = int(input())
a = list(map(int, input().split()))
count = 0
for i, number in enumerate(a, 1):
if i % 2 != 0 and number % 2 != 0:
count += 1
print(count) |
p02607 | s962441139 | Accepted | # -*- coding: utf-8 -*-
import sys
def main():
input = sys.stdin.readline
n = int(input())
a_list = list(map(int, input().split()))
result = 0
for i, a in enumerate(a_list):
if i % 2 == 0:
if not a % 2 == 0:
result += 1
else:
continue
print(result)
return
if __name__ == '__main__':
main() |
p02607 | s900091527 | Accepted | import sys
sys.setrecursionlimit(10 ** 7)
rl = sys.stdin.readline
def solve():
N = int(rl())
a = list(map(int, rl().split()))
ans = 0
for i in range(0, N, 2):
if i % 2 == 0 and a[i] % 2 == 1:
ans += 1
print(ans)
if __name__ == '__main__':
solve()
|
p02607 | s671095769 | Accepted | n = int(input())
a = map(int, input().split())
ans = 0
for i, v in enumerate(a):
if i%2 == 0 and v%2 == 1:
ans += 1
print(ans)
|
p02607 | s797200597 | Accepted | a=int(input())
lst=list(map(int,input().split()))
cnt=0
for i in range(0,a,2):
if (lst[i] % 2==1) :
cnt+=1
print(cnt) |
p02607 | s804401539 | Accepted | n = int(input())
a = list(map(int, input().split()))[::2]
ans = 0
for i in a:
if i % 2:
ans += 1
print(ans) |
p02607 | s830636222 | Accepted | n=int(input())
a=list(map(int,input().split()))
cnt=0
for i in range(n):
if (i+1)%2==1:
if a[i]%2==1:
cnt+=1
print(cnt) |
p02607 | s552492425 | Accepted |
n = int(input())
a_list = list(map(int, input().split()))
count = 0
for i in range(len(a_list)):
# print("i : {0}".format(i))
# print("a_list[i] : {0}".format(a_list[i]))
if (i + 1) % 2 != 0 and a_list[i] % 2 != 0 :
# print('OK!')
count += 1
print(count) |
p02607 | s561932025 | Accepted | N= int(input())
l=list(map(int,input().split()))
ans=0
for i in range(N):
if i%2==0 and l[i]%2==1:
ans+=1
print(ans) |
p02607 | s629434464 | Accepted | n = int(input())
a = [int(_) for _ in input().split()]
ans = 0
for i in range(n):
if i % 2 == 0 and a[i] % 2 == 1:
ans += 1
print(ans)
|
p02607 | s473298971 | Accepted | n= int(input())
a_s= list(map(int, input().split(' ')))
count=0
for i in range(len(a_s)):
if i%2==0:
if a_s[i]%2==1:
count+=1
print(count) |
p02607 | s903041382 | Accepted | N = int(input())
a = list(map(int, input().split(' ')))
n = 0
for i in range(N):
if (i+1)%2 != 0:
if a[i]%2 != 0:
n += 1
print(n) |
p02607 | s570073119 | Accepted | def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
count = 0
ans = 0
N = i()
a = l()
for i in range(N):
if i % 2 == 0 and a[i] % 2 != 0:
ans += 1
print(ans) |
p02607 | s853647605 | Accepted | N = int(input())
A = list(map(int, input().split()))
cnt = 0
for i in range(len(A)):
if (i+1)%2 != 0 and A[i]%2 != 0:
cnt += 1
print(cnt) |
p02607 | s642500679 | Accepted | t= int(input())
lista=[int (x) for x in input().split()]
cont=0
for x in range(len(lista)):
if x % 2==0:
if lista[x] % 2 != 0:
cont+=1
print(cont) |
p02607 | s164970671 | Accepted | import sys
input = sys.stdin.readline
def main():
N = int(input())
A = list(map(int, input().split()))
ans = 0
for i, a in enumerate(A, start=1):
if i % 2 == 1 and a % 2 == 1:
ans += 1
print(ans)
if __name__ == "__main__":
main()
|
p02607 | s206573423 | Accepted | n=int(input())
a=list(map(int, input().split()))
ans=0
for i in range(n):
if i%2==0 and a[i]%2==1:
ans+=1
print(ans) |
p02607 | s335210091 | Accepted | N = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(0, N, 2):
if a[i] % 2 != 0:
ans += 1
print(ans) |
p02607 | s175901333 | Accepted | N = int(input())
a = list(map(int, input().split()))
ans = 0
for k in range(0, N, 2):
if a[k] % 2 == 1:
ans += 1
print(ans) |
p02607 | s379130181 | Accepted | n = int(input())
a = list(map(int,input().split()))
count=1
an = 0
for i in range(len(a)):
if count%2==1 and a[i]%2==1:
an=an+1
count=count+1
print(an) |
p02607 | s499278653 | Accepted | N=input()
Num_Array=[int(i) for i in input().split()]
ans=0
for (i,j) in enumerate(Num_Array):
if (i+1)%2==1 and j%2==1:
ans+=1
print(ans) |
p02607 | s329940972 | Accepted | n=int(input())
a=list(map(int, input().split()))
ans=0
for i in range(0,n,2):
if a[i]%2==1:
ans+=1
print(ans) |
p02607 | s980640490 | Accepted | n = int(input())
a = list(map(int, input().split()))
ans = 0
for i, v in enumerate(a):
if i % 2 == 0 and v % 2 == 1:
ans += 1
print(ans) |
p02607 | s643799293 | Accepted | n = int(input())
A = [int(x) for x in input().split()]
comp = 0
for el in range(0, n, 2):
if A[el] % 2 != 0:
comp += 1
print(comp) |
p02607 | s662486396 | Accepted | n = int(input())
li = list(map(int, input().split()))[:n]
count = 0
for i in range(0, n, 2):
if li[i] % 2 != 0:
count+=1
print(count)
|
p02607 | s784743856 | Accepted | from sys import stdin
N = int(stdin.readline())
num_line = stdin.readline()
nums = num_line.split(' ')
odd = True;
counter = 0
for i in nums:
number = int(i)
if (number%2 == 1 and odd):
counter +=1
odd = not odd
print(counter) |
p02607 | s246434303 | Accepted | N = int(input())
lst = input().split()
count = 0
for i in range(N):
if (i + 1) % 2 == 1 and int(lst[i]) % 2 == 1:
count += 1
print(count) |
p02607 | s784857071 | Accepted | n = int(input())
lst = list(map(int, input().split()))
ans = 0
for _ in range(0,n,2):
if lst[_] % 2 != 0:
ans += 1
print(ans) |
p02607 | s892929581 | Accepted | n=int(input())
s=0
a=list(map(int,input().split()))
for i in range(n):
if a[i]%2!=0 and (i+1)%2!=0:
s+=1
print(s) |
p02607 | s626223461 | Accepted | n = int(input())
lis = list(map(int, input().split()))
count = 0
for k in range(0,n,2):
if lis[k] % 2 != 0:
count += 1
print(count) |
p02607 | s762093026 | Accepted | N = int(input())
A = [int(_n) for _n in input().split()]
a = 0
for i in range(0,N,2):
if A[i] % 2 == 1:
a += 1
print(a) |
p02607 | s108125708 | Accepted | N = int(input())
a = list(map(int, input().split()))
cnt = 0
for i in range(N):
if i % 2 == 0:
if a[i] % 2 == 1:
cnt += 1
print(cnt)
|
p02607 | s002597177 | Accepted | N = int(input())
A = list(map(int, input().split()))
ans = sum(1 for a in A[::2] if a % 2 == 1)
print(ans) |
p02607 | s052190307 | Accepted | 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)%2 == 1 and A[i]%2 == 1:
ans += 1
print(ans)
|
p02607 | s134494244 | Accepted | n = int(input())
a = [int(i) for i in input().split()]
ans = 0
for i in range(n):
if i % 2 == 0 and a[i] % 2 == 1:
ans += 1
print(ans) |
p02607 | s062195416 | Accepted | N = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(0, N, 2):
if a[i] % 2 == 1:
ans += 1
print(ans) |
p02607 | s333699673 | Accepted | def main():
n = int(input())
A = list(map(int, input().split()))
sum = 0
for i in range(n):
if A[i] % 2 == 1 and (i + 1) % 2 == 1:
sum += 1
print(sum)
if __name__ == '__main__':
main()
|
p02607 | s031015207 | Accepted | N = int(input())
input = input().split()
number = []
total = 0
for i in range(N):
number.append(int(input[i]))
if i % 2 == 0:
if number[i] % 2 == 1:
total += 1
print(total)
|
p02607 | s660856495 | Accepted | n = int(input())
a = list(map(int, input().split()))
odd_lst=a[0::2]
count=0
for i in odd_lst:
if i%2 != 0:
count+=1
print(count)
|
p02607 | s767938772 | Accepted | n = int(input())
a = list(map(int, input(). split()))
cn = 0
for i in range(len(a)):
ai = a[i]
nm = i + 1
if nm % 2 == 1 and ai % 2 == 1:
cn += 1
print(cn)
|
p02607 | s262421752 | Accepted | n = int(input())
a = list(map(int, input().split()))
cnt = 0
for i, ai in enumerate(a):
if (i + 1) % 2 == 1 and ai % 2 == 1:
cnt += 1
print(cnt)
|
p02607 | s800749225 | Accepted | N = int(input())
nums = [int(i) for i in input().split()]
cnt = 0
for i, n in enumerate(nums):
if i % 2 == 0 and n % 2 == 1:
cnt += 1
print(cnt)
|
p02607 | s291143481 | Accepted | a = int(input())
n = list(map(int,input().split()))
cnt = 0
ans = 0
for i in n:
cnt = cnt +1
if cnt % 2 == 1 and i % 2 == 1 :
ans = ans + 1
print (ans)
|
p02607 | s195797689 | Accepted | N = int(input())
A = list(map(int, input().split()))
n = 0
for i in range(0, N, 2):
if A[i] % 2 == 1:
n += 1
print(n)
|
p02607 | s068771981 | Accepted | N = int(input())
A = list(map(int, input().split()))
A.insert(0, 0)
ans = 0
for i in range(1, N + 1, 2):
if A[i] % 2 == 1:
ans += 1
print(ans)
|
p02607 | s741608989 | Accepted | # coding:utf-8
import sys
import math
import time
#import numpy as np
import collections
from collections import deque
from collections import Counter
import queue
import copy
import bisect
import heapq
import itertools
sys.setrecursionlimit(10**7)
#N, Q = map(int, input().split())
#G = [list(input()) for i in range(H)]
#INF = V * 10001
#A = [int(i) for i in input().split()]
#AB = [list(map(int, input().split())) for _ in range(K)]
N = int(input())
a = [int(i) for i in input().split()]
ans = 0
for i in range(N):
if((i+1)%2==1):
if(a[i]%2==1):
ans+=1
print(ans)
|
p02607 | s904284794 | Accepted | # import sys
# readline = sys.stdin.readline
# generator = (readline().strip() for _ in range(N))
# N, M = map(int, input().split())
# As = list(map(int, input().split()))
# queries = (input() for _ in range(N))
def solve():
N = int(input())
As = list(map(int, input().split()))
count = 0
for i, a in enumerate(As):
if (i+1) % 2 == 0:
continue
if a % 2 == 0:
continue
count += 1
return count
def main():
print(solve())
if __name__ == "__main__":
main()
|
p02607 | s158870458 | Accepted | import math
import itertools
import collections
import bisect
import heapq
def IN(): return int(input())
def sIN(): return input()
def MAP(): return map(int,input().split())
def LMAP(): return list(map(int,input().split()))
def TATE(n): return [input() for i in range(n)]
MOD = 10**9 + 7
n = IN()
a = LMAP()
c = 0
ans = 0
for i in a:
c += 1
if i%2 == 1 and c%2 ==1:
ans += 1
print(ans) |
p02607 | s146427421 | Accepted | n = int(input())
a = list(map(int,input().split()))
cnt = 0
for i in range(n):
if ((i+1) % 2 == 1) and (a[i] % 2 == 1):
cnt += 1
print(cnt) |
p02607 | s184585458 | Accepted | N = int(input())
n = list(map(int,input().split()))
ans = 0
for i in range(N):
if n[i] % 2 == 1 and (i-1)%2 == 1:
ans += 1
print(ans)
|
p02607 | s299782555 | Accepted | N = int(input())
a = list(map(int,input().split()))
ans = 0
for i in range(N):
if (i+1) % 2 != 0:
if a[i] % 2 != 0:
ans += 1
print(ans) |
p02607 | s048394084 | Accepted | #=input()
n=int(input())
#=map(int,input().split())
#=map(str,input().split())
l=list(map(int,input().split()))
k=l[::2]
j=list(filter(lambda x: x % 2 ==1, k))
print(len(j)) |
p02607 | s397156238 | Accepted | n=int(input())
l=[0]
c=0
l=l+(list(map(int,input().split())))
try:
for i in range(1,n+1,2):
if l[i]&1:
c+=1
except:
pass
print(c) |
p02607 | s881827072 | Accepted | n = int(input())
A = tuple(map(int, input().split()))
ans = 0
for i, a in enumerate(A):
if (i+1)%2 == 1 and a%2==1:
ans += 1
print(ans) |
p02607 | s150995394 | Accepted | N = int(input())
*A, = map(int,input().split())
ans = 0
for i,a in enumerate(A,1):
if i%2==1 and a%2==1: ans += 1
print(ans) |
p02607 | s012582560 | Accepted | input()
ary = list(map(int, input().split()))
odd = 0
cnt = 0
while len(ary) > odd:
if (ary[odd] % 2) != 0:
cnt += 1
odd += 2
print(cnt) |
p02607 | s882830951 | Accepted | N = int(input())
a = list(map(int,input().split()))
ans = 0
for i in range(N):
if i%2 == 0 and a[i]%2 == 1:
ans += 1
print(ans) |
p02607 | s292361739 | Accepted | N = int(input())
A = map(int, input().split())
cnt = 0
for i, a in enumerate(A):
if ((i + 1) * a) % 2:
cnt += 1
print(cnt)
|
p02607 | s524292993 | Accepted | n = int(input())
a = list(map(int, input().split()))
count = 0
for i in range(n):
if (i+1) % 2 == 1 and a[i] % 2 == 1:
count += 1
print(count)
|
p02607 | s885387249 | Accepted | n = int(input())
a = list(map(int, input().split()))
cnt = 0
for num, val in enumerate(a):
if (num + 1) % 2 == 1 and val % 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.