Submission #5552584

---

Source Code Expand

#include <iostream>
#include <string>
#include <functional>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <math.h>
#include <iomanip>
#include <map>

using namespace std;
using ll = long long;

int main()
{
	int n, a;
	cin >> n >> a;

	vector< vector <vector <ll> > > v(n + 1, vector <vector <ll> > (n + 1, vector<ll>(50 * n + 1, 0)));
	v[0][0][0] = 1;

	for (int i = 1; i <= n; ++i)
	{
		int x;
		cin >> x;

		for (int j = 0; j < i; ++j)
		{
			for (int k = 0; k < 50 * n + 1 - x; ++k)
			{
				v[i][j][k] += v[i - 1][j][k];
				v[i][j + 1][k + x] += v[i - 1][j][k];
			}
		}

	}

	ll cnt = 0;

	for (int j = 1; j <= n; ++j)
	{
		for (int k = 0; k <= 50 * n; ++k)
		{
			if (k == j * a)
				cnt += v[n][j][k];
		}
	}

	cout << cnt << endl;

	return 0;
}

Submission Info

Judge Result