Submission #1988600

---

Source Code Expand

#include <algorithm>
#include <cmath>
#include <iostream>
#include <iomanip>
#include <map>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <list>
#define INF 1000000000
#define MOD 1000000007ll
#define EPS 1e-10
#define REP(i,m) for(long long i=0; i<m; i++)
#define FOR(i,n,m) for(long long i=n; i<m; i++)
#define DUMP(a) for(long long dump=0; dump<(ll)a.size(); dump++) { cout<<a[dump]; if(dump!=(ll)a.size()-1) cout<<" "; else cout<<endl; }
#define ALL(v) v.begin(),v.end()
#define pb push_back
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
typedef long double ld;
using namespace std;

int main(){
	int n, a;
	cin >> n >> a;
	int x[n];
	REP(i, n){
		int p;
		cin >> p;
		x[i] = p - a;
	}
	ll count[n+1][5001] = { };
	REP(i, n) count[0][2500] = 1;
	FOR(i, 1, n+1){
		REP(j, 5001){
			count[i][j] = count[i-1][j] + count[i-1][j - x[i-1]];
		}
	}
	cout << count[n][2500] - 1 << endl;
	return 0;
}

Submission Info

Judge Result