Submission #861539

---

Source Code Expand

#include <bits/stdc++.h>
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define fi first
#define se second
#define sz(a) ((int)(a).size())
#define rep(i, a, b) for(int (i) = (a); (i) < (b); (i)++)
#define dec(i, a, b) for (int (i) = (a); (i) >= (b); (i)--)
#define fit(itr,c) for(__typeof((c).begin()) itr = (c).begin();itr!=(c).end();itr++)
#define clr(a,v) memset(a, v, sizeof(a))
#define EPS 1e-8
#define all(a) (a).begin(),(a).end()
using namespace std;
typedef long long ll;
typedef vector <int> vi;
typedef pair <int, int> pii;
const int mod = 1e9 + 7;
inline void gn(long long&x){
	int sg=1;char c;while(((c=getchar())<'0'||c>'9')&&c!='-');c=='-'?(sg=-1,x=0):(x=c-'0');
	while((c=getchar())>='0'&&c<='9')x=x*10+c-'0';x*=sg;
}
inline void gn(int&x){long long t;gn(t);x=t;}

int n, k;
int a[55];
ll dp[55][2555][55];

ll solve(int i, int soma, int esc) {
	if(i == n && esc > 0 && soma % esc == 0) return ((soma/esc) == k);
	else if(i == n) return 0;

	ll ret = dp[i][soma][esc];
	if(ret != -1)return ret;
	ret = 0;
	ret += solve(i+1,soma, esc);
	ret += solve(i+1,soma+a[i],esc+1);
	return dp[i][soma][esc] = ret;
}

int main() {
	clr(dp,-1);
	gn(n);gn(k);
	rep(i,0,n)gn(a[i]);
	cout << solve(0,0,0) << endl;
}

Submission Info

Judge Result