Time limit : 2sec / Memory limit : 256MB
Score : 200 points
There are N bags of biscuits. The i-th bag contains A__i biscuits.
Takaki will select some of these bags and eat all of the biscuits inside. Here, it is also possible to select all or none of the bags.
He would like to select bags so that the total number of biscuits inside is congruent to P modulo 2. How many such ways to select bags there are?
Input is given from Standard Input in the following format:
N P
A_1 _A_2 … _A__N
Print the number of ways to select bags so that the total number of biscuits inside is congruent to P modulo 2.
2 0
1 3
2
There are two ways to select bags so that the total number of biscuits inside is congruent to 0 modulo 2:
1 1
50
0
3 0
1 1 1
4
Two bags are distinguished even if they contain the same number of biscuits.
45 1
17 55 85 55 74 20 90 67 40 70 39 89 91 50 16 24 14 43 24 66 25 9 89 71 41 16 53 13 61 15 85 72 62 67 42 26 36 66 4 87 59 91 4 25 26
17592186044416
排列组合
#include
#include
#include
#include
#include
#include
#include
#include
手机扫一扫
移动阅读更方便
你可能感兴趣的文章