Submission #855693

---

Source Code Expand

#include<iostream>
#include<iomanip>
#include<algorithm>
#include<array>
#include<bitset>
#include<cassert>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<cstring>
#include<functional>
#include<limits>
#include<list>
#include<map>
#include<numeric>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<queue>
#include<vector>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using pii = pair<int, int>;

#define dump(o) { cerr << #o << " " << o << endl; }
#define dumpc(o) { cerr << #o; for (auto &e : (o)) cerr << " " << e; cerr << endl; }
#define MOD 1000000007
#define INF 0x3f3f3f3f
#define INFL 0x3f3f3f3f3f3f3f3fLL

const int MAX = 50 * 50 + 1;

signed main() {
	int N, A; cin >> N >> A;
	vector<int> x(N);
	ll dp[51][MAX] = {};
	dp[0][0] = 1;
	for (int i = 0; i < N; i++) {
		cin >> x[i];
		for (int j = N; j > 0; j--) {
			for (int k = MAX - 51; k >= 0; k--) {
				dp[j][k + x[i]] += dp[j - 1][k];
			}
		}
	}
	ll ans = 0;
	for (int i = 1; i <= N; i++) {
		//dumpc(dp[i]);
		ans += dp[i][i*A];
	}
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result