分析
dp处理一下,假设 f [ i ] [ j ] f[i][j] f[i][j]表示前 i i i个数中最后异或值为 j j j的情况有这么多种,然后状态转移方程就比较好写了
f[i][j] = f[i - 1][j] + f[i - 1][j ^ a[i]];
因为一个数字都不选相当于0,所以初始化状态为 f [ 0 ] [ 0 ] = 1 f[0][0] = 1 f[0][0]=1即可
代码
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 45,M = 1<<20;
const ll mod= 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a){char c=getchar();T x=0,f=1;while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
while(isdigit(c)){x=(x<<1)+(x<<3)+c-'0';c=getchar();}a=f*x;}
int gcd(int a,int b){return (b>0)?gcd(b,a%b):a;}
int a[N];
ll f[N][M];
int n,k;
int main(){
int T;
read(T);
int pppp = 0;
while(T--){
read(n),read(k);
memset(f,0,sizeof f);
for(int i = 1;i <= n;i++) read(a[i]);
f[0][0] = 1;
for(int i = 1;i <= n;i++)
for(int j = 0;j < M;j++){
f[i][j] = f[i - 1][j] + f[i - 1][j ^ a[i]];
}
ll res = 0;
for(int i = k;i < M;i++) res += f[n][i];
printf("Case #%d: %lld\n",++pppp,res);
}
}
/**
* ┏┓ ┏┓+ +
* ┏┛┻━━━┛┻┓ + +
* ┃ ┃
* ┃ ━ ┃ ++ + + +
* ████━████+
* ◥██◤ ◥██◤ +
* ┃ ┻ ┃
* ┃ ┃ + +
* ┗━┓ ┏━┛
* ┃ ┃ + + + +Code is far away from
* ┃ ┃ + bug with the animal protecting
* ┃ ┗━━━┓ 神兽保佑,代码无bug
* ┃ ┣┓
* ┃ ┏┛
* ┗┓┓┏━┳┓┏┛ + + + +
* ┃┫┫ ┃┫┫
* ┗┻┛ ┗┻┛+ + + +
*/