Submission #1409066

---

Source Code Expand

from collections import Counter

n, p = map(int, raw_input().rstrip().split(' '))
a = map(int,raw_input().rstrip().split(' '))
ct = Counter(ai%2 for ai in a)
even, odd = ct[0], ct[1]
c_even = 2**even
nCk = 1
n = odd
k = 0
d = n
c_odd = 0
while k <= n:
    if k % 2 == p:
        c_odd += nCk
    k += 1
    nCk = nCk * d / k
    d -= 1
print c_even * c_odd

Submission Info

Judge Result