Submission #1389456

---

Source Code Expand

#include<iostream>
#include<vector>
#include<string>
using namespace std;

#define FOR(k,m,n) for(int (k)=(m);(k)<(n);(k)++)
#define rep(i,n) FOR((i),0,(n))

typedef long long ll;

const int INF=1e9+7;
ll dp[51][2600];
int main(){
	int n,a;
	cin>>n>>a;
	dp[0][0]=1;
	rep(i,n){
		int x;
		cin>>x;
		for(int j=2560-x;j>=0;j--)for(int k=50;k>=1;k--)dp[k][j+x]+=dp[k-1][j];	
	}
	ll ans=0;
	for(int i=1;i<2550;i++)for(int j=1;j<51;j++)if(i==a*j)ans+=dp[j][i];
	cout<<ans<<endl;
}

Submission Info

Judge Result