Submission #3823234

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxx = 1e5 + 7;
const int Inf = 1 << 30;
const int N = 55;
int n, a;
ll dp[N][N * N];
ll ans;

int main() {
	cin >> n >> a;
	dp[0][0] = 1;
	for(int i = 1; i <= n; i++) {
		int x;
		cin >> x;
		for(int j = i - 1; j >= 0; j--)
			for(int k = 0; k <= N * j; k++) dp[j + 1][k + x] += dp[j][k];
	}
	for(int i = 1; i <= n; i++) ans += dp[i][i * a];
	cout << ans << endl;
}

Submission Info

Judge Result