Submission #5033201


Source Code Expand

N, P = [int(x) for x in input().split()]
As = [int(x) for x in input().split()]

def combination(n, r):
    ans = 1
    for i in range(n, n - r, -1):
        ans *= i
    for i in range(r):
        ans //= (i + 1)
    return ans
n_e = len(list(filter(lambda x: x % 2 == 0, As)))
n_o = N - n_e

ans = 0
for i in range((1 if P == 1 else 0), n_o + 1, 2):
    ans += int(pow(2, n_e)) * combination(n_o, i)

print(ans)

Submission Info

Submission Time
Task A - Biscuits
User hiroaki8270
Language Python (3.4.3)
Score 200
Code Size 432 Byte
Status AC
Exec Time 17 ms
Memory 3064 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 200 / 200
Status
AC × 4
AC × 16
Set Name Test Cases
Sample sample1.txt, sample2.txt, sample3.txt, sample4.txt
All sample1.txt, sample2.txt, sample3.txt, sample4.txt, in1.txt, in2.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, sample1.txt, sample2.txt, sample3.txt, sample4.txt
Case Name Status Exec Time Memory
in1.txt AC 17 ms 3064 KB
in2.txt AC 17 ms 3064 KB
in3.txt AC 17 ms 3064 KB
in4.txt AC 17 ms 3064 KB
in5.txt AC 17 ms 3064 KB
in6.txt AC 17 ms 3064 KB
in7.txt AC 17 ms 3064 KB
in8.txt AC 17 ms 3064 KB
sample1.txt AC 17 ms 3064 KB
sample2.txt AC 17 ms 3064 KB
sample3.txt AC 17 ms 3064 KB
sample4.txt AC 17 ms 3064 KB