Submission #854933

---

Source Code Expand

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

typedef long long ll;
const int MAX_N = 55;    // Change as necessary

ll A[MAX_N][MAX_N*MAX_N];

int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  
  ll n; cin >> n;
  ll AA; cin >> AA;
  
  A[0][0] = 1;
  ll sum = 0;
  for(int i=1;i<=n;i++){
    int x; cin >> x;
    sum += x;
    for(int j=i-1;j>=0;j--)
      for(int k=0;k<=sum;k++)
        if(A[j][k])
          A[j+1][k+x] += A[j][k];
  }
  
  ll ans = 0;
  for(int i=1;i<=n;i++)
    ans += A[i][i*AA];
  cout << ans << endl;
  
  return 0;
}

Submission Info

Judge Result