Submission #2742034

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>

using namespace std;
#define REP(i,n) for(int i = 0; i <(int)(n); i++)

typedef long long ll;

const int NMAX = 51;
//const int VMAX = 51*51+1;
const int VMAX = 100;
ll dp[NMAX][NMAX][VMAX];

int main() {
  dp[0][0][0] = 1;
  int N, A; cin>>N>>A;
  vector<int> data(N);
  REP(i,N) cin>>data[i];
  REP(i,N) {
    int x = data[i];
    int from = i, to = i+1;

    for(int a = 0; a < NMAX; a++)
      for(int b = 0; b < VMAX; b++)
	dp[to][a][b] = 0LL;


    for(int m = 0; m < N; m++) {
      for(int v = 0; v < VMAX; v++) {
	dp[to][m][v] += dp[from][m][v];
	if(m+1 < NMAX && v+x < VMAX) {
	  dp[to][m+1][v+x] += dp[from][m][v];
#ifdef DEBUG
	  cout << i<<to<<","<<m+1 << "," << v+x << "," << dp[to][m+1][v+x] << endl;
#endif
	}
      }
    }
  }
  ll ans = 0;
  for(int i = 1; i <= N; i++) {
#ifdef DEBUG
    cout << i << " " << dp[N][i][A*i] << endl;
#endif
    ans += dp[N][i][A*i];
  }
  cout << ans << endl;
  return 0;
}

Submission Info

Judge Result