hdu5119(整数划分）

Happy Matt Friends

Time Limit: 6000/6000 MS (Java/Others)    Memory Limit: 510000/510000 K (Java/Others)
Total Submission(s): 3549    Accepted Submission(s): 1367

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.

 

Sample Input

2 3 2 1 2 3 3 3 1 2 3

 

Sample Output

Case #1: 4 Case #2: 2

Hint

In the first 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.

确实难，亚洲赛的。。。推了半天dp式子结果TLM 百度了下，发现滚动数组这种东西666MOD然后利用已用过但是没用的空间 妙哉

#include <iostream>
#include <cstring>
using namespace std;
long long dp[2][15000000];
int main()
{
    int t,k,n,m,a[45];
    long long ans;
    cin>>t;
    k=0;
    while(t--)
    {
        k++;
        cin>>n>>m;
        for(int i=1;i<=n;i++) cin>>a[i];
        memset(dp,0,sizeof(dp));
        dp[0][0]=1;
        for(int i=1;i<=n;i++)
            for(int j=0;j<15000000;j++)
                dp[i%2][j]=dp[(i-1)%2][j]+dp[(i-1)%2][j^a[i]];
        ans=0;
        for(int i=m;(i<15000000);i++)
            ans+=dp[n%2][i];
        cout<<"Case #"<<k<<": "<<ans<<endl;
    }
    return 0;
}