Submission #855290

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define REP(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(x) (x).begin(), (x).end()

typedef long long ll;
typedef long double ld;

const int INF = 1e9;
const ld EPS = 1e-8;

int main(){
  int N, A;
  cin >> N >> A;
  vector<int> x(N);
  REP(i,N){
    int tmp;
    cin >> tmp;
    x[i] = tmp - A;
  }

  int pos = 3000;
  vector<vector<ll>> cnt(N + 1, vector<ll> (6000, 0));
  cnt[0][pos] = 1LL;
  REP(i,N) {
    REP(j,6000) {
      if(j + x[i] < 0 || j + x[i] >= 6000) continue;
      cnt[i + 1][j + x[i]] += cnt[i][j];
      cnt[i + 1][j] += cnt[i][j];
    }
  }

  cout << cnt[N][pos] - 1LL << endl;


  return 0;
}

Submission Info

Judge Result