Submission #726047

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>

using namespace std;

#define FOR(i,a,b) for(long long i=(a);i<(b);i++)
#define REP(i,N) for(long long i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define fi first
#define se second

#define PI acos(-1.0)
#define INF 1000000007
#define EPS 1e-10

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<double, double> PD;
typedef pair<string, ll> PS;
typedef vector<ll> V;
typedef pair<P, char> PC;

int n, p[110];
int dp[110][10000];

int main(){
	int co = 0;
	cin >> n;
	REP(i, n)cin >> p[i];
	dp[0][p[0]] = 1;
	REP(i, n){
		REP(j, 10000){
			dp[i + 1][j] |= dp[i][j];
			if (j - p[i] >= 0){
				dp[i + 1][j] |= dp[i][j - p[i]];
			}
		}
	}
	REP(i, 10000){
		if (dp[n][i])co++;
	}
	cout << co << endl;
}

Submission Info

Judge Result