Submission #3245951

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define REP(i, n) for(int i = 0; i < n; i++)
#define REPR(i, n) for(int i = n - 1; i >= 0; i--)
#define FOR(i, m, n) for(int i = m; i < n; i++)
#define FORR(i, m, n) for(int i = m; i >= n; i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define ll long long
#define pb(a) push_back(a)

ll dp[51][2501];

int main(){
  int n, a;
  cin >> n >> a;
  int x[n];
  REP(i, n) cin >> x[i];

  dp[0][0] = 1;

  REP(i, n){
    REPR(j, n){
      REP(k, 2501 - x[i]){
        dp[j + 1][k + x[i]] += dp[j][k];
      }
    }
  }

  ll ans = 0;
  REP(i, n + 1) ans += dp[i + 1][(i + 1) * a];

  cout << ans << endl;

}

Submission Info

Judge Result