Happy Matt Friends ——北京H

TimeLimit: 6000/6000 MS (Java/Others) MemoryLimit: 510000/510000 K (Java/Others)

64-bit integer IO format:%I64d

未提交 | 登录后收藏

Problem Description

Matt has N friends. They are playing a game together.

Each of Matt’s friends has a magic number. In the game, Matt selects some (could be zero) of his friends. If the xor (exclusive-or) sum of the selected friends’magic numbers is no less than M , Matt wins.

Matt wants to know the number of ways to win.

Input

The first line contains only one integer T , which indicates the number of test cases.

For each test case, the first line contains two integers N, M (1 ≤ N ≤ 40, 0 ≤ M ≤ 10 ⁶).

In the second line, there are N integers ki (0 ≤ k _i ≤ 10 ⁶), indicating the i-th friend’s magic number.

Output

For each test case, output a single line “Case #x: y”, where x is the case number (starting from 1) and y indicates the number of ways where Matt can win.

SampleInput

SampleOutput

Case #1: 4
Case #2: 2

 Hint
In the ﬁrst sample, Matt can win by selecting: friend with number 1 and friend with number 2. The xor sum is 3. friend with number 1 and friend with number 3. The xor sum is 2. friend with number 2. The xor sum is 2. friend with number 3. The xor sum is 3. Hence, the answer is 4.

Submit

题目统计信息详细


总AC数	5
通过人数	5
尝试人数	7
总提交量	26
AC率	19.23%

标签——1349

name	rating
背包型动态规划	4139
位运算	2806

AC该题后可以添加标签
贴完标签可以获得20ACB。
并且可以获得本题所有提交代码查看权限。
点击标题可以显示标签。
如果你还没认真思考过这题，请不要查看标签
如果您已经通过了该题，请务为该题贴上标签

出处

【闲的蛋疼】2014年区域赛现场赛铜牌题集合

Happy Matt Friends ——北京H

T^T Online Judge