problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p02607 | s958083281 | Wrong Answer | j = int(input())
i = list(map(int, input().split()))
#print(i,j)
cnt = 0
for n in range(j):
if n % 2 == 1:
#print(n)
if i[n] % 2 ==1:
cnt += 1
print(cnt) |
p02607 | s026915592 | Wrong Answer | N = int (input())
a=[]
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 | s153399066 | Wrong Answer | N = int(input())
a_ls=list(map(int, input().split()))
ans=0
for i in range(N):
if i%2==1 and a_ls[i]%2==1:
ans+=1
print(ans)
# 2darray [[0] * 4 for i in range(3)] |
p02607 | s554320876 | Wrong Answer | input()
a = list(map(int, input().split()))
b = 0
for i, n in enumerate(a):
if i % 2 == 0 or n % 2 == 0:
continue
b += 1
print(b) |
p02607 | s973557984 | Wrong Answer | n = int(input())
l = list(map(int, input().split()))
l1 = l[1::2]
cnt = 0
for i in l1:
if i % 2 == 1:
cnt += 1
print(cnt) |
p02607 | s901052769 | Wrong Answer | N=int(input())
li = list(map(int,input().split()))
coun=0
for i,h in enumerate(li):
if i % 2 == 1 and h % 2 == 1:
coun+=1
print(coun) |
p02607 | s672010651 | 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 | s044219277 | Wrong Answer | N=int(input())
a=input().split()
cnt=0
for i in range(N):
if i%2==1 and int(a[i])%2==1: cnt+=1
print(cnt)
|
p02607 | s399134744 | Wrong Answer | N = int(input())
a = list(map(int, input().split()))
cnt =0
for i in a[1::2]:
if not i % 2 == 0:
cnt = cnt +1
print(cnt)
|
p02607 | s639303848 | Wrong Answer | N = int(input())
A = list(map(int,input().split()))
ans = 0
for n in range(N):
if n%2==1 and A[n]%2==1:
ans+=1
print(ans) |
p02607 | s735692313 | Wrong Answer | N = int(input())
A = [int(x) for x in input().split()]
ans = 0
for i in range(1, N, 2):
if A[i]%2 == 1:
ans += 1
print(ans)
|
p02607 | s106339965 | Wrong Answer | n = int(input())
lst = list(map(int, input().split()))
ans = 0
for i in range(n):
if i%2 == 1 and lst[i]%2 == 1:
ans += 1
print(ans)
|
p02607 | s858420947 | 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 | s777876034 | Wrong Answer | N = int(input())
a = [int(x) for x in input().split()]
c = 0
for i in range(N):
if i % 2 == 1 and a[i] % 2 ==1:
c += 1
print(c) |
p02607 | s536498528 | Wrong Answer | n = int(input())
a = list(map(int, input().split(" ")))
c = 0
for i in range(len(a)):
if a[i] % 2 == 1 and i % 2 == 1:
c += 1
print(c) |
p02607 | s851531646 | Wrong Answer | N=int(input())
table=list(map(int,input().split()))
num=0
for i in range(N):
if i%2==1 and (table[i])%2==1:
num+=1
print(num)
|
p02607 | s828406928 | 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 | s744602109 | Wrong Answer | N = int(input())
s = list(map(int, input().split()))
count = 0
for i in range(N):
if ((i+1)%2 == 1) and (s[i]%2 == 1):
count = count + 1
if (N%2 == 1) and (s[N-1]%2 == 1):
count = count + 1
print(count) |
p02607 | s281014887 | Wrong Answer | if __name__ == "__main__":
n = int(input())
a = list(map(int, input().split()))
ans = 0
for i, num in enumerate(a):
if (i+1)%2 == 1: continue
if num%2 ==1: ans += 1
print(ans) |
p02607 | s572727088 | Wrong Answer | n = int(input())
count = 0
arr = [int(i) for i in input().split()]
for i in range(n):
if i % 2 == 1 and arr[i] % 2 == 1:
count += 1
print(count)
|
p02607 | s939736949 | Wrong Answer | import sys
input = sys.stdin.readline
n = int(input())
a = list(map(int, input().split()))
a = [a[i] for i in range(n) if i%2==1 and a[i]%2==1]
print(len(a)) |
p02607 | s303765473 | 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 | s513977162 | Wrong Answer | n = int(input())
l = list(map(int,input().split()))
ans = 0
for i in range(n):
if i%2 == 1 and l[i]%2 == 1:
ans += 1
print(ans) |
p02607 | s111593176 | Wrong Answer | n=int(input())
arr=list(map(int,input().split()))
cnt=0
for i in range(n):
if i%2==1 and arr[i]%2==1:
cnt+=1
print(cnt) |
p02607 | s595669438 | 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 | s120929304 | Wrong Answer | #!/usr/bin/env python
# -*- coding: utf-8 -*-
def main():
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)
if __name__ == "__main__":
main()
|
p02607 | s813574591 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
count = 0
for i, a in enumerate(A):
if i % 2 == 1 and a % 2 == 1:
count += 1
print(count) |
p02607 | s984958855 | 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 | s725338674 | Wrong Answer | import sys
sys.setrecursionlimit(10 ** 7)
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
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 | s944610832 | Wrong Answer | N = int(input())
A = [int(i) for i in input().split()]
#%%
cnt = 0
for i, j in enumerate(A):
if i % 2 == 1 and j % 2 == 1:
cnt += 1
print(cnt)
|
p02607 | s875405478 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
s = 0
for i in range(1,n,2):
if a[i] % 2 == 1:
s = s + 1
print(s)
|
p02607 | s431384597 | Wrong Answer | n = int(input())
aas = list(map(int, input().split()))
res = 0
for i in range(n):
if i%2!=0 and aas[i]%2!=0:
res += 1
print(res) |
p02607 | s201972608 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
count=0
for i in range(n):
if a[i]%2!=0 and i%2!=0:
count+=1
print(count) |
p02607 | s452199196 | Wrong Answer | N, *X = map(int, open(0).read().split())
ans = 0
for i in range(N):
if i % 2 == 1 and X[i] % 2 == 1:
ans += 1
print(ans) |
p02607 | s984021347 | Wrong Answer | N = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(1, N+1):
print(i)
if (i%2 == 1) and (a[i-1]%2 == 1):
ans += 1
print(ans)
|
p02607 | s748098572 | Wrong Answer | N = int(input())
a = [int(x) for x in input().split()]
C=0
for i in range(N):
if i%2!=0:
if a[i]%2!=0:
C+=1
print(C) |
p02607 | s530046500 | Wrong Answer | N=int(input())
a=[0]*N
a=list(map(int,input().split()))
ans=0
for i in range(1,N,2):
if(a[i]%2==1):
ans=ans+1
print(ans)
|
p02607 | s941185108 | Wrong Answer | X = int(input())
A = list(map(int, input().split()))
ans=0
for i in range(0,X,2):
if A[i]%2!=0:
ans+=1
for i in range(1,X,2):
if A[i]%2==0:
ans+=1
print(ans)
|
p02607 | s253541297 | Wrong Answer | n = int(input())
A = list(map(int, input().split()))
ans = 0
for i in A:
if i % 2 == 1 and A.index(i) % 2 == 0:
ans += 1
print(ans) |
p02607 | s354463949 | Wrong Answer | print(sum([int(i)%2 for i in input().split()[1::2]])) |
p02607 | s905240277 | Wrong Answer | n=int(input())
l=list(map(int, input().split()))
#print(l)
count = 0
for i in range(1,n,2):
if l[i-1]%2 == 1:
count += 1
print(count) |
p02607 | s877140457 | Wrong Answer | def main():
N = int(input())
numlist = list(map(int,input().split()))
count = 0
for i in range(len(numlist)):
if i % 2 == 1:
if numlist[i] % 2 == 1:
count += 1
print(count)
if __name__ == '__main__':
main()
|
p02607 | s759663322 | Wrong Answer | n = int(input())
alist = list(map(int, input().split()))
ans = 0
for aindex, a in enumerate(alist):
if aindex % 2 != 0 and a % 2 != 0:
ans += 1
print(ans) |
p02607 | s202623475 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
ans = 0
for i,ai in enumerate(a):
if i%2 == 1 and ai%2 == 1:
ans += 1
print(ans) |
p02607 | s016086844 | Wrong Answer | intArrLength = int(input())
intArr = list(map(int, input().split()))
oddCounter = 0
for i in range(intArrLength):
if i % 2 != 0 and intArr[i] % 2 != 0:
oddCounter += 1
print(oddCounter)
|
p02607 | s502824494 | 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 | s655006767 | Wrong Answer | # -*- coding: utf-8 -*-
N = input()
del N
I1 = input().split()
i = 0
for a in range(len(I1)):
if int(I1[a]) * a % 2 == 1:
i += 1
print(i) |
p02607 | s667599308 | 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 | s706960946 | Wrong Answer | n = int(input())
lis = list(map(int,input().split()))
cnt=0
n=0
for i in lis:
if (i)%2 != 0 and n%2 != 0:
cnt += 1
n += 1
print(n)
print(cnt) |
p02607 | s459702393 | Wrong Answer | n = int(input())
a = list(input().split())
a = [int(a[i]) for i in range(n)]
ans = 0
for j in range(n):
if j%2 == 1 and a[j]%2 == 1:
ans = ans + 1
print(ans) |
p02607 | s509967346 | Wrong Answer | n= int(input())
a_s= list(map(int, input().split(' ')))
count=0
for i in range(len(a_s)):
if i%2==1:
if a_s[i]%2==1:
count+=1
print(count) |
p02607 | s830198123 | 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 += 1
print(count) |
p02607 | s470244541 | Wrong Answer | inpl = lambda: list(map(int,input().split()))
N = int(input())
A = inpl()
print(sum(A[i]%2 for i in range(1,N,2)))
|
p02607 | s777865712 | Wrong Answer | n, *a = map(int, open(0).read().split())
ans = 0
for i in range(n):
if i%2 and a[i]%2:
ans += 1
print(ans) |
p02607 | s554072572 | Wrong Answer | N = int(input())
a = list(map(int, input().split()))
count = 0
for i in range(N):
if ((a[i] % 2 == 1) and i % 2 == 1):
count += 1
print(count) |
p02607 | s762294489 | 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 | s830483684 | Wrong Answer | def main():
N = int(input())
A = list(map(int, input().split()))
ans = 0
for i, a in enumerate(A):
if i % 2 == a % 2 == 1:
ans += 1
print(ans)
if __name__ == "__main__":
main()
|
p02607 | s567031009 | Wrong Answer | N = int(input())
l = list(map(int,input().split()))
c = 0
for i in range(N):
if i % 2 == 1 and l[i] % 2 == 1:
c += 1
print(c) |
p02607 | s299425343 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
count=0
for i in range(N):
if A[i] %2 ==1 & i %2 ==1:
count +=1
print(count)
|
p02607 | s178944801 | Wrong Answer | n=int(input())
a=[int(i) for i in input().split()]
ans=0
for i in range(n):
if(a[i]%2==1 and i%2==1):
ans+=1
print(ans) |
p02607 | s044361288 | 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 | s468207246 | Wrong Answer | from collections import Counter,defaultdict,deque
from heapq import heappop,heappush
from bisect import bisect_left,bisect_right
import sys,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
n = inp()
a = inpl()
res = 0
for i,x in enumerate(a):
if i%2 and x%2:
res += 1
print(res) |
p02607 | s244497207 | Wrong Answer | n=int(input())
count=0
a=list(map(int,input().split()))
for i in range(len(a)-1):
if a[i]%2!=0 and i%2!=0:
count+=1
print(count) |
p02607 | s205550646 | Wrong Answer | n = int(input())
a = [1 for i in list(map(int, input().split()))[1::2] if i % 2 == 1]
print(len(a)) |
p02607 | s086035817 | Wrong Answer | # B
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 | s143862452 | Wrong Answer | n=int(input())
count=0
a=list(map(int,input().split()))
for i in range(len(a)):
if a[i]%2!=0 and i%2!=0:
count+=1
print(count) |
p02607 | s051120623 | Wrong Answer | import math
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 | s032826072 | 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 | s446151292 | 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 | s269358072 | Wrong Answer | #B
N = int(input())
a = list(map(int, input().split()))
count = 0
for i, v in enumerate(a):
if i % 2 != 0:
if v % 2 != 0:
count += 1
print(count) |
p02607 | s802765221 | Wrong Answer | n = int(input())
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 | s325246560 | Wrong Answer | 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)
|
p02607 | s771516673 | 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%22==0:
N += 1
print(len(new_a)-N) |
p02607 | s442241782 | Wrong Answer | n=int(input())
l=list(map(int, input().split()))
#print(l)
count = 0
for i in range(1,n,2):
if l[i]%2 == 1:
count += 1
print(count) |
p02607 | s301926298 | Wrong Answer | N = int(input())
a=list(map(int,input().split()))
cnt=0
for i in range((N+1)//2):
print(i)
if a[2*i] % 2 == 1:
cnt += 1
print(cnt) |
p02607 | s907609214 | Wrong Answer | N = int(input())
A = list(map(int,input().split()))
ans = 0
for n in range(N):
if n%2==1 and A[n]%2==1:
ans+=1
print(ans) |
p02607 | s205482494 | Wrong Answer | N = int(input())
a = list(map(int, input().split()))
ans = sum(1 for i, j in enumerate(a) if i % 2 == 1 and j % 2 == 1)
print(ans)
|
p02607 | s925564127 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
odd = a[1::2]
ans = 0
for i in range(len(odd)):
if odd[i]%2 == 1:
ans = ans + 1
print(ans) |
p02607 | s596654610 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(len(a)):
if ((i % 2) == 0):
continue
if ((a[i] % 2) != 0):
ans += 1
print(ans)
|
p02607 | s997050487 | Wrong Answer | N=int(input())
A=list(map(int,input().strip().split()))
c=0
for i in range(1,N):
if (i+1)%2!=0 and A[i]%2!=0:
c+=1
print(c) |
p02607 | s429429483 | Wrong Answer | N = int(input())
a = [int(i) for i in input().split()]
ans = 0
for i in range(1,N):
if i%2 == 1 and a[i]%2 == 1:
ans += 1
print(ans) |
p02607 | s121332741 | 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 | s684753712 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
count = 0
for i,num in enumerate(a):
if i%2==1 and num%2==1:
count+=1
print(count)
|
p02607 | s921607186 | Wrong Answer | # -*- coding: utf-8 -*-
import math
N = int(input())
# print(N)
ai = input().split(' ')
# print(ai)
num = 0
for i in range(math.floor(N/2)):
if int(ai[i*2]) % 2 == 1:
num += 1
print(num) |
p02607 | s601434819 | 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 | s574221972 | Wrong Answer | input()
a = list(map(int, input().split()))
sum([ai % 2 for ai in a[::2]]) |
p02607 | s984176817 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
co=0
for i in range(n):
if i%2==0 and a[i]%2==1:
co+=1
print(n) |
p02607 | s804525046 | Wrong Answer | N = int(input())
a = list(map(int, input().split()))
C = 0
for i in range(1, len(a), 2):
if a[i] % 2 == 1:
C += 1
print(C) |
p02607 | s546911158 | Wrong Answer | import itertools
import decimal
import math
import collections
import sys
#input = sys.stdin.readline
import copy
# S=(input())
# N=int(input())
# N,K=map(int,input().split())
# ListA=list(map(int,input().split()))
# ListA.sort()#reverse=True)
def resolve():
N=int(input())
ListA=list(map(int,input().split()))
cnt=0
for i in range(N):
if(i%2==1 and ListA[i]%2==1):
cnt+=1
print(cnt)
resolve() |
p02607 | s988626521 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
ans = 0
for i in range(N):
if A[i] %2 == 1:
if i %2 == 1:
ans += 1
print(ans) |
p02607 | s863206089 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
ans = 0
for i in range(N):
if (i*A[i]) % 2 == 1:
ans += 1
print(ans)
|
p02607 | s558636253 | Wrong Answer | def main():
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)
return
if __name__ == "__main__":
main() |
p02607 | s286722438 | Wrong Answer | #!/usr/bin/env python3
def main():
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)
if __name__ == "__main__":
main()
|
p02607 | s959385600 | Wrong Answer | def main():
n = int(input())
a = tuple([int(t)for t in input().split()])
ans = 0
for i in range(n):
if i%2==1 and a[i] %2 == 1:
ans+=1
print(ans)
if __name__ == "__main__":
main() |
p02607 | s580249648 | 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 | s395834245 | Wrong Answer | N=int(input())
A=list(map(int,input().split()))
ans=0
for a_idx ,a in enumerate(A):
if a_idx%2 !=0 and a%2 !=0:
ans+=1
print(ans)
|
p02607 | s451962778 | Wrong Answer | N = int(input())
list = list(map(int, input().split()))
cnt = 0
li = []
for count, i in enumerate(list):
if count %2 ==1:
li.append(i)
for j in range(len(li)):
if li[j] %2 ==1:
cnt +=1
print(cnt)
|
p02607 | s085762748 | Wrong Answer | n,*a=map(int,open(0).read().split())
print(len([x for x in a if (x%2!=0 and (a.index(x)+1)%2!=0)])) |
p02607 | s205034634 | Wrong Answer | input()
A = [a for i, a in enumerate(input().split()) if 1 & i & int(a) == 1]
print(len(A))
|
p02607 | s587151522 | Wrong Answer | N=int(input())
a=list(map(int,input().split()))
b=[a[i] for i in range(1,N,2)]
c=0
for i in b:
if i%2==1:
c+=1
print(c) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.