Submission #6438106

---

Source Code Expand

#include <bits/stdc++.h>
#define debug(x) cerr << #x << ": " << x << '\n';
using namespace std;
using ll = long long;
using P = pair<int, int>;
const int INF = (int)1e9;

int main(void){
    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(dp.begin(), dp.end(), true) << '\n';

    return 0;
}

Submission Info

Judge Result