problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p02607 | s819302456 | Wrong Answer | N = int(input())
a = []
a = input().split()
count = 0
for i in range(int(N/2)):
cd = 2 * i - 2
jd = int(a[cd])
if jd % 2 == 1:
count += 1
print(count) |
p02607 | s140376300 | Wrong Answer | N = int(input())
a = list(map(int,input().split()))
cnt = 0
for i in range(N - 1):
if (i + 1) % 2 == 1 and a[i + 1] % 2 ==1:
cnt += 1
else:
cnt += 0
print(str(cnt)) |
p02607 | s629823859 | 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!=0):
counter+=1
print(counter) |
p02607 | s031618758 | Wrong Answer | import sys
input = lambda: sys.stdin.readline().rstrip()
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 | s641349785 | 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) != 0):
ans += 1
print(ans)
|
p02607 | s423965399 | Wrong Answer | N = int(input())
an = map(int, input().split(" "))
ans = 0
for i, ai in enumerate(an):
if i % 2 == 1 and ai % 2 == 1:
ans += 1
print(ans) |
p02607 | s188781685 | Wrong Answer | n = int(input())
masu = list(map(int, input().split()))
count = 0
for N in range(n):
if (N*masu[N])%2 == 1:
count += 1
print(count) |
p02607 | s261201799 | Wrong Answer | n = input()
num = list(map(int,input().split()))
print(num)
# mul = int(input().split())
cnt = 0
for i in range(len(num)):
if(i % 2 != 0 and num[i] %2 != 0):
cnt += 1
print(cnt) |
p02607 | s518250751 | Wrong Answer | N=int(input())
a=[int(i) for i in input().split(" ")]
retval=0
for i,ai in enumerate(a):
if i%2==0:
continue
if ai%2==1:
retval+=1
print(retval)
|
p02607 | s186433547 | Wrong Answer | n=int(input())
As = list(map(int,input().split()))
print(As)
c=0
ans = 0
for a in As:
c+=1
if c%2 == 0:
if a%2 == 1:
ans+=1
print(ans)
|
p02607 | s446205824 | Wrong Answer | N = int(input())
input_line = list(map(int, input().split(' ')))
ans = 0
for i in range(N):
if((i*input_line[i])%2 == 1):
ans += 1
print(ans)
|
p02607 | s806993406 | Wrong Answer | N = int (input())
a=[]
a = list(map(int, input().split()))
count=0
for i in range(0,N):
if i%2==1 and a[i]%2==1:
count+=1
print(count) |
p02607 | s104058757 | Wrong Answer | n = int(input())
num = list(map(int,input().split()))
# print(type(num[0]))
cnt = 0
for i in range(2,n+1,2):
if(abs(num[i-1]) % 2 != 0):
cnt += 1
print(cnt) |
p02607 | s114734668 | Wrong Answer | N=int(input())
a=[0]*N
a=list(map(int,input().split()))
ans=0
for i in range(1,N+5,2):
if(N-1<i):
break
if(a[i]%2==1):
ans=ans+1
print(ans)
|
p02607 | s362810236 | Wrong Answer | num=input()
masu=list(map(lambda x:int(x),input().split()))
masu=[i for i in masu if i%2!=0 and (masu.index(i)+1)%2!=0]
print(len(masu)) |
p02607 | s971038014 | 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 == 0:
continue
ans += 1
print(ans)
|
p02607 | s528472895 | Wrong Answer | # coding: utf-8
import sys
#from operator import itemgetter
sysread = sys.stdin.buffer.readline
read = sys.stdin.buffer.read
#from heapq import heappop, heappush
#from collections import defaultdict
sys.setrecursionlimit(10**7)
#import math
#from itertools import product, accumulate, combinations, product
#import bisect# lower_bound etc
#import numpy as np
#from copy import deepcopy
#from collections import deque
def run():
N, *A = map(int, read().split())
ans = 0
for i in range(1, N, 2):
if A[i] % 2:
ans += 1
print(ans)
if __name__ == "__main__":
run()
|
p02607 | s488957470 | 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 | s796924617 | Wrong Answer | n = int(input())
a = [int(x) for x in input().split()]
cnt = 0
for a0 in a[::1]:
if a0%2 == 1:
cnt += 1
print(cnt) |
p02607 | s482535834 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
ans = 0
for i, a in enumerate(A):
if (i + a) % 2 == 1:
ans += 1
print(ans) |
p02607 | s366214272 | Wrong Answer | N = int(input())
A = list(map(int,input().split()))
O = [i for i in range(N) if(i%2==1 and A[i]%2==1)]
print(len(O)) |
p02607 | s725016855 | 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 | s220001685 | Wrong Answer | n=input()
x=list(map(int,input().split()))
ans=0
for i in x[0::2]:
if i%2==1:
ans+=1
print(i)
print(ans) |
p02607 | s339921364 | Wrong Answer | in_str = input()
N = int(in_str)
in_list = input().split(' ')
count = 0
for i in range(N):
if i%2==0:
print(i)
if int(in_list[i])%2==1:
count += 1
print(i)
print(count)
print(count) |
p02607 | s108300753 | Wrong Answer | a = int(input())
b = list(map(int, input().split()))
count = 0
for i in range(a):
if i % 2 != 0:
if b[i] % 2 != 0:
count += 1
print(count) |
p02607 | s498805890 | Wrong Answer | N = int(input())
s = list(map(int, input().split()))
count = 0
for i in range(len(s)):
if (i%2 == 1) and s[i]%2 == 1:
count = count + 1
print(count) |
p02607 | s778151338 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(n//2):
if a[2*i] % 2 == 1:
ans += 1
print(ans)
|
p02607 | s500388210 | Wrong Answer | n =int(input())
li =list(map(int,input().split()))
count =0
for i in range(1,len(li),2):
if li[i] % 2 !=0:
count +=1
print(count) |
p02607 | s155812823 | Wrong Answer | a = int(input())
n = list(map(int,input().split()))
cnt = 1
ans = 0
for i in n:
cnt = cnt +1
if cnt % 2 == 1 and i % 2 == 1 :
ans = ans + 1
print (ans) |
p02607 | s162263395 | Wrong Answer | N = int(input())
a = list(map(int, input().split()))
count = 0;
for i in range(0,N):
if i % 2 == 1:
if a[i] % 2 == 1:
count = count+1
print(count) |
p02607 | s889002840 | Wrong Answer | N=int(input())
li=list(map(int,input().split()))
cnt=0
for i in range(N):
if li[i]%2!=0 and i%2==1:
cnt+=1
print(cnt)
|
p02607 | s437818623 | Wrong Answer | N = int(input())
tmp = input().split(' ')
a = []
result = []
for i in range(N):
a.append(int(tmp[i]))
if (i % 2 == 1 and a[i] % 2 == 1):
result.append(a[i])
print(len(result))
|
p02607 | s012369467 | 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 | s745207813 | Wrong Answer | N = int(input())
a = list(map(int, input().split()))
count = 0
for i in range(0,N):
if i % 2 == 1:
if a[i] % 2 == 1:
count = count+ 1
print(count) |
p02607 | s322712500 | Wrong Answer | import sys
import math
import statistics
import itertools
from collections import deque
n=int(input())
#l,r,d=map(int,input().split())
lis=list(map(int,input().split()))
ans=0
for i in range(n):
if i%2==1 and lis[i]%2==1:
ans+=1
print(ans) |
p02607 | s552068541 | 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 | s160182476 | 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 | s769945233 | Wrong Answer | N = int(input())
a = list(map(int, input().split()))
b = [(i * ai) % 2 for i, ai in enumerate(a)]
print(sum(b)) |
p02607 | s974510718 | Wrong Answer | N = int(input())
arr = list(map(int, input().split()))
count = 0
for i in range(N):
if (i%2 == 1) and (arr[i]%2 == 1):
count += 1
print(count) |
p02607 | s527980604 | Wrong Answer | 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 | s252006994 | Wrong Answer | N = int(input())
L = list(map(int, input().split()))
ans = 0
for i, l in enumerate(L):
if i % 2 == 1 and l % 2 == 1:
ans += 1
print(ans) |
p02607 | s824082082 | 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 :
cnt += 1
print(cnt)
|
p02607 | s972521254 | Wrong Answer | N = int(input())
ans = 0
Line = [int(s) for s in input().split()]
for i,x in enumerate(Line):
if i % 2 == 1:
# print(x)
if x % 2 == 1:
ans += 1
print(ans) |
p02607 | s870816622 | Wrong Answer | n = int(input())
lst = list(map(int, input().split()))
c = 0
for i in range(n):
if i % 2 == 1 and lst[i] % 2 == 1:
c += 1
print(c) |
p02607 | s513851576 | 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 | s254134047 | Wrong Answer | def main():
n = int(input())
A=[int(i) for i in input().split()]
res = 0
for i in range(1,n,2):
if(A[i]%2==1):
res+=1
print(res)
if __name__ == '__main__':
main()
|
p02607 | s168125278 | 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 == 1:
num += 1
print(num) |
p02607 | s039027192 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
ans = 0
for i in A[1::2]:
if i % 2 == 1:
ans += 1
print(ans) |
p02607 | s266593894 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
c=0
for i in range(0,n):
if i%2 == 1 and a[i]%2 == 1:
c+=1
print(c) |
p02607 | s284954774 | Wrong Answer | n=int(input())
li=list(map(int,input().split()))
a=0
for i in range(len(li)):
if i %2!=0:
if li[i]%2!=0:
a+=1
print(a) |
p02607 | s729658726 | Wrong Answer | n=input()
x=list(map(int,input().split()))
ans=0
for i in x[1::2]:
if i%2==1:
ans+=1 |
p02607 | s547061495 | Wrong Answer | N = int(input())
a = list(map(int,input().split()))
count = 0
for i in range(1,N):
if i % 2 != 0 and a[i] % 2 != 0:
count += 1
else:
pass
print(count) |
p02607 | s611619258 | Wrong Answer | N = int(input())
an = map(int, input().split(" "))
ans = 0
for i, ai in enumerate(an):
print(i+1, ai)
if (i+1) % 2 == 1 and ai % 2 == 1:
ans += 1
print(ans) |
p02607 | s275826896 | Wrong Answer | N = int(input())
a = []
a = input().split()
count = 0
for i in range(int(N/2)):
cd = 2 * i - 1
jd = int(a[cd])
if jd % 2 == 1:
count += 1
print(count) |
p02607 | s773629226 | Wrong Answer | n=input()
x=list(map(int,input().split()))
ans=0
for i in x[1::2]:
if i%2==1:
ans+=1
print(ans) |
p02607 | s076651201 | 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 | s479840987 | Wrong Answer | #!/usr/bin/env python3
import sys
from collections import deque, Counter
from heapq import heappop, heappush
from bisect import bisect_right
from itertools import accumulate
sys.setrecursionlimit(10**6)
INF = 10**12
m = 10**9 + 7
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 | s352095935 | Wrong Answer | N = int(input())
l = [ int(x) for x in input().split()]
def oddProblem(l):
count = 0
for i in range(N):
if (l[i] % 2 != 0 and i % 2 != 0):
count += 1
return count
print(oddProblem(l))
|
p02607 | s736938448 | Wrong Answer | #! python3
# coding:utf-8
n = int(input())
numlist = list(map(int,input().split()))
cnt=0
for i in range(len(numlist)):
if (i%2==1) and (numlist[i]%2==1):
cnt+=1
print(cnt)
|
p02607 | s076761259 | Wrong Answer | import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
N = I()
a = LI()
ans = 0
for i, A in enumerate(a):
if i % 2 == 1:
if A % 2 == 1:
ans += 1
print(ans) |
p02607 | s820037100 | Wrong Answer | N= map(int, input())
a = list(map(int,input().split())) |
p02607 | s723496765 | Wrong Answer | N = int(input())
a = list(map(int,input().split()))
count = 0
for i in range(N):
if i%2+a[i]%2 == 2:
count += 1
print(count)
|
p02607 | s708828362 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
count = 0
for i in range(1,N+1):
if i %2 != 0:
if A[i-1] != 0:
count +=1
print(count)
|
p02607 | s700825373 | 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 | s959402381 | Wrong Answer | #!/usr/bin/python3
# -*- coding: utf-8 -*-
n = int(input())
a_list = list(map(int, input().split()))
count = 0
for i in range(1, n, 2):
if a_list[i] % 2 == 1:
count += 1
print(count) |
p02607 | s387780553 | Wrong Answer |
N = int(input())
AAA = [int(i) for i in input().split()]
cnt = 0
for i in range(N):
if i % 2 == 1 and AAA[i] % 2 == 1:
cnt += 1
print(cnt) |
p02607 | s464948846 | Wrong Answer | N = int(input())
a = list(map(int,input().split()))
a.insert(0,0)
counter = 0
for i in range(0,N,2):
if a[i] % 2 == 1:
counter += 1
print(counter)
|
p02607 | s969683948 | Wrong Answer | n = int(input())
line = [int(x) for x in input().split()]
count = 0
for i in range(1, n, 2):
if line[i] % 2 != 0:
count += 1
print(count)
|
p02607 | s317027609 | 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
else:
cnt += 0
print(str(cnt)) |
p02607 | s103915627 | 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 | s232977715 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
cnt=0
for i in range(len(a)):
if (i+1)&1==a[i]==1:
cnt+=1
print(cnt) |
p02607 | s479153025 | 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:
cnt+=1
print(cnt) |
p02607 | s120830258 | Wrong Answer | n = int(input())
A = list(map(int, input().split()))
ans = 0
if len(A) > 2:
for a in A[::2]:
if a % 2 == 1:
ans += 1
print(ans) |
p02607 | s222649563 | Wrong Answer | a=int(input())
lst=list(map(int,input().split()))
print(a,lst)
cnt=0
for i in range(0,a,2):
if (lst[i] % 2==1) :
cnt+=1
print(i)
print(cnt) |
p02607 | s109494330 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
c=0
for i in range(0,n):
if i%2!=0 or a[i]%2!=0:
c+=1
print(c) |
p02607 | s604015741 | 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 | s316694986 | Wrong Answer | n = int(input())
z = input().split()
odd = 0
for i in range(n):
if i % 2 == 1:
if int(z[i]) % 2 == 1:
odd += 1
print(odd) |
p02607 | s830500285 | Wrong Answer | def main():
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)
if __name__ == "__main__":
main() |
p02607 | s245142371 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
counter = 0
for i in range(N):
checker_1 = i % 2 == 1
checker_2 = A[i] % 2 == 1
if checker_1 & checker_2:
counter += 1
print(counter) |
p02607 | s644546165 | Wrong Answer | N = int(input())
a = list(map(int, input().split()))
cnt = 0
for i, k in enumerate(a):
if i % 2 == 1 and k % 2 == 1:
cnt += 1
print(cnt) |
p02607 | s659722242 | 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 | s797456455 | Wrong Answer | #Problem B
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:
cnt += 1
print(cnt) |
p02607 | s501949867 | Wrong Answer | n = int(input())
lst = list(map(int, input().split()))
c = 0
for i in range(n):
if i % 2 == 1:
if lst[i] % 2 == 1:
c += 1
print(c)
|
p02607 | s343272877 | Wrong Answer | N=int(input())
a=list(map(int,input().split()))
count=0
for i in range(len(a)):
if (i%2==1)&(a[i]%2==1):
count+=1
print(count) |
p02607 | s271612287 | Wrong Answer | N = int(input()) #1行目のNを取得する
A = list(map(int,input().split()))
result = 0
for i in range(N):
if i % 2 == 1 and A[i] % 2 == 1:
result += 1
print(result)
|
p02607 | s372538806 | Wrong Answer | n = int(input())
a = input().split()
a = list(map(int,a))
s = 0
for i in range(n):
if(i%2!=0):
if(a[i]%2!=0):
s+=1
print(s) |
p02607 | s697145705 | Wrong Answer | n=int(input())
lst=list(map(int,input().split()))
cnt=0
for i in range(n):
if i%2==1 and lst[i]%2==1:
cnt+=1
print(cnt) |
p02607 | s454416435 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
c = 0
for i in range(n):
if i%2 != 0 and a[i] %2 != 0:
c +=1
print(c) |
p02607 | s631409399 | Wrong Answer | n= int(input())
arr = list(map(int,input().split()))
c=0
for i in range(1,n,2):
if (arr[i])%2==1:
c+=1
print(c) |
p02607 | s656349982 | 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 | s005265636 | Wrong Answer | N = int(input())
a = list(map(int, input().split()))
count = 0
for i, a in enumerate(a):
if i % 2 == 1:
if a % 2 == 1:
count += 1
print(count)
|
p02607 | s525295746 | Wrong Answer | a=int(input())
lst=list(map(int,input().split()))
print(a,lst)
cnt=0
for i in range(0,a,2):
if (lst[i] % 2==1) :
cnt+=1
print(cnt)
|
p02607 | s369622992 | Wrong Answer | N = int(input())
a = [int(i) for i in input().split()]
ans = 0
for i in range(N):
if i%2 == 1:
if a[i]%2 == 1:
ans += 1
print(ans) |
p02607 | s154154442 | Wrong Answer | n = int(input())
a = list(map(int,input().split()))
ans = 0
for i, a in enumerate(a):
if i % 2 == 1:
if a % 2 == 1:
ans += 1
print(ans) |
p02607 | s776899029 | 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 | s907080815 | 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 | s513279031 | Wrong Answer | N = int(input())
L = list(map(int, input().split()))
Ans = 0
for i in range(N):
if (L[i] %2 == 1) &( i % 2 == 1):
Ans += 1
print(Ans) |
p02607 | s073888399 | 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 | s754777454 | Wrong Answer | n=int(input())
a=list(map(int,input().split()))
c=0
for i in range(0,n):
if i%2!=0 and a[i]%2!=0:
c+=1
print(c) |
p02607 | s368278955 | Wrong Answer | n=int(input())
L=[int(i) for i in input().split()]
count=0
for i in range(1,n+1,2):
if(L[i-1]%2==0):
count+=1
print(count) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.