Submission #1780698

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
#define pq priotity_queue
#define P pair<int,int>
#define P2 pair<int,P>
#define P3 pair<int,P2>
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, around[]={0,1,1,-1,-1,0,-1,1,0,0};
const ld PI=abs(acos(-1));
ll n,a,A;

int main(){
	cin >> n >> A;
	
	ll dp[5010][55];
	REP(i,0,5010) REP(j,0,55) dp[i][j]=0;
	dp[0][0]=1;
	REP(i,0,n){
		cin >> a;
		RREP(j,5000,0){
			REP(k,0,n){
				if(dp[j][k] and j+a<5010) dp[j+a][k+1]+=dp[j][k];
			}
		}
	}
	
	ll c=0;
	REP(i,1,n+1) if(i*A<5000 and dp[i*A][i]) c+=dp[i*A][i];
		
	cout << c << endl;
	return 0;
}

Submission Info

Judge Result