Submission #855923

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

typedef pair<int,int> pii;
typedef long long ll;
typedef vector<int> vi;

#define rep(i,j) for(int i=0;i<(j);i++)
#define reps(i,j,k) for(int i=j;i<=k;i++)
#define in(i,j,k) ((i)>=(j)&&(i)<=(k))
#define INF (1<<28)
#define pb(i) push_back(i)
#define fs first
#define sc second

const char dx[]={0,1,0,-1},dy[]={1,0,-1,0};

ll dp[51][51][2501];

int main(){
	int n,a;
	cin >> n >> a;
	vi v(n);
	rep(i,n)cin >> v[i];
//	rep(i,n) cout << v[i] <<endl;
	dp[0][0][0] = 1;
	reps(i,1,n){
		rep(j,i){
			rep(k,50*n){
					dp[i][j][k] += dp[i-1][j][k];
					if(k+v[i-1]<2501) dp[i][j+1][k+v[i-1]] += dp[i-1][j][k];
			}
		}
	}
	int cnt = 0;
	reps(j,1,n){
		cnt += dp[n][j][a*j];
	}
	cout << cnt << endl;
	return 0;
}

Submission Info

Judge Result