#include <bits/stdc++.h>
using namespace std;
#define int long long
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
const int N=1e6+5,mod=1e9+7,inf=1e18;
int n,m,a[N],ans;
vector <int> v;
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
cin>>n>>m;
for (int i=1; i<=n; i++) cin>>a[i];
for (int bm=0; bm<(1ll<<(n/2)); bm++){
int x=0;
for (int i=0; i<n/2; i++){
if ((bm>>i&1)) x+=a[i+1];
}
v.push_back(x);
}
sort(v.begin(),v.end());
for (int bm=0; bm<(1ll<<((n+1)/2)); bm++){
int x=0;
for (int i=0; i<=n/2; i++){
if ((bm>>i&1)) x+=a[i+n/2+1];
}
ans+=upper_bound(v.begin(),v.end(),m-x)-v.begin();
}
cout<<ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |