Submission #1454606

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <utility>
#include <queue>
#include <string>
#include <set>
#include <climits>
using namespace std;

#define MAX 10005

int main()
{
    int n, p, count = 0;
    cin >> n;
    vector<int> memo(MAX, 0);
    memo[0] = 1;
    for (int i = 0; i < n; i++) {
        cin >> p;
        for (int j = MAX - p; j >= 0; j--) {
            memo[j + p] |= memo[j];
        }
    }
    for (int i = 0; i < MAX; i++) {
        count += memo[i];
    }
    cout << count << endl;
    return 0;
}

Submission Info

Judge Result