Submission #1662399

---

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--)
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7;
int n,m,a;
ll dp[110][25];

int main(){
	cin >> n >> a;
	
	dp[0][a]=1;
	REP(i,1,n-1){
		cin >> a;
		REP(j,0,21){
			if(j+a<=20) dp[i][j]+=dp[i-1][j+a];
			if(j-a>=0)  dp[i][j]+=dp[i-1][j-a];
		}
	}
	cin >> a;
	
	cout << dp[n-2][a] << endl;
	return 0;
}

Submission Info

Judge Result