problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p02607 | s036714143 | Wrong Answer | def B():
N = int(input())
A = [int(i) for i in input().split()]
ans = 0
for i in range(1, N, 2):
if A[i]%2 == 1:
ans += 1
print(ans)
B() |
p02607 | s482764998 | Wrong Answer | n = int(input())
A = list(map(int,input().split()))
ans = 0
for i in range(n):
if i %2 == 0:
continue
if A[i] % 2 == 1:
ans += 1
print(ans) |
p02607 | s599389435 | Wrong Answer | n =int(input())
a =list(map(int,input().split()))
#print(a)
cnt = 0
for i in range(n):
#print(i)
if i%2 ==1:
if a[i]%2 ==1:
cnt +=1
print(cnt) |
p02607 | s024762672 | Wrong Answer | n = int(input())
arr = list(map(int,input().split()))
ans = 0
for i in range(n):
if i %2 == 1 and arr[i]%2 == 1:
ans += 1
print(ans) |
p02607 | s496763105 | Wrong Answer | n = int(input())
num_list = list(map(int, input().split()))
cns = 0
for i in range(len(num_list)):
if i % 2 == 1 and num_list[i] % 2 == 1:
cns += 1
print(cns) |
p02607 | s841196324 | Wrong Answer | N = int(input())
a = list(map(int, input().split()))
p = 0
for i in range(0, N):
if i % 2 == 1 and a[i] % 2 == 0:
p = p + 1
else:
p = p
print (p) |
p02607 | s364735268 | Wrong Answer | import sys
input = sys.stdin.readline
#N, K = (int(i) for i in input().split())
#B = [int(x) for x in input().split()]
#A = [[int(i) for i in input().split()] for i in range(N)]
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 | s278150113 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
c=0
for i in range(n):
if i%2==1 and a[i]%2==1: c+=1
print(c) |
p02607 | s557346890 | Wrong Answer | 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 | s937735697 | 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-1]%2==1:
ans+=1
print(ans) |
p02607 | s762037547 | Wrong Answer | N = int(input())
Mylist = input().split()
Mylist = [int(s) for s in Mylist]
ANS = 0
for i in range(N):
if i+1 % 2 == 1 and Mylist[i] % 2 == 1:
ANS += 1
print(ANS) |
p02607 | s740012667 | Wrong Answer | N = int(input())
Ali = list(map(int,input().split()))
r = 0
for i in range(N):
if Ali[i]%2 == 1 and i%2 == 1:
r += 1
print(r) |
p02607 | s116731658 | 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==1 and item%2==1:
c+=1
print(c)
exit() |
p02607 | s613508374 | Wrong Answer | N = int(input())
a_list = list(map(int, input().split()))
count = 0
for i in range(N):
if i%2==1 and a_list[i]%2==1:
count = count + 1
print(count) |
p02607 | s823814774 | Wrong Answer | n=int(input())
A=list(map(int,input().split()))
cnt=0
for i in range(n):
if A[i]%2!=i%2:
cnt+=1
print(cnt) |
p02607 | s958755483 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
cnt = 0
for i in range(n, 1):
if i%2 != 0:
cnt += 1
print(cnt) |
p02607 | s553128778 | Wrong Answer | N = int(input())
A_i = input().split(" ")
count=0
for i in range(N):
if i%2!=0 and int(A_i[i])%2!=0:
count=count+1
print(count) |
p02607 | s145594113 | Wrong Answer | import sys
input = sys.stdin.readline
def read():
N = int(input().strip())
A = list(map(int, input().strip().split()))
return N, A
def solve(N, A):
ans = 0
for i in range(N):
if i % 2 == 1 and A[i] % 2 == 1:
ans += 1
return ans
if __name__ == '__main__':
inputs = read()
outputs = solve(*inputs)
if outputs is not None:
print("%s" % str(outputs))
|
p02607 | s372137362 | Wrong Answer | n=int(input())
A=[int(i) for i in input().split()]
ans=0
for i,a in enumerate(A):
if i%2==1 and a%2==1:
ans+=1
print(ans) |
p02607 | s756133365 | Wrong Answer | import sys
sys.setrecursionlimit(10**6)
def main(input, print):
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)
if __name__ == '__main__':
main(sys.stdin.readline, print)
|
p02607 | s705488986 | Wrong Answer | N=int(input())
a = list(map(int,input().split()))
b=int(0)
for i in range(N):
if i%2==1 and a[i]%2==1:
b=b+1
print(b) |
p02607 | s260059073 | Wrong Answer | N = int(input())
a = []
a = input().split()
count = 0
for i in range(int(N/2)):
cd = 2 * i
jd = int(a[cd])
if jd % 2 == 1:
count += 1
print(count) |
p02607 | s821569905 | Wrong Answer | n=int(input())
l=[0]
c=0
l.append(map(int,input().split()))
try:
for i in range(1,n+1,2):
if l[i]&1:
c+=1
except:
pass
print(c)
|
p02607 | s130491590 | Wrong Answer | import sys
sys.setrecursionlimit(10**9)
def mi(): return map(int,input().split())
def ii(): return int(input())
def isp(): return input().split()
def deb(text): print("-------\n{}\n-------".format(text))
INF=10**20
def main():
N=ii()
A=list(mi())
ans = 0
for i in range(N):
a = A[i]
if i % 2 == 1 and a % 2 == 1:
ans += 1
print(ans)
if __name__ == "__main__":
main() |
p02607 | s733539809 | Wrong Answer | N = int(input())
a = [int(e) for e in input().split()]
ans = 0
time = 0
for i in range(N):
if time%2 == 0:
if a[i]%2 == 1:
ans += 1
time += 1
else:
time += 1
print(ans) |
p02607 | s393236549 | Wrong Answer | #import numpy as np
#import math
#from decimal import *
#from numba import njit
#@njit
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)
main()
|
p02607 | s428944378 | Wrong Answer | n = int(input())
l = list(map(int,input().split()))
m = []
for i in range(n):
if i%2==0 and l[i]%2!=0:
m.append(l[i])
print(m) |
p02607 | s826365361 | Wrong Answer | N = int(input())
lst = list(map(int, input().split()))
unko = 0
for i in range(len(lst)):
if i % 2 == 1 and lst[i] % 2 == 1:
unko += 1
print(unko) |
p02607 | s313636805 | Wrong Answer | #!/usr/bin/env python
"""エイシング プログラミング コンテスト 2020: B - An Odd Problem
https://atcoder.jp/contests/aising2020/tasks/aising2020_b
"""
def main():
N = int(input())
As = list(map(int, input().split()))
ans = 0
for i in range(N):
if i % 2 != 0 and As[i] % 2 != 0:
ans += 1
print('{}'.format(ans))
if __name__ == '__main__':
main()
|
p02607 | s268677661 | Wrong Answer | N = int(input())
a = list(map(int,input().split()))
count=0
for i in range(N):
if(i%2==1):
if(a[i]%2==1):
count+=1
print(count) |
p02607 | s176736703 | Wrong Answer | N=int(input())
a=list(map(int,input().split()))
count=0
for i in range(N):
if(i%2==1):
if(a[i]%2==1):
count+=1
print(count) |
p02607 | s788712094 | Wrong Answer | N, *A = map(int, open(0).read().split())
cnt = 0
for i in range(1, N, 2):
if A[i] > 0 and A[i] % 2 == 1:
cnt += 1
print(cnt)
|
p02607 | s443415544 | 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 | s373283012 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(n)[::2]:
if a[i]%2 != 1:
ans += 1
print(ans) |
p02607 | s812918169 | Wrong Answer | import sys
readline = sys.stdin.readline
def solve():
N = int(readline())
A = list(map(int, readline().split()))
ans = 0
for i, a in enumerate(A):
if i % 2 == 1 and a % 2 == 1:
ans += 1
print(ans)
solve() |
p02607 | s506101046 | Wrong Answer | a=int(input())
b=list(map(int,input().split()))
ans=0
for i in range(a):
if i%2==1 and b[i]%2==1:
ans+=1
print(ans) |
p02607 | s544163622 | 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 | s362496637 | Wrong Answer | import sys
def input(): return sys.stdin.readline().strip()
def I(): return int(input())
def LI(): return list(map(int, input().split()))
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def S(): return input()
def LS(): return input().split()
INF = float('inf')
n = I()
a = LI()
ans = 0
for i, elem in enumerate(a):
if i % 2 != 0 and elem % 2 != 0:
ans += 1
print(ans)
|
p02607 | s262989934 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
a = list(filter(lambda x: x % 2 == 1, a[1::2]))
print(len(a)) |
p02607 | s248757518 | Wrong Answer | def main():
N = int(input())
A = [int(x) for x in input().split()]
cnt = 0
for i in range(N):
if i % 2 == 1 and A[i] % 2 == 1:
cnt += 1
print(cnt)
if __name__ == '__main__':
main() |
p02607 | s280853325 | 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 | s472120498 | 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+1)%2!=0 and a_L[i] !=0:
ans += 1
print(ans) |
p02607 | s102903307 | Wrong Answer | 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):
if i % 2 != 0 and a % 2 != 0:
ans += 1
print(ans)
def main():
N = LI()
A = LI()
solver(N,A)
if __name__ == '__main__':
main()
|
p02607 | s526954152 | Wrong Answer | N=int(input())
count=0
A=list(map(int,input().split()))
for i in range(N):
if i%2==1 and A[i]%2==1:
count+=1
print(count) |
p02607 | s906831745 | 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 | s625048164 | Wrong Answer | N=int(input())
#N=15
input=input()
#input="13 76 46 15 50 98 93 77 31 43 84 90 6 24 14"
masu=[int(r) for r in input.split()]
ans=[]
for i in range(N):
if masu[i]%2==1 and i%2==1:
ans.append(i)
print(len(ans))
|
p02607 | s953063204 | Wrong Answer | n = int(input())
cnt = 0
arr = [int(x) for x in input().split()]
for i in range(0, len(arr), 2):
if arr[i] % 2 == 0:
cnt += 1
print(cnt)
|
p02607 | s389146191 | Wrong Answer | # -*- coding: utf-8 -*-
N = int(input())
A = list(map(int, input().split()))
counter = 0
for i in range(N):
if i % 2 == 1 and A[i] % 2 == 1:
counter += 1
print(counter)
|
p02607 | s562440423 | Wrong Answer | def main():
N= int(input())
a = list(map(int,input().split()))
cnt = 0
for i in range(1,N,2):
if a[i] % 2 == 1:
cnt += 1
print(cnt)
if __name__ == '__main__':
main() |
p02607 | s058498458 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
output = 0
for i in range(n):
if (i+1 % 2 == 1) and (a[i] % 2 == 1):
output = output + 1
print(output) |
p02607 | s167552060 | Wrong Answer | n = int(input())
a = [int(s) for s in input().split()]
ans = 0
for i in range(len(a)):
if a[i] % 2 == 0 and i % 2 == 1:
ans += 1
print(ans)
print(ans) |
p02607 | s284775390 | 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 | s460078960 | Wrong Answer | N = int(input())
A = list(map(int,input().split()))
ans = 0
for i in range(N):
if A[i]%2 == 1 and (i+1)%2 == 0:
ans += 1
print(ans) |
p02607 | s741592144 | Wrong Answer | N = int(input())
a = list(map(int, input().split()))
cnt = 0
for i in range(N):
if i % 2 == 1:
if a[i] % 2 == 1:
print(a[i])
cnt +=1
print(cnt) |
p02607 | s120249508 | Wrong Answer | N = int(input())
a = list(map(int,input().split()))
count = 0
for i,j in enumerate(a):
if((i%2==1) and (j%2==1) ):
count +=1
print(count) |
p02607 | s840452218 | Wrong Answer | N=int(input())
a = list(map(int,input().split()))
b=int(0)
for i in range(N):
if i%2==1 and a[i]%2==1:
b=b+1
print(b) |
p02607 | s121259700 | Wrong Answer | n= int(input())
a=list(map(int,input().split()))
cnt=0
for i, A in enumerate(a):
if i%2==1 and A%2==1:
cnt+=1
print(cnt) |
p02607 | s255759654 | 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 | s465740699 | Wrong Answer | num_of_squares=int(input())
written_values=[i for i in input().split(" ")]
flag=0
for i in range (num_of_squares):
if (i%2!=0) & (int(written_values[i])%2!=0):
flag+=1
print(flag) |
p02607 | s886646076 | Wrong Answer | i = int(input())
count = 0
num = tuple(map(int, input().split()))
for i in range (0, len(num)):
if num[i] % 2 != 0 and i % 2 != 0:
count +=1
print(count) |
p02607 | s379608157 | 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 | s244962027 | Wrong Answer | N = int(input())
As = map(lambda x: int(x), input().split(" "))
result = 0
for i, a in enumerate(As):
index = i+1
if a % 2 == 1 and i % 2 == 1:
result += 1
print(result) |
p02607 | s072725658 | Wrong Answer | N = int(input())
a = list(map(int,input().split()))
ans = 0
odd = a[1::2]
for i in odd:
if i%2 == 1:
ans += 1
print(ans)
|
p02607 | s812372118 | Wrong Answer | N = int(input())
a = list(map(int, input().split()))
cnt = 0
for i in range (N):
if i % 2 != 0:
if a[i] %2 != 0:
cnt += 1
print(cnt) |
p02607 | s042690063 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
count=0
for i in range(n):
if i%2!=0:
if a[i]%2!=0:
count+=1
print(count) |
p02607 | s720864444 | Wrong Answer | lst=list(map(int,input().split()))
cnt=0
for i,j in enumerate(lst,1):
if i%2!=0 and j%2!=0:
cnt+=1
print(cnt) |
p02607 | s301906433 | Wrong Answer | N = int(input())
n = list(map(int,input().split()))
ans = 0
for i in range(N):
if i % 2 == 0 and (i+1)%2 == 0:
ans += 1
print(ans) |
p02607 | s097761596 | 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 | s656118958 | Wrong Answer | N=int(input())
a = list(map(int,input().split()))
b=int(0)
for i in range(N):
if i%2==1 and a[i]%2==1:
b=b+1
print(b) |
p02607 | s415823118 | 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(count) |
p02607 | s753149103 | Wrong Answer | import numpy as np
def main(N, a):
ans = 0
for i in range(N):
if i % 2 == 1 and a[i] % 2 == 1:
ans += 1
return ans
N = int(input())
a = list(map(int, input().split()))
print(main(N, a))
|
p02607 | s022480637 | 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 | s243537896 | Wrong Answer | N = int(input())
res=[0 for _ in range(10050)]
for x in range(1,45):
for y in range(1,45):
for z in range(1,45):
k=x*x+y*y+z*z+x*y+y*z+z*x
if k<10050:
res[k]+=1
for i in range(N):
print(res[i+1])
|
p02607 | s841359894 | 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 a.index(val) % 2 != 0 and val % 2 != 0:
ans = ans + 1
print(ans) |
p02607 | s032702497 | Wrong Answer | a = list(map(int,input().split()))
s = 0
for i in range(len(a))[::2]:
if(a[i]%2==1):
s = s + 1
print(s) |
p02607 | s682108932 | Wrong Answer | n=int(input())
count=0
a=list(map(int,input().split()))
for i in range(len(a)-1):
if a[i-1]%2!=0 and i%2!=0:
count+=1
print(count) |
p02607 | s972785772 | Wrong Answer | N = int(input())
a = list(map(int, input().split()))
#a = [list(map(int, list(input()))) for i in range(N + 1)]
# L, R, d = map(int, input().split())
cnt = 0
for i in range(0, N, 2):
print(i)
if a[i] % 2 != 0:
cnt += 1
print(cnt)
|
p02607 | s907794672 | 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 | s274214642 | Wrong Answer | #import numpy as np
#import functools
#import operator
#from itertools import combinations as comb
#from itertools import combinations_with_replacement as comb_with
#from itertools import permutations as perm
#import collections as C #most_common
#import math
#import sympy
N = int(input())
#N,K,d= map(int,input().split())
A = list(map(int,input().split()))
#S = str(input())
#T = str(input())
c=0
for i in range(N):
if i%2!=0 and A[i]%2!=0:
c+=1
print(c)
|
p02607 | s013805936 | Wrong Answer | N = int(input())
a = list(map(int, input().split()))
b = a[1::2]
ans = 0
for i in range(len(b)):
if b[i]%2 == 1:
ans += 1
print(ans) |
p02607 | s001342840 | Wrong Answer | 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(i)
print(cnt)
|
p02607 | s344341174 | Wrong Answer | N = int(input())
list = list(map(int, input().split()))
cnt = 0
for i in range(N):
if i %2 == 1 and list[i] %2 == 1:
cnt += 1
print(cnt) |
p02607 | s615405991 | Wrong Answer | a=int(input())
li = list(map(int, input().split()))
count=0
for i in range(a):
if((i%2==1) and (li[i]%2==1)):
count+=1
print(count) |
p02607 | s486054813 | Wrong Answer | N = int(input())
ar = list(map(int, input().split()))
cnt = 0
for i in range(N):
if i % 2 == 0:
continue
if ar[i] % 2 == 1:
cnt += 1
print(cnt)
|
p02607 | s341998169 | Wrong Answer | N = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(len(a)):
if a[i]%2 ==1 and i%2==1 :
ans +=1
else:
continue
print(ans) |
p02607 | s103859538 | Wrong Answer | n=int(input())
a=list(map(int,input().strip().split()))[:n]
counter=0
for i in range (1,n,2):
if(a[i]%2==1):
counter+=1
print(counter) |
p02607 | s922827796 | 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 | s691355292 | Wrong Answer | input()
li = list(map(int, input().split()))
result = 0
for i in range(len(li)):
if i + 1 % 2 == 1:
if li[i] % 2 == 1:
result += 1
print(result)
|
p02607 | s620971359 | Wrong Answer | N = int(input())
A = map(int, input().split())
print(sum((i + 1 * a) % 2 for i, a in enumerate(A))) |
p02607 | s538912080 | Wrong Answer | n = int(input())
a = list(map(int , input().split()))
ans = 0
for i in range(n):
if a[i] % 2 == 1 and i % 2 == 1:
ans += 1
print(ans) |
p02607 | s206341667 | Wrong Answer | N = int(input())
masu = [int(i) for i in input().split(' ')]
count = 0
for i in range(len(masu)):
if (i+1)%2 == 0 and masu[i]%2 == 1:
count += 1
print(count) |
p02607 | s455782612 | 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 | s262418561 | 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 | s518322718 | Wrong Answer | def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
n = ii()
A = iil()
cnt = 0
for i,item in enumerate(A):
if i%2==1 and item%2==1:
cnt+=1
print(cnt) |
p02607 | s653189625 | Wrong Answer | N = int(input())
a = list(map(int, input().split()))
ans = 0
for i, name in enumerate(a):
if i % 2 == 1 and name % 2 == 1:
ans += 1
print(ans) |
p02607 | s881844246 | 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 | s548086106 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(len(a)):
if a[i]%2 != 0 and i%2 != 0: ans+=1
print(ans) |
p02607 | s274985915 | Wrong Answer | N = int(input())
a = [int(x) for x in input().split()]
count = 0
for x in range(N):
if (x % 2 == 1) and (a[x] % 2 == 1):
count += 1
print(count) |
p02607 | s869165047 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
c = 0
for i in range(len(a)):
if i % 2 == 1:
if a[i] % 2 == 1:
c += 1
print(c) |
p02607 | s560107564 | Wrong Answer | n = int(input())
As = list(map(int, input().split()))
ans = 0
for i in range(n):
if i%2 == 1 and As[i]%2 == 1:
ans += 1
print(ans)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.