problem_id stringclasses 100
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 6 806 |
|---|---|---|---|
p02607 | s371174204 | Accepted | n = int(input())
li_a = list(map(int, input().split()))
answer = 0
for idx, v in enumerate(li_a, start=1):
if idx %2 != 0 and v %2 != 0:
answer += 1
print(answer)
|
p02607 | s079579096 | Accepted | N = int(input())
a = list(map(int,input().split()))
ans = 0
for i in range(len(a)):
if (i+1)%2==1 and a[i]%2==1:
ans += 1
print(ans) |
p02607 | s433768694 | Accepted | n = int(input())
a = [0] + list(map(int, input().split()))
cnt = 0
for i in range(1,n+1):
if i % 2 == 1 and a[i] % 2 == 1:
cnt += 1
print(cnt) |
p02607 | s288644710 | 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 | s084812300 | Accepted | n = int(input())
l = list(map(int,input().split()))
c = 0
for i in range(n):
if i%2==0:
if l[i]%2==1:
c += 1
print(c) |
p02607 | s255883194 | Accepted | N=int(input())
A=list(map(int,input().strip().split()))
cnt=0
for n in range(N):
if (n+1)%2==1 and A[n]%2==1:
cnt+=1
print(cnt) |
p02607 | s214411240 | Accepted | N=int(input())
A=list(map(int,input().split()))
c=0
for i in range(N):
if i%2==0 and A[i]%2==1:
c=c+1
print(c) |
p02607 | s312435996 | Accepted | N=int(input())
a=list(map(int,input().split()))
ans=0
num=1
for i in range(N):
if num%2==1 and a[i]%2==1:
ans+=1
num+=1
print(ans) |
p02607 | s499641851 | 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 | s286815247 | Accepted | n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(n)[::2]:
# print(a[i])
if a[i]%2 != 0:
ans += 1
print(ans) |
p02607 | s765656713 | Accepted | N = int(input())
A = list(map(int, input().split()))
count = 0
for i, j in enumerate(A, 1):
if i % 2 == 1 and j % 2 == 1:
count += 1
print(count) |
p02607 | s935207007 | Accepted | def main():
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)
main() |
p02607 | s920345757 | Accepted | n=int(input())
a=list(map(int,input().split()))
cnt=0
for i in range(n):
if i%2==0 and a[i]%2==1:
cnt+=1
print(cnt) |
p02607 | s578639989 | Accepted | N=int(input())
lista=list(map(int,input().split()))
count=0
for i in range(0,N,2):
if lista[i]%2==1:
count=count+1
print(count) |
p02607 | s474912565 | 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 | s904974423 | Accepted | N = int(input())
a = list(map(int,input().split()))
count = 0
for i in range(1,N+1):
if i % 2 == 1 and a[i-1] % 2 == 1:
count +=1
print(count) |
p02607 | s503281551 | Accepted | import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)
INF = float('inf')
N = int(input())
A = 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)
|
p02607 | s607589737 | Accepted | n = int(input())
a = list(map(int,input().split()))
cnt=0
for i in range(len(a)):
if (i+1)&1==a[i]&1==1:
cnt+=1
print(cnt) |
p02607 | s018632182 | Accepted | n=int(input())
a=list(map(int,input().split()))
c=0
for i in range(n):
if ((i+1)%2==1) and (a[i]%2==1):
c+=1
print(c) |
p02607 | s888024901 | Accepted | n = int(input())
lst = list(map(int, input().split()))
c = 0
for i in range(n):
if i % 2 == 0:
if lst[i] % 2 == 1:
c += 1
print(c) |
p02607 | s355375840 | Accepted | N = int(input())
a = list(map(int,input().split()))
k = 0
for i in range(N):
if (i % 2 == 0):
if (a[i] % 2 == 1):
k += 1
else:
continue
print(k) |
p02607 | s969121554 | 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 | s128170031 | Accepted | import sys
def resolve():
readline = sys.stdin.readline
N = int(readline())
a = [int(x) for x in readline().split()]
ans = 0
for i in range(N):
if (i + 1) % 2 == 1 and a[i] % 2 == 1:
ans += 1
print(ans)
resolve()
|
p02607 | s819653412 | Accepted | #!/usr/bin/env python3
import sys
input = sys.stdin.readline
n = int(input())
a = [int(item) for item in input().split()]
ans = 0
for i, item in enumerate(a):
if i % 2 == 0 and item % 2 == 1:
ans += 1
print(ans) |
p02607 | s378232398 | Accepted | N = int(input())
Ali = list(map(int,input().split()))
r = 0
for i in range(N):
if Ali[i]%2 == 1 and i%2 == 0:
r += 1
print(r) |
p02607 | s488124757 | Accepted | n=int(input())
a=[int(i) for i in input().split()]
ans=chk=0
for i in range(0,n,2):
if a[i]%2==1: ans+=1
print(ans) |
p02607 | s349324164 | Accepted | N = int(input())
al = list(map(int,input().split()))
cnt = 0
for i in range(1,N+1):
if i % 2 != 0 and al[i-1] % 2 != 0:
cnt += 1
print(cnt) |
p02607 | s910987835 | Accepted | n = int(input())
arr = list(map(int,input().split()))
print(sum(arr[i]%2!=0 and (i+1)%2!=0 for i in range(n))) |
p02607 | s204503471 | Accepted | n = int(input())
a = list(map(int, input().split()))
res = 0
for i in range(n):
if(i%2 == 0):
if(a[i]%2 == 1):
res+=1
print(res) |
p02607 | s711185067 | Accepted | N = int(input())
*a, = map(int, input().split())
ans = 0
for i in range(N):
if a[i] % 2 != 0 and (i+1) % 2 != 0:
ans += 1
print(ans) |
p02607 | s448540438 | Accepted | N = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(len(a)):
if (i+1)%2 == 1 and a[i] % 2 == 1:
ans += 1
print(ans) |
p02607 | s665413516 | Accepted | def resolve():
N = int(input())
a = [int(x) for x in input().split(" ")]
count = 0
for i, A in enumerate(a):
if i%2==0 and A%2==1:
count += 1
print(count)
if __name__ == "__main__":
resolve()
|
p02607 | s349613610 | Accepted | N = int(input())
A = list(map(int, input().split()))
cnt = 0
for i in range(N):
if i % 2 == 1:
continue
if A[i] % 2 == 1:
cnt += 1
print(cnt) |
p02607 | s339720364 | Accepted | # your code goes here
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 | s570326252 | Accepted | # B
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==1:
ans +=1
print(ans) |
p02607 | s494641912 | Accepted | n=int(input())
a=list(map(int,input().split()))
p=0
for i in range(n):
if((i%2==0)and(a[i]%2==1)):
p+=1
print(p) |
p02607 | s354157896 | Accepted | N = int(input())
a_lst = list(map(int, input().split()))
print(sum((i + 1) % 2 == 1 and a % 2 == 1 for i, a in enumerate(a_lst)))
|
p02607 | s310521408 | Accepted | def main():
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)
main() |
p02607 | s675029324 | Accepted | N = int(input())
A = list(map(int, input().split()))
nas = 0
for i in range(N):
if i%2 == 0:
if A[i] %2 == 1:
nas += 1
print(nas) |
p02607 | s346142008 | Accepted | N = int(input())
l = [int(x) for x in input().split()]
ans = 0
for i in range(N):
if (i+1) % 2 == 1 and l[i] % 2 == 1:
ans += 1
print(ans) |
p02607 | s823624426 | Accepted | N = int(input())
A = [int(X) for X in input().split()]
print(sum(True for T in range(1,N+1,2) if A[T-1]%2==1)) |
p02607 | s628835351 | Accepted | def main():
N = int(input())
A = [int(a) for a in input().split()]
ans = 0
for i in range(len(A)):
if (i + 1) % 2 == 1 and A[i] % 2 == 1:
ans += 1
print(ans)
if __name__ == "__main__":
main() |
p02607 | s420844678 | 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 | s739445247 | Accepted | N = int(input())
squares = list(map(int, input().split()))
count = 0
for i in range(N):
if (i+1) % 2 and squares[i] % 2:
count += 1
print(count) |
p02607 | s581441468 | Accepted | n = int(input())
A = list(map(int, input().split()))
result = 0
for i in range(0, n, 2):
if A[i] % 2 == 1:
result += 1
print(result) |
p02607 | s097620016 | Accepted | num_of_squares = int(input())
written_values = [i for i in input().split(" ")]
flag = 0
for i in range(num_of_squares):
if ((i + 1) % 2 != 0) & (int(written_values[i]) % 2 != 0):
flag += 1
print(flag)
|
p02607 | s900048306 | Accepted | input()
a = list(map(int, input().split()))
print(sum([ai % 2 for ai in a[::2]])) |
p02607 | s590955535 | Accepted | N = int(input())
c = 0
for i, a in enumerate(map(int, input().split())):
if i % 2 == 0 and a % 2 == 1:
c += 1
print(c) |
p02607 | s674733998 | 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 | s569772857 | Accepted | count = int(input())
nums = list(map(int,input().split()))
total = 0
for i in range(1,count +1):
if i%2 == 1 and nums[i-1] %2 == 1:
total += 1
print(total) |
p02607 | s907203767 | Accepted | N = int(input())
A = list(map(int, input().split()))
c = 0
for i in range(N):
if (i + 1) % 2 == 1 and A[i] % 2 == 1:
c+=1
print(c) |
p02607 | s580558743 | Accepted | n = int(input())
arr = list(map(int,input().split()))
ans = 0
for i in range(n):
if i %2 == 0 and arr[i]%2 == 1:
ans += 1
print(ans)
|
p02607 | s165306204 | Accepted | n = int(input())
a = list(map(int, input().split()))
odd = []
ans = []
for i in range(n):
if i%2 == 0:
odd.append(a[i])
for j in range(len(odd)):
if odd[j]%2 == 1:
ans.append(odd[j])
print(len(ans)) |
p02607 | s724843692 | Accepted | def main():
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)
if __name__ == "__main__":
main() |
p02607 | s951595349 | Accepted | n = int(input())
a = list(map(int, input().split()))
a.insert(0, 0)
ans = 0
for i in range(n+1):
if ((i % 2) == 0):
continue
if ((a[i] % 2) != 0):
ans += 1
print(ans)
|
p02607 | s678174175 | 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!=0:
cnt+=1
print(cnt)
|
p02607 | s718091085 | Accepted | n = int(input())
a = list(map(int, input().split()))
res = 0
for v in a[::2]:
if v % 2 == 1:
res += 1
print(res) |
p02607 | s711310556 | Accepted | N = int(input())
a = list(map(int, input().split()))
count = 0
a = a[::2]
for i in range(len(a)):
if a[i] % 2 == 1:
count += 1
print(count)
|
p02607 | s685814094 | 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 | s653850527 | Accepted | i = int(input())
a = list(map(int, input().split()))
ans = len([i for i, item in enumerate(a) if i%2==0 and item%2 ==1])
print(ans)
|
p02607 | s319450422 | Accepted | N = int(input())
a1 = [0]
a = a1+list(map(int,input().split()))
count=0
for i in range(1,N+1):
if(i%2==1):
if(a[i]%2==1):
#print(i,a[i])
count+=1
#print(a)
print(count) |
p02607 | s704419890 | Accepted | N = int(input())
A = [int(x) for x in input().split(" ")]
A = [a for i, a in enumerate(A) if i % 2 == 0 and a % 2 != 0]
print(len(A)) |
p02607 | s157943521 | Accepted | count = 0
n = int(input())
l = list(map(int,input().split()))
a = [i for i in range(1,n+1)]
for a,b in zip(a,l):
if not a%2==0 and not b%2==0:
count = count + 1
print(count) |
p02607 | s391477565 | Accepted | import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
n = int(input())
A = list(map(int,input().split()))
for i in range(n):
if i % 2 == 0 and A[i] % 2 == 1:
count += 1
print(count) |
p02607 | s578181020 | Accepted | N,*a = map(int, open(0).read().split())
ans = 0
for i in range(N):
if (i+1) % 2 == 1:
if a[i] % 2 == 1:
ans += 1
print(ans) |
p02607 | s371009394 | Accepted | n = int(input())
l = list(map(int,input().split()))
cnt = 0
for i in range(n):
if l[i] % 2 == 1 and i % 2 == 0:
cnt += 1
print(cnt)
|
p02607 | s275298974 | Accepted | N = int(input())
A = list(map(int, input().split()))
ans = 0
for i in range(0, N, 2):
ans += 1 if A[i] & 1 else 0
print(ans) |
p02607 | s752531335 | Accepted | N = int(input())
a = list(map(int, input().split()))
ans = 0
for num in range(N):
if num % 2 == 0 and a[num] % 2 == 1:
ans += 1
print(ans) |
p02607 | s871537524 | Accepted | n = int(input())
a = list(map(int,input().split()))
ans = 0
for i in range(n):
if (i+1) % 2 == 1:
if a[i] % 2 == 1:
ans += 1
print(ans) |
p02607 | s994961531 | Accepted | N = int(input())
A = list(map(int, input().split()))
num = 1
cnt = 0
for i in A:
if num%2!=0:
if i%2!=0:
cnt += 1
num += 1
print(cnt) |
p02607 | s092597284 | Accepted | import bisect
import copy
import heapq
import math
import sys
from collections import *
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product
def input():
return sys.stdin.readline()[:-1]
def ruiseki(lst):
return [0]+list(accumulate(lst))
sys.setrecursionlimit(500000)
mod=pow(10,9)+7
al=[chr(ord('a') + i) for i in range(26)]
direction=[[1,0],[0,1],[-1,0],[0,-1]]
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 | s730773451 | Accepted | n = int(input())
a = list(map(int, input().split()))
ans = 0
for i in range(1, n+1, 2):
if a[i-1]%2 == 1:
ans += 1
print(ans) |
p02607 | s981296199 | Accepted | N = int(input())
A = list(map(int,input().split()))
ans = 0
for i,a in enumerate(A):
if i%2==0 and a%2:
ans += 1
print(ans) |
p02607 | s961897611 | Accepted | n=int(input())
A=list(map(int,input().split()))
cnt=0
for i in range(n):
if i%2==0 and A[i]%2==1:
cnt+=1
print(cnt) |
p02607 | s013315136 | Accepted | input()
print(len([i for i in list(map(int,input().split()))[::2] if i%2])) |
p02607 | s683949707 | Accepted | N = int(input())
nums = [int(e) for e in input().split()]
count=0
for i in range(N):
if i%2==0:
if nums[i]%2==1:
count=count+1
print(count)
|
p02607 | s113681792 | Accepted | N = int(input())
a = list(map(int, input().split()))
b = [a[i] for i in range(N) if i % 2 == 0 and a[i] % 2 == 1]
print(len(b)) |
p02607 | s747370004 | Accepted | N = int(input())
A = list(int(a) for a in input().split())
ans = 0
for a, i in enumerate(A, 1):
if i%2==1 and a%2==1:
ans += 1
print(ans) |
p02607 | s884215117 | Accepted | 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+1) % 2 != 0):
count += 1
return count
print(oddProblem(l)) |
p02607 | s539379870 | Accepted | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N = int(readline())
A = list(map(int,readline().split()))
ans = 0
for i in range(N):
if i % 2 ==0 and A[i] % 2 ==1:
ans += 1
print(ans) |
p02607 | s338445967 | Accepted | n = int(input())
lst = [int(x) for x in input().split()]
count = 0
for i in range(0, n, 2):
if lst[i] % 2 == 1:
count += 1
print(count) |
p02607 | s857119315 | Accepted | def resolve():
N = int(input())
A = list(map(int,input().split()))
count = 0
for i in range(N):
if i % 2 == 0 and A[i]%2==1:
count+=1
print(count)
resolve() |
p02607 | s429023545 | Accepted | import sys
input = sys.stdin.readline
def main():
N = int(input())
a = list(map(int, input().split()))
ans = 0
for i, ai in enumerate(a):
if (i+1) % 2 == 1 and ai % 2 == 1:
ans += 1
print(ans)
if __name__ == "__main__":
main() |
p02607 | s027971577 | Accepted | n=int(input(''))
a=list(map(int,input('').split(' ')))
s=0
for i in range(n):
if (i+1)%2==1 and a[i]%2==1:
s=s+1
print(s) |
p02607 | s855760403 | Accepted | n=int(input())
A=list(map(int,input().split()))
cnt = 0
for i,a in enumerate(A):
if (i+1)%2 == 1 and a%2 == 1:
cnt+=1
print(cnt) |
p02607 | s148995631 | Accepted | n=int(input())
a=list(map(int,input().split()))
ans=0
for i,x in enumerate(a):
i+=1
if (i*x)%2==0:
continue
ans+=1
print(ans) |
p02607 | s308391359 | Accepted | # -*- coding: utf-8 -*-
import math
N = int(input())
# print(N)
ai = input().split(' ')
# print(ai)
num = 0
for i in range(N):
if i % 2 == 0:
if int(ai[i]) % 2 == 1:
# print('asd' + str(i))
# print('hoge' + str(ai[i*2]))
num += 1
print(num) |
p02607 | s174849546 | Accepted | # import sys
# input = sys.stdin.readline
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 == 0 and a[i] % 2 == 1:
ans += 1
print(ans)
|
p02607 | s961015460 | 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 | s531719558 | 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
print(ans) |
p02607 | s526387146 | Accepted | N = int(input())
num_list = list(map(int,input().split()))
cnt = 0
for i in range(N):
if (i+1)%2==1 and num_list[i] % 2 ==1:
cnt+=1
print(cnt) |
p02607 | s146312783 | Accepted | n = int(input())
a_list = list(map(int,input().split()))
sum = 0
for i in range(0,n,2):
if(a_list[i] % 2 != 0):
sum += 1
print(sum) |
p02607 | s329982377 | Accepted | N=int(input())
A=list(map(int,input().split()))
print(sum([i%2==0 and A[i]%2 for i in range(N)])) |
p02607 | s225103666 | Accepted | 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 | s796162991 | Accepted | import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
N = I()
a = LI()
ans = 0
for i in range(0,N,2):
if a[i] % 2 == 1:
ans += 1
print(ans) |
p02607 | s547089525 | Accepted | from itertools import product
N = int(input())
a = list(map(int,input().split()))
#L, R, d=map(int,input().split())
#C = []
# for i in range(N):
# C.append((input().replace(".","0").replace("#","1")))
# S=list(map(int,input().split()))
# B=list(map(int,input().split()))
count = 0
for i in range(N):
if (i+1) %2 != 0 and a[i] %2 !=0:
count+=1
print(count)
|
p02607 | s330748377 | 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:
ans += 1
print(ans)
|
p02607 | s912829645 | 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 | s460197478 | 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 | s754764294 | Accepted | ma = lambda :map(int,input().split())
ni = lambda:int(input())
import collections
import math
import itertools
gcd = math.gcd
n = ni()
A = list(ma())
c = 0
for i in range(n):
if i%2==0 and A[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.