Submission #6482865

---

Source Code Expand

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;
const ll INF = 1e10;
const ll MOD = 1e9 + 7;

int main(){
    int N; cin >> N;
    vector<int> P(N);
    for (int i = 0; i < N; i++) { cin >> P[i]; }

    vector<bool> dp(10001);
    dp[0] = true;
    for (int i = 0; i < N; i++) {
        for (int j = 10000 - P[i]; j >= 0; j--) {
            if (dp[j])
                dp[j + P[i]] = true;
        }
    }

    cout << count(begin(dp), end(dp), true) << endl;
    return 0;
}

Submission Info

Judge Result