Submission #3725700

---

Source Code Expand

#include <iostream>
#include <algorithm>
#define SUM_MAX 10000
using namespace std;

int main() {
    int n;
    cin >> n;
    int p[n];
    for (int i = 0; i < n; i++) {
        cin >> p[i];
    }
    bool dp[n + 1][SUM_MAX + 1];
    for (int i = 0; i <= n; i++) {
        fill(dp[i], dp[i] + SUM_MAX + 1, false);
    }
    dp[0][0] = true;

    for (int i = 0; i < n; i++) {
        for (int j = 0; j <= SUM_MAX; j++) {
            if (dp[i][j]) {
                dp[i + 1][j] = true;
                dp[i + 1][j + p[i]] = true;
            }
        }
    }
    int ans = 0;
    for (int j = 0; j <= SUM_MAX; j++) {
        if (dp[n][j]) {
            ans++;
        }
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result