Submission #1832865

---

Source Code Expand

#include <vector>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>

#define REP(i,n)for (int i=0;i<(n);i++)
#define PB push_back
#define MP make_pair
#define ALL(a) (a).begin(),(a).end()
#define ll long long
using namespace std;
int main(){
    vector<int>V1,V2;
    int n,x;
    cin>>n>>x;
    int w[32];
    REP(i,n)cin>>w[i];
    REP(i,1<<(n/2)){
        int res=0;
        REP(j,n/2)if(1&(i>>j))res+=w[j];
        V1.PB(res);
    }
    REP(i,1<<((n+1)/2)){
        int res=0;
        REP(j,(n+1)/2)if(1&(i>>j))res+=w[n/2+j];
        V2.PB(res);
    }
    sort(ALL(V2));
    int ans=0;
    REP(i,V1.size()){
        ans+=(upper_bound(ALL(V2),x-V1[i])-lower_bound(ALL(V2),x-V1[i]));
    }
    cout<<ans<<endl;
}

Submission Info

Judge Result