Submission #856655

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <cstdlib>
#include <climits>

using namespace std;

int N,A;
int64_t C;

int main (int argc, char const *argv[])
{
  cin >> N >> A;
  vector<int> xs;
  for (size_t i = 0; i < N; i++) {
    int x; cin >> x; xs.push_back(x);
  }
  sort(xs.begin(),xs.end());

  int64_t state = 1;
  int64_t stop = 1<<N;
  int64_t ans = 0;
  while(state<stop) {
    int64_t sum=0, cnt=0;
    for (size_t i = 0; i < N; i++) {
      if(state&(1<<i)) {
        sum+=xs[i]; ++cnt;
      }
    }
    if(sum==cnt*A) ++ans;
    ++state;
  }

  cout << ans << endl;
  return 0;
}

Submission Info

Judge Result